{"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/get-palette","entry":"get_palette","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":14,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2606.16710","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-16710","title":"Misinformation Propagation in Benign Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jonas-becker/MINT","path":"figure_style.py","file_url":"https://github.com/jonas-becker/MINT/blob/HEAD/figure_style.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, jonas-becker/MINT when it was checked","code_sha256":"2a152bb3b2a07682","code_sha256_prefix":"2a152bb3b2a07682","mcp_get_code":{"code_sha256":"2a152bb3b2a07682"}},{"arxiv_id":"2512.00306","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-00306","title":"VCWorld: A Biological World Model for Virtual Cell Simulation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"theislab/cpa","path":"cpa/_plotting.py","file_url":"https://github.com/theislab/cpa/blob/HEAD/cpa/_plotting.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7c73c81f20db72ff","code_sha256_prefix":"7c73c81f20db72ff","mcp_get_code":{"code_sha256":"7c73c81f20db72ff"}},{"arxiv_id":"2401.02138","arxiv_id_is_arxiv":true,"paper":"/paper/explore-human-parsing-modality-for-action-1","title":"Explore Human Parsing Modality for Action Recognition","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liujf69/EPP-Net-Action","path":"Parsing/Parsing_extractor.py","file_url":"https://github.com/liujf69/EPP-Net-Action/blob/HEAD/Parsing/Parsing_extractor.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, liujf69/EPP-Net-Action when it was checked","code_sha256":"2710e69d80cc7844","code_sha256_prefix":"2710e69d80cc7844","mcp_get_code":{"code_sha256":"2710e69d80cc7844"}},{"arxiv_id":"2007.10538","arxiv_id_is_arxiv":true,"paper":"/paper/regularizing-deep-networks-with-semantic-data","title":"Regularizing Deep Networks with Semantic Data Augmentation","date":"2020-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"speedinghzl/pytorch-segmentation-toolbox","path":"evaluate.py","file_url":"https://github.com/speedinghzl/pytorch-segmentation-toolbox/blob/HEAD/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"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":"generate_submit.py","file_url":"https://github.com/PkuRainBow/OCNet/blob/HEAD/generate_submit.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"2003.00872","arxiv_id_is_arxiv":true,"paper":"/paper/alignseg-feature-aligned-segmentation","title":"AlignSeg: Feature-Aligned Segmentation Networks","date":"2020-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"speedinghzl/AlignSeg","path":"evaluate.py","file_url":"https://github.com/speedinghzl/AlignSeg/blob/HEAD/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"1911.01370","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-difference-detection-for-1","title":"Self-Supervised Difference Detection for Weakly-Supervised Semantic Segmentation","date":"2019-11-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shimoda-uec/ssdd","path":"utils.py","file_url":"https://github.com/shimoda-uec/ssdd/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"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 liujf69/EPP-Net-Action, and GitHub detected no licence in that repository when it was checked","code_sha256":"2710e69d80cc7844","code_sha256_prefix":"2710e69d80cc7844","mcp_get_code":{"code_sha256":"2710e69d80cc7844"}},{"arxiv_id":"1910.09777","arxiv_id_is_arxiv":true,"paper":"/paper/self-correction-for-human-parsing","title":"Self-Correction for Human Parsing","date":"2019-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PeikeLi/Self-Correction-Human-Parsing","path":"mhp_extension/global_local_parsing/global_local_evaluate.py","file_url":"https://github.com/PeikeLi/Self-Correction-Human-Parsing/blob/HEAD/mhp_extension/global_local_parsing/global_local_evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"1903.04197","arxiv_id_is_arxiv":true,"paper":"/paper/structured-knowledge-distillation-for","title":"Structured Knowledge Distillation for Dense Prediction","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"irfanICMLL/structure_knowledge_distillation","path":"networks/evaluate.py","file_url":"https://github.com/irfanICMLL/structure_knowledge_distillation/blob/HEAD/networks/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"1812.08008","arxiv_id_is_arxiv":true,"paper":"/paper/openpose-realtime-multi-person-2d-pose","title":"OpenPose: Realtime Multi-Person 2D Pose Estimation using Part Affinity Fields","date":"2018-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zero-nnkn/ml-utils","path":"general/plots.py","file_url":"https://github.com/Zero-nnkn/ml-utils/blob/HEAD/general/plots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9005559e9e55a8a","code_sha256_prefix":"f9005559e9e55a8a","mcp_get_code":{"code_sha256":"f9005559e9e55a8a"}},{"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":"evaluate.py","file_url":"https://github.com/speedinghzl/CCNet/blob/HEAD/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"1811.10870","arxiv_id_is_arxiv":true,"paper":"/paper/affinity-derivation-and-graph-merge-for","title":"Affinity Derivation and Graph Merge for Instance Segmentation","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xck36/GMIS","path":"utilities/show_mask.py","file_url":"https://github.com/xck36/GMIS/blob/HEAD/utilities/show_mask.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"647bda8128f47905","code_sha256_prefix":"647bda8128f47905","mcp_get_code":{"code_sha256":"647bda8128f47905"}},{"arxiv_id":"1703.07511","arxiv_id_is_arxiv":true,"paper":"/paper/deep-photo-style-transfer","title":"Deep Photo Style Transfer","date":"2017-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"7-B/yoco","path":"segmentation/evaluate.py","file_url":"https://github.com/7-B/yoco/blob/HEAD/segmentation/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"26664d79586aad5a","code_sha256_prefix":"26664d79586aad5a","mcp_get_code":{"code_sha256":"26664d79586aad5a"}},{"arxiv_id":"1502.03240","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-random-fields-as-recurrent-neural-1","title":"Conditional Random Fields as Recurrent Neural Networks","date":"2015-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"torrvision/crfasrnn","path":"python-scripts/crfasrnn_demo.py","file_url":"https://github.com/torrvision/crfasrnn/blob/HEAD/python-scripts/crfasrnn_demo.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, torrvision/crfasrnn (NOASSERTION)","code_sha256":"fc71619ee0d554fe","code_sha256_prefix":"fc71619ee0d554fe","mcp_get_code":{"code_sha256":"fc71619ee0d554fe"}}],"record_sha256":"e107da62aa69d15c8c738c7e77dd3980f15fd8b28925436e9052924fb42eac45","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}