{"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/do-python-eval","entry":"do_python_eval","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"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":3,"ran_fixture":0,"ran":3,"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":"2309.02773","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-model-is-secretly-a-training-free","title":"Diffusion Model is Secretly a Training-free Open Vocabulary Semantic Segmenter","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VCG-team/DiffSegmenter","path":"open_vocabulary/voc10/evaluation_voc10.py","file_url":"https://github.com/VCG-team/DiffSegmenter/blob/HEAD/open_vocabulary/voc10/evaluation_voc10.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, VCG-team/DiffSegmenter when it was checked","code_sha256":"e0d5450ecae92082","code_sha256_prefix":"e0d5450ecae92082","mcp_get_code":{"code_sha256":"e0d5450ecae92082"}},{"arxiv_id":"2108.12995","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-mask-matters-inweakly-supervised","title":"Pseudo-mask Matters in Weakly-supervised Semantic Segmentation","date":"2021-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Eli-YiLi/PMM","path":"pipeline/evaluation.py","file_url":"https://github.com/Eli-YiLi/PMM/blob/HEAD/pipeline/evaluation.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":"d274d062070f377d","code_sha256_prefix":"d274d062070f377d","mcp_get_code":{"code_sha256":"d274d062070f377d"}},{"arxiv_id":"2108.03852","arxiv_id_is_arxiv":true,"paper":"/paper/complementary-patch-for-weakly-supervised","title":"Complementary Patch for Weakly Supervised Semantic Segmentation","date":"2021-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ferenas/CPN","path":"evaluation_cam.py","file_url":"https://github.com/Ferenas/CPN/blob/HEAD/evaluation_cam.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4de99c8ad78aceee","code_sha256_prefix":"4de99c8ad78aceee","mcp_get_code":{"code_sha256":"4de99c8ad78aceee"}},{"arxiv_id":"2104.07216","arxiv_id_is_arxiv":true,"paper":"/paper/learning-structure-aware-semantic","title":"Learning structure-aware semantic segmentation with image-level supervision","date":"2021-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Carlisle-Liu/SBNet","path":"evaluation.py","file_url":"https://github.com/Carlisle-Liu/SBNet/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b28fece612fce78e","code_sha256_prefix":"b28fece612fce78e","mcp_get_code":{"code_sha256":"b28fece612fce78e"}},{"arxiv_id":"2004.04581","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-equivariant-attention","title":"Self-supervised Equivariant Attention Mechanism for Weakly Supervised Semantic Segmentation","date":"2020-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YudeWang/SEAM","path":"evaluation.py","file_url":"https://github.com/YudeWang/SEAM/blob/HEAD/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4de99c8ad78aceee","code_sha256_prefix":"4de99c8ad78aceee","mcp_get_code":{"code_sha256":"4de99c8ad78aceee"}},{"arxiv_id":"136890323","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136890323 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KAIST-vilab/AEFT","path":"evaluation.py","file_url":"https://github.com/KAIST-vilab/AEFT/blob/HEAD/evaluation.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":"43662c88022ace68","code_sha256_prefix":"43662c88022ace68","mcp_get_code":{"code_sha256":"43662c88022ace68"}},{"arxiv_id":"136890323","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136890323 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"KAIST-vilab/AEFT","path":"evaluation_aff.py","file_url":"https://github.com/KAIST-vilab/AEFT/blob/HEAD/evaluation_aff.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":"05f05a0d310018fe","code_sha256_prefix":"05f05a0d310018fe","mcp_get_code":{"code_sha256":"05f05a0d310018fe"}}],"record_sha256":"feffd02e978fed280f28ff51b8490b99e7d26ea6572d632b7f44eea3d1e72535","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}