{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/check-folder","entry":"check_folder","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":6,"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":4,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":0,"unverified":2},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f4007627e1cb8260","mcp_get_code":{"code_sha256":"f4007627e1cb8260"}},{"arxiv_id":"2301.11911","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,"code_sha256_prefix":"d47cbf11f1e737d3","mcp_get_code":{"code_sha256":"d47cbf11f1e737d3"}},{"arxiv_id":"2209.08162","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,"code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}},{"arxiv_id":"2207.08560","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,"code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}},{"arxiv_id":"2207.08560","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bb13aeaaa25993e8","mcp_get_code":{"code_sha256":"bb13aeaaa25993e8"}},{"arxiv_id":"2105.05233","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,"code_sha256_prefix":"e21cebaf03604f02","mcp_get_code":{"code_sha256":"e21cebaf03604f02"}},{"arxiv_id":"2011.10077","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,"code_sha256_prefix":"6271c68f3e859a21","mcp_get_code":{"code_sha256":"6271c68f3e859a21"}},{"arxiv_id":"2008.07519","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,"code_sha256_prefix":"ff071f205ab48479","mcp_get_code":{"code_sha256":"ff071f205ab48479"}}]}