{"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/deeplab","entry":"Deeplab","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":7,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":8,"n_samples_ran":3,"n_samples_constructed":1,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":5},"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":"2203.09744","arxiv_id_is_arxiv":true,"paper":"/paper/class-balanced-pixel-level-self-labeling-for","title":"Class-Balanced Pixel-Level Self-Labeling for Domain Adaptive Semantic Segmentation","date":"2022-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lslrh/CPSL","path":"models/adaptation_modelv2.py","file_url":"https://github.com/lslrh/CPSL/blob/HEAD/models/adaptation_modelv2.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, lslrh/CPSL when it was checked","code_sha256":"8019ed0049de59b9","code_sha256_prefix":"8019ed0049de59b9","mcp_get_code":{"code_sha256":"8019ed0049de59b9"}},{"arxiv_id":"2108.06337","arxiv_id_is_arxiv":true,"paper":"/paper/dual-path-learning-for-domain-adaptation-of","title":"Dual Path Learning for Domain Adaptation of Semantic Segmentation","date":"2021-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royee182/DPL","path":"DPL_master/model/deeplab.py","file_url":"https://github.com/royee182/DPL/blob/HEAD/DPL_master/model/deeplab.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, royee182/DPL when it was checked","code_sha256":"600ea9e08f59905a","code_sha256_prefix":"600ea9e08f59905a","mcp_get_code":{"code_sha256":"600ea9e08f59905a"}},{"arxiv_id":"2104.10834","arxiv_id_is_arxiv":true,"paper":"/paper/dannet-a-one-stage-domain-adaptation-network","title":"DANNet: A One-Stage Domain Adaptation Network for Unsupervised Nighttime Semantic Segmentation","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"W-zx-Y/DANNet","path":"network/deeplab.py","file_url":"https://github.com/W-zx-Y/DANNet/blob/HEAD/network/deeplab.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9dc8f14dfd69cd8c","code_sha256_prefix":"9dc8f14dfd69cd8c","mcp_get_code":{"code_sha256":"9dc8f14dfd69cd8c"}},{"arxiv_id":"2101.10979","arxiv_id_is_arxiv":true,"paper":"/paper/prototypical-pseudo-label-denoising-and","title":"Prototypical Pseudo Label Denoising and Target Structure Learning for Domain Adaptive Semantic Segmentation","date":"2021-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/ProDA","path":"models/adaptation_modelv2.py","file_url":"https://github.com/microsoft/ProDA/blob/HEAD/models/adaptation_modelv2.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":"5b7b14dc1a126e30","code_sha256_prefix":"5b7b14dc1a126e30","mcp_get_code":{"code_sha256":"5b7b14dc1a126e30"}},{"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":"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":"0d2051ae0eca8e7f","code_sha256_prefix":"0d2051ae0eca8e7f","mcp_get_code":{"code_sha256":"0d2051ae0eca8e7f"}},{"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":"cyclegan/deeplab.py","file_url":"https://github.com/liyunsheng13/BDL/blob/HEAD/cyclegan/deeplab.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":"ce5003e390b20787","code_sha256_prefix":"ce5003e390b20787","mcp_get_code":{"code_sha256":"ce5003e390b20787"}},{"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":"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":"bfb91dad724d81b9","code_sha256_prefix":"bfb91dad724d81b9","mcp_get_code":{"code_sha256":"bfb91dad724d81b9"}},{"arxiv_id":"1802.02611","arxiv_id_is_arxiv":true,"paper":"/paper/encoder-decoder-with-atrous-separable","title":"Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation","date":"2018-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petko-nikolov/pysemseg","path":"pysemseg/models/deeplab.py","file_url":"https://github.com/petko-nikolov/pysemseg/blob/HEAD/pysemseg/models/deeplab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, petko-nikolov/pysemseg, is not in the permissive set Syntology serves inline","code_sha256":"c10a37b7673d30e0","code_sha256_prefix":"c10a37b7673d30e0","mcp_get_code":{"code_sha256":"c10a37b7673d30e0"}}],"record_sha256":"9df69b306260d9ab65c83820a173e7d3c6b14f161697383fdeae2e5bac356f82","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}