{"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/outs","entry":"outS","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":12,"n_places_pointer_only":12,"n_places_pointer_only_link_open":10,"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":0,"ran":0,"unverified":0},"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":"2308.03003","arxiv_id_is_arxiv":true,"paper":"/paper/cal-sfda-source-free-domain-adaptive-semantic","title":"Cal-SFDA: Source-Free Domain-adaptive Semantic Segmentation with Differentiable Expected Calibration Error","date":"2023-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jo-wang/cal-sfda","path":"model/DeeplabV2.py","file_url":"https://github.com/jo-wang/cal-sfda/blob/HEAD/model/DeeplabV2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"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/model_advent.py","file_url":"https://github.com/jxhuang0508/RDA/blob/HEAD/crst/deeplab/model_advent.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"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":"model/deeplabv2.py","file_url":"https://github.com/WilhelmT/ClassMix/blob/HEAD/model/deeplabv2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"2007.04269","arxiv_id_is_arxiv":true,"paper":"/paper/segfix-model-agnostic-boundary-refinement-for","title":"SegFix: Model-Agnostic Boundary Refinement for Segmentation","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PkuRainBow/OCNet","path":"utils/resnet_block.py","file_url":"https://github.com/PkuRainBow/OCNet/blob/HEAD/utils/resnet_block.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"2003.08440","arxiv_id_is_arxiv":true,"paper":"/paper/synthesize-then-compare-detecting-failures","title":"Synthesize then Compare: Detecting Failures and Anomalies for Semantic Segmentation","date":"2020-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YingdaXia/SynthCP","path":"models/deeplab.py","file_url":"https://github.com/YingdaXia/SynthCP/blob/HEAD/models/deeplab.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"1904.10620","arxiv_id_is_arxiv":true,"paper":"/paper/bidirectional-learning-for-domain-adaptation","title":"Bidirectional Learning for Domain Adaptation of Semantic Segmentation","date":"2019-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liyunsheng13/BDL","path":"model/deeplab.py","file_url":"https://github.com/liyunsheng13/BDL/blob/HEAD/model/deeplab.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"1903.02351","arxiv_id_is_arxiv":true,"paper":"/paper/canet-class-agnostic-segmentation-networks","title":"CANet: Class-Agnostic Segmentation Networks with Iterative Refinement and Attentive Few-Shot Learning","date":"2019-03-06","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":"well_formed","behaviour_fingerprint":true,"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":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"1811.11721","arxiv_id_is_arxiv":true,"paper":"/paper/ccnet-criss-cross-attention-for-semantic","title":"CCNet: Criss-Cross Attention for Semantic Segmentation","date":"2018-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"speedinghzl/CCNet","path":"networks/ccnet.py","file_url":"https://github.com/speedinghzl/CCNet/blob/HEAD/networks/ccnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"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":"model/CLAN_G.py","file_url":"https://github.com/RoyalVane/CLAN/blob/HEAD/model/CLAN_G.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"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":"stu92054/Domain-adaptation-on-segmentation","path":"Adapt_Structured_Output/model/deeplab_multi.py","file_url":"https://github.com/stu92054/Domain-adaptation-on-segmentation/blob/HEAD/Adapt_Structured_Output/model/deeplab_multi.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stu92054/Domain-adaptation-on-segmentation when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"1612.02646","arxiv_id_is_arxiv":true,"paper":"/paper/learning-video-object-segmentation-from","title":"Learning Video Object Segmentation from Static Images","date":"2016-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"birdman9390/MetaMaskTrack","path":"training/deeplab_resnet.py","file_url":"https://github.com/birdman9390/MetaMaskTrack/blob/HEAD/training/deeplab_resnet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}},{"arxiv_id":"136940019","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136940019 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ETHRuiGong/TADA","path":"model/deeplabv2.py","file_url":"https://github.com/ETHRuiGong/TADA/blob/HEAD/model/deeplabv2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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 stu92054/Domain-adaptation-on-segmentation, and GitHub detected no licence in that repository when it was checked","code_sha256":"27504cbeb5811ea6","code_sha256_prefix":"27504cbeb5811ea6","mcp_get_code":{"code_sha256":"27504cbeb5811ea6"}}],"record_sha256":"9b6305e738d5f45e2c2dea5b2412e0ccf7c257cc5ee4f9af3f3c4cfadeb2c4fa","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}