{"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/check-folder","entry":"check_folder","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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":2,"n_samples_instrument":4,"n_samples_unverified":0,"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":4,"ran_fixture":0,"ran":2,"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":"2503.15234","arxiv_id_is_arxiv":true,"paper":"/paper/coe-chain-of-explanation-via-automatic-visual","title":"CoE: Chain-of-Explanation via Automatic Visual Concept Circuit Description and Polysemanticity Quantification","date":"2025-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuWLong666/CoE","path":"polysemantic_eval.py","file_url":"https://github.com/YuWLong666/CoE/blob/HEAD/polysemantic_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4007627e1cb8260","code_sha256_prefix":"f4007627e1cb8260","mcp_get_code":{"code_sha256":"f4007627e1cb8260"}},{"arxiv_id":"2301.11911","arxiv_id_is_arxiv":true,"paper":"/paper/multi-dimensional-concept-discovery-mcd-a","title":"Multi-dimensional concept discovery (MCD): A unifying framework with completeness guarantees","date":"2023-01-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grobruegge/hu-mcd","path":"run_humcd.py","file_url":"https://github.com/grobruegge/hu-mcd/blob/HEAD/run_humcd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d47cbf11f1e737d3","code_sha256_prefix":"d47cbf11f1e737d3","mcp_get_code":{"code_sha256":"d47cbf11f1e737d3"}},{"arxiv_id":"2209.08162","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-quantification-of-collaborative","title":"Uncertainty Quantification of Collaborative Detection for Self-Driving","date":"2022-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coperception/double-m-quantification","path":"tools/det/train_mbb.py","file_url":"https://github.com/coperception/double-m-quantification/blob/HEAD/tools/det/train_mbb.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":"ff071f205ab48479","code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}},{"arxiv_id":"2207.08560","arxiv_id_is_arxiv":true,"paper":"/paper/latency-aware-collaborative-perception","title":"Latency-Aware Collaborative Perception","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/syncnet","path":"LA-det/train_LAcodet.py","file_url":"https://github.com/mediabrain-sjtu/syncnet/blob/HEAD/LA-det/train_LAcodet.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":"ff071f205ab48479","code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}},{"arxiv_id":"2207.08560","arxiv_id_is_arxiv":true,"paper":"/paper/latency-aware-collaborative-perception","title":"Latency-Aware Collaborative Perception","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/syncnet","path":"LA-det/create_data_LAdet.py","file_url":"https://github.com/mediabrain-sjtu/syncnet/blob/HEAD/LA-det/create_data_LAdet.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":"bb13aeaaa25993e8","code_sha256_prefix":"bb13aeaaa25993e8","mcp_get_code":{"code_sha256":"bb13aeaaa25993e8"}},{"arxiv_id":"2105.05233","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-beat-gans-on-image-synthesis","title":"Diffusion Models Beat GANs on Image Synthesis","date":"2021-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sangyun884/fast-ode","path":"guided_diffusion/gaussian_diffusion.py","file_url":"https://github.com/sangyun884/fast-ode/blob/HEAD/guided_diffusion/gaussian_diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sangyun884/fast-ode when it was checked","code_sha256":"e21cebaf03604f02","code_sha256_prefix":"e21cebaf03604f02","mcp_get_code":{"code_sha256":"e21cebaf03604f02"}},{"arxiv_id":"2011.10077","arxiv_id_is_arxiv":true,"paper":"/paper/error-bounded-correction-of-noisy-labels-1","title":"Error-Bounded Correction of Noisy Labels","date":"2020-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pingqingsheng/LRT","path":"LRTcorrect.py","file_url":"https://github.com/pingqingsheng/LRT/blob/HEAD/LRTcorrect.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, pingqingsheng/LRT when it was checked","code_sha256":"6271c68f3e859a21","code_sha256_prefix":"6271c68f3e859a21","mcp_get_code":{"code_sha256":"6271c68f3e859a21"}},{"arxiv_id":"2008.07519","arxiv_id_is_arxiv":true,"paper":"/paper/v2vnet-vehicle-to-vehicle-communication-for","title":"V2VNet: Vehicle-to-Vehicle Communication for Joint Perception and Prediction","date":"2020-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"ff071f205ab48479","code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}}],"record_sha256":"1877a6fd06c96eabd534fee879a67bd5a025f80067997ccc0dd05d433d87284f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}