{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/colorize-mask","entry":"colorize_mask","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":21,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":16,"n_papers_ran_instrument_only":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":25,"n_places_pointer_only":19,"n_places_pointer_only_link_open":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":5,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2601.01167","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-01167","title":"Cross-Layer Attentive Feature Upsampling for Low-latency Semantic Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hustvl/simpleseg","path":"simpleseg/datasets/mapillary.py","file_url":"https://github.com/hustvl/simpleseg/blob/HEAD/simpleseg/datasets/mapillary.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hustvl/simpleseg when it was checked","code_sha256":"56db7252caf1ec74","code_sha256_prefix":"56db7252caf1ec74","mcp_get_code":{"code_sha256":"56db7252caf1ec74"}},{"arxiv_id":"2311.13254","arxiv_id_is_arxiv":true,"paper":"/paper/da-stc-domain-adaptive-video-semantic","title":"Unified Domain Adaptive Semantic Segmentation","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhe-sapi/udass","path":"video_udass/Code_for_Optical_Flow_Estimation/Cityscapes_val_optical_flow_scale512.py","file_url":"https://github.com/zhe-sapi/udass/blob/HEAD/video_udass/Code_for_Optical_Flow_Estimation/Cityscapes_val_optical_flow_scale512.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhe-sapi/udass when it was checked","code_sha256":"9d4f35cc87463ef0","code_sha256_prefix":"9d4f35cc87463ef0","mcp_get_code":{"code_sha256":"9d4f35cc87463ef0"}},{"arxiv_id":"2307.06099","arxiv_id_is_arxiv":true,"paper":"/paper/rfenet-towards-reciprocal-feature-evolution","title":"RFENet: Towards Reciprocal Feature Evolution for Glass Segmentation","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vankouf/rfenet","path":"datasets/GSD.py","file_url":"https://github.com/vankouf/rfenet/blob/HEAD/datasets/GSD.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vankouf/rfenet when it was checked","code_sha256":"a9e944d7a41859d3","code_sha256_prefix":"a9e944d7a41859d3","mcp_get_code":{"code_sha256":"a9e944d7a41859d3"}},{"arxiv_id":"2307.06099","arxiv_id_is_arxiv":true,"paper":"/paper/rfenet-towards-reciprocal-feature-evolution","title":"RFENet: Towards Reciprocal Feature Evolution for Glass Segmentation","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vankouf/rfenet","path":"datasets/Trans10k.py","file_url":"https://github.com/vankouf/rfenet/blob/HEAD/datasets/Trans10k.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, vankouf/rfenet when it was checked","code_sha256":"8e206ed4da56ea90","code_sha256_prefix":"8e206ed4da56ea90","mcp_get_code":{"code_sha256":"8e206ed4da56ea90"}},{"arxiv_id":"2303.05194","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-model-adaptation-for-cross","title":"Contrastive Model Adaptation for Cross-Condition Robustness in Semantic Segmentation","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brdav/cma","path":"models/model.py","file_url":"https://github.com/brdav/cma/blob/HEAD/models/model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f024ae9ce23a4ace","code_sha256_prefix":"f024ae9ce23a4ace","mcp_get_code":{"code_sha256":"f024ae9ce23a4ace"}},{"arxiv_id":"2106.02885","arxiv_id_is_arxiv":true,"paper":"/paper/category-contrast-for-unsupervised-domain","title":"Category Contrast for Unsupervised Domain Adaptation in Visual Tasks","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/CaCo","path":"caco_vanilla_finetune/evaluate_cityscapes.py","file_url":"https://github.com/jxhuang0508/CaCo/blob/HEAD/caco_vanilla_finetune/evaluate_cityscapes.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"2106.02874","arxiv_id_is_arxiv":true,"paper":"/paper/rda-robust-domain-adaptation-via-fourier","title":"RDA: Robust Domain Adaptation via Fourier Adversarial Attacking","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/RDA","path":"crst/deeplab/datasets_advent.py","file_url":"https://github.com/jxhuang0508/RDA/blob/HEAD/crst/deeplab/datasets_advent.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"2106.02874","arxiv_id_is_arxiv":true,"paper":"/paper/rda-robust-domain-adaptation-via-fourier","title":"RDA: Robust Domain Adaptation via Fourier Adversarial Attacking","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/RDA","path":"crst/evaluate_advent.py","file_url":"https://github.com/jxhuang0508/RDA/blob/HEAD/crst/evaluate_advent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from yzou2/CRST, and GitHub detected no licence in that repository when it was checked","code_sha256":"90009a990acf6c4d","code_sha256_prefix":"90009a990acf6c4d","mcp_get_code":{"code_sha256":"90009a990acf6c4d"}},{"arxiv_id":"2106.02874","arxiv_id_is_arxiv":true,"paper":"/paper/rda-robust-domain-adaptation-via-fourier","title":"RDA: Robust Domain Adaptation via Fourier Adversarial Attacking","date":"2021-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/RDA","path":"crst/crst_seg_advent.py","file_url":"https://github.com/jxhuang0508/RDA/blob/HEAD/crst/crst_seg_advent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9a6f5d02f50c40a","code_sha256_prefix":"b9a6f5d02f50c40a","mcp_get_code":{"code_sha256":"b9a6f5d02f50c40a"}},{"arxiv_id":"2103.02584","arxiv_id_is_arxiv":true,"paper":"/paper/cross-view-regularization-for-domain-adaptive","title":"Cross-View Regularization for Domain Adaptive Panoptic Segmentation","date":"2021-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhuang0508/CVRN","path":"cvrn_train_r/ADVENT/CRST/crst_seg_aux_ss_trg_cross_style_pseudo_label_generation.py","file_url":"https://github.com/jxhuang0508/CVRN/blob/HEAD/cvrn_train_r/ADVENT/CRST/crst_seg_aux_ss_trg_cross_style_pseudo_label_generation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b9a6f5d02f50c40a","code_sha256_prefix":"b9a6f5d02f50c40a","mcp_get_code":{"code_sha256":"b9a6f5d02f50c40a"}},{"arxiv_id":"2007.07936","arxiv_id_is_arxiv":true,"paper":"/paper/classmix-segmentation-based-data-augmentation","title":"ClassMix: Segmentation-Based Data Augmentation for Semi-Supervised Learning","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WilhelmT/ClassMix","path":"utils/helpers.py","file_url":"https://github.com/WilhelmT/ClassMix/blob/HEAD/utils/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"980e8f8763638799","code_sha256_prefix":"980e8f8763638799","mcp_get_code":{"code_sha256":"980e8f8763638799"}},{"arxiv_id":"2004.06042","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-style-mining-for-one-shot","title":"Adversarial Style Mining for One-Shot Unsupervised Domain Adaptation","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"2004.05498","arxiv_id_is_arxiv":true,"paper":"/paper/fda-fourier-domain-adaptation-for-semantic","title":"FDA: Fourier Domain Adaptation for Semantic Segmentation","date":"2020-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YanchaoYang/FDA","path":"evaluation_multi.py","file_url":"https://github.com/YanchaoYang/FDA/blob/HEAD/evaluation_multi.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, YanchaoYang/FDA when it was checked","code_sha256":"cf07bfa080a99bc0","code_sha256_prefix":"cf07bfa080a99bc0","mcp_get_code":{"code_sha256":"cf07bfa080a99bc0"}},{"arxiv_id":"2003.08040","arxiv_id_is_arxiv":true,"paper":"/paper/differential-treatment-for-stuff-and-things-a","title":"Differential Treatment for Stuff and Things: A Simple Unsupervised Domain Adaptation Method for Semantic Segmentation","date":"2020-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment","path":"SSL.py","file_url":"https://github.com/SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment/blob/HEAD/SSL.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, SHI-Labs/Unsupervised-Domain-Adaptation-with-Differential-Treatment when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"2003.03773","arxiv_id_is_arxiv":true,"paper":"/paper/rectifying-pseudo-label-learning-via","title":"Rectifying Pseudo Label Learning via Uncertainty Estimation for Domain Adaptive Semantic Segmentation","date":"2020-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"2003.00867","arxiv_id_is_arxiv":true,"paper":"/paper/learning-texture-invariant-representation-for","title":"Learning Texture Invariant Representation for Domain Adaptation of Semantic Segmentation","date":"2020-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1912.11164","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-scene-adaptation-with-memory","title":"Unsupervised Scene Adaptation with Memory Regularization in vivo","date":"2019-12-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1908.09822","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-regularized-self-training","title":"Confidence Regularized Self-Training","date":"2019-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yzou2/CRST","path":"evaluate.py","file_url":"https://github.com/yzou2/CRST/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yzou2/CRST when it was checked","code_sha256":"90009a990acf6c4d","code_sha256_prefix":"90009a990acf6c4d","mcp_get_code":{"code_sha256":"90009a990acf6c4d"}},{"arxiv_id":"1901.05427","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-for-structured-output-via","title":"Domain Adaptation for Structured Output via Discriminative Patch Representations","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wasidennis/AdaptSegNet","path":"pytorch_0.4/evaluate_cityscapes.py","file_url":"https://github.com/wasidennis/AdaptSegNet/blob/HEAD/pytorch_0.4/evaluate_cityscapes.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wasidennis/AdaptSegNet when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1809.09478","arxiv_id_is_arxiv":true,"paper":"/paper/taking-a-closer-look-at-domain-shift-category","title":"Taking A Closer Look at Domain Shift: Category-level Adversaries for Semantics Consistent Domain Adaptation","date":"2018-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RoyalVane/CLAN","path":"CLAN_evaluate.py","file_url":"https://github.com/RoyalVane/CLAN/blob/HEAD/CLAN_evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1802.10349","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-adapt-structured-output-space-for","title":"Learning to Adapt Structured Output Space for Semantic Segmentation","date":"2018-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lym29/DASeg","path":"evaluate_cityscapes.py","file_url":"https://github.com/lym29/DASeg/blob/HEAD/evaluate_cityscapes.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lym29/DASeg when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1704.08509","arxiv_id_is_arxiv":true,"paper":"/paper/no-more-discrimination-cross-city-adaptation","title":"No More Discrimination: Cross City Adaptation of Road Scene Segmenters","date":"2017-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamycheung/trans4pass","path":"adaptations/evaluate.py","file_url":"https://github.com/jamycheung/trans4pass/blob/HEAD/adaptations/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from lym29/DASeg, and GitHub detected no licence in that repository when it was checked","code_sha256":"21ac171a17099011","code_sha256_prefix":"21ac171a17099011","mcp_get_code":{"code_sha256":"21ac171a17099011"}},{"arxiv_id":"1702.01105","arxiv_id_is_arxiv":true,"paper":"/paper/joint-2d-3d-semantic-data-for-indoor-scene","title":"Joint 2D-3D-Semantic Data for Indoor Scene Understanding","date":"2017-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jamycheung/trans4pass","path":"adaptations/evaluate_out13.py","file_url":"https://github.com/jamycheung/trans4pass/blob/HEAD/adaptations/evaluate_out13.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e27caf70d841dc1a","code_sha256_prefix":"e27caf70d841dc1a","mcp_get_code":{"code_sha256":"e27caf70d841dc1a"}},{"arxiv_id":"Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Li_From_Contexts_to_Locality_Ultra-High_Resolution_Image_Segmentation_via_Locality-Aware_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"liqiokkk/FCtL","path":"models/helpers.py","file_url":"https://github.com/liqiokkk/FCtL/blob/HEAD/models/helpers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"980e8f8763638799","code_sha256_prefix":"980e8f8763638799","mcp_get_code":{"code_sha256":"980e8f8763638799"}}],"record_sha256":"d9baad1dfeb1ab12f09392e18268a403bbbfda57d21eabf124f7f376eda9a84b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}