{"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/delete-extra-zero","entry":"delete_extra_zero","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":1,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":5,"n_places_pointer_only":3,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"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":"2609.02264","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, jinxiy1104/CodebookAgent when it was checked","code_sha256":"1311b1da2c08b63b","code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2602.23258","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, TonySY2/AgentDropoutV2 when it was checked","code_sha256":"1311b1da2c08b63b","code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2502.18001","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d6b1921b6a73ff1","code_sha256_prefix":"1d6b1921b6a73ff1","mcp_get_code":{"code_sha256":"1d6b1921b6a73ff1"}},{"arxiv_id":"2502.11133","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from TonySY2/AgentDropoutV2, and GitHub detected no licence in that repository when it was checked","code_sha256":"1311b1da2c08b63b","code_sha256_prefix":"1311b1da2c08b63b","mcp_get_code":{"code_sha256":"1311b1da2c08b63b"}},{"arxiv_id":"2309.12284","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5bd259672545188","code_sha256_prefix":"b5bd259672545188","mcp_get_code":{"code_sha256":"b5bd259672545188"}}],"record_sha256":"35b00cc40a694d66ad6b6bbe7d0f14ae708efb4fbf0316b702f3ee8c9f66250c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}