{"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/delete-extra-zero","entry":"delete_extra_zero","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":5,"n_papers_ran":1,"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":3,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"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":"2609.02264","paper":"/paper/arxiv-2609-02264","title":"Codebook Agent: Amortized Topology Design for LLM Multi-Agent Systems","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"jinxiy1104/CodebookAgent","path":"benchmarks/gsm8k_dataset.py","file_url":"https://github.com/jinxiy1104/CodebookAgent/blob/HEAD/benchmarks/gsm8k_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2602.23258","paper":"/paper/arxiv-2602-23258","title":"AgentDropoutV2: Optimizing Information Flow in Multi-Agent Systems via Test-Time Rectify-or-Reject Pruning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"TonySY2/AgentDropoutV2","path":"train/project_datasets/aqua_dataset.py","file_url":"https://github.com/TonySY2/AgentDropoutV2/blob/HEAD/train/project_datasets/aqua_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2502.18001","paper":"/paper/unveiling-the-key-factors-for-distilling","title":"Unveiling the Key Factors for Distilling Chain-of-Thought Reasoning","date":"2025-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eit-nlp/distilling-cot-reasoning","path":"Evaluation/reasoning_eval/utils.py","file_url":"https://github.com/eit-nlp/distilling-cot-reasoning/blob/HEAD/Evaluation/reasoning_eval/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1d6b1921b6a73ff1","mcp_get_code":{"code_sha256":"1d6b1921b6a73ff1"}},{"arxiv_id":"2502.11133","paper":"/paper/masrouter-learning-to-route-llms-for-multi","title":"MasRouter: Learning to Route LLMs for Multi-Agent Systems","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanweiyue/masrouter","path":"Datasets/gsm8k_dataset.py","file_url":"https://github.com/yanweiyue/masrouter/blob/HEAD/Datasets/gsm8k_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2309.12284","paper":"/paper/metamath-bootstrap-your-own-mathematical","title":"MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Models","date":"2023-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"meta-math/MetaMath","path":"code_for_generating_data/code/main_backward_reasoning.py","file_url":"https://github.com/meta-math/MetaMath/blob/HEAD/code_for_generating_data/code/main_backward_reasoning.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b5bd259672545188","mcp_get_code":{"code_sha256":"b5bd259672545188"}}]}