{"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/deeplabv3-resnet50","entry":"deeplabv3_resnet50","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":0,"n_papers_ran_no_instrument_failure":0,"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":7,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"ran":0,"unverified":7},"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":"2402.15152","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-duality-between-sharpness-aware","title":"On the Duality Between Sharpness-Aware Minimization and Adversarial Training","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weizeming/SAM_AT","path":"SAM_segmentation/network/modeling.py","file_url":"https://github.com/weizeming/SAM_AT/blob/HEAD/SAM_segmentation/network/modeling.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, weizeming/SAM_AT when it was checked","code_sha256":"0264c7923a17f00c","code_sha256_prefix":"0264c7923a17f00c","mcp_get_code":{"code_sha256":"0264c7923a17f00c"}},{"arxiv_id":"2310.06368","arxiv_id_is_arxiv":true,"paper":"/paper/coinseg-contrast-inter-and-intra-class-1","title":"CoinSeg: Contrast Inter- and Intra- Class Representations for Incremental Segmentation","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zkzhang98/coinseg","path":"network/modeling.py","file_url":"https://github.com/zkzhang98/coinseg/blob/HEAD/network/modeling.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, zkzhang98/coinseg when it was checked","code_sha256":"794a19642d0025e1","code_sha256_prefix":"794a19642d0025e1","mcp_get_code":{"code_sha256":"794a19642d0025e1"}},{"arxiv_id":"2108.04562","arxiv_id_is_arxiv":true,"paper":"/paper/deep-metric-learning-for-open-world-semantic","title":"Deep Metric Learning for Open World Semantic Segmentation","date":"2021-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jun-CEN/Open-World-Semantic-Segmentation","path":"DeepLabV3Plus-Pytorch/network/modeling.py","file_url":"https://github.com/Jun-CEN/Open-World-Semantic-Segmentation/blob/HEAD/DeepLabV3Plus-Pytorch/network/modeling.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":"4de0af0762139e5b","code_sha256_prefix":"4de0af0762139e5b","mcp_get_code":{"code_sha256":"4de0af0762139e5b"}},{"arxiv_id":"2106.04463","arxiv_id_is_arxiv":true,"paper":"/paper/polypgen-a-multi-center-polyp-detection-and","title":"A multi-centre polyp detection and segmentation dataset for generalisability assessment","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharib-vision/PolypGen-Benchmark","path":"network/modeling.py","file_url":"https://github.com/sharib-vision/PolypGen-Benchmark/blob/HEAD/network/modeling.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":"85f770a1a3693de2","code_sha256_prefix":"85f770a1a3693de2","mcp_get_code":{"code_sha256":"85f770a1a3693de2"}},{"arxiv_id":"1905.03561","arxiv_id_is_arxiv":true,"paper":"/paper/190503561","title":"D2-Net: A Trainable CNN for Joint Detection and Description of Local Features","date":"2019-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/cad","path":"segmentation/network/modeling.py","file_url":"https://github.com/visinf/cad/blob/HEAD/segmentation/network/modeling.py","status":"unverified","verification_level":0,"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":"451fc815fe699edb","code_sha256_prefix":"451fc815fe699edb","mcp_get_code":{"code_sha256":"451fc815fe699edb"}},{"arxiv_id":"1905.03561","arxiv_id_is_arxiv":true,"paper":"/paper/190503561","title":"D2-Net: A Trainable CNN for Joint Detection and Description of Local Features","date":"2019-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/cad","path":"segmentation/network/modeling_e2e.py","file_url":"https://github.com/visinf/cad/blob/HEAD/segmentation/network/modeling_e2e.py","status":"unverified","verification_level":0,"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":"909a6da223d37612","code_sha256_prefix":"909a6da223d37612","mcp_get_code":{"code_sha256":"909a6da223d37612"}},{"arxiv_id":"1706.05587","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-atrous-convolution-for-semantic","title":"Rethinking Atrous Convolution for Semantic Image Segmentation","date":"2017-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VainF/DeepLabV3Plus-Pytorch","path":"network/modeling.py","file_url":"https://github.com/VainF/DeepLabV3Plus-Pytorch/blob/HEAD/network/modeling.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":"0264c7923a17f00c","code_sha256_prefix":"0264c7923a17f00c","mcp_get_code":{"code_sha256":"0264c7923a17f00c"}},{"arxiv_id":"Jain_Scaling_Semantic_Segmentation_Beyond_1K_Classes_on_a_Single_GPU_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Jain_Scaling_Semantic_Segmentation_Beyond_1K_Classes_on_a_Single_GPU_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"shipra25jain/ESSNet","path":"network/modeling.py","file_url":"https://github.com/shipra25jain/ESSNet/blob/HEAD/network/modeling.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":"ab0a73f75fc2c3dd","code_sha256_prefix":"ab0a73f75fc2c3dd","mcp_get_code":{"code_sha256":"ab0a73f75fc2c3dd"}}],"record_sha256":"1eb1cdce9528a54b6bcd92dd128bef226990aab7bdd3c4afb4ab632059374289","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}