{"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/extract-boxed-answer","entry":"extract_boxed_answer","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":21,"n_papers_ran":21,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":18,"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":18,"n_samples_ran":18,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":15,"n_samples_unverified":0,"n_samples_fingerprinted":18,"n_places":27,"n_places_pointer_only":18,"n_places_pointer_only_link_open":5,"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":15,"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":"2608.27448","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27448","title":"TTPO: Test-Time Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ZJU-REAL/TTPO","path":"TTPO/grpo_train.py","file_url":"https://github.com/ZJU-REAL/TTPO/blob/HEAD/TTPO/grpo_train.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, ZJU-REAL/TTPO when it was checked","code_sha256":"728111e00c43689f","code_sha256_prefix":"728111e00c43689f","mcp_get_code":{"code_sha256":"728111e00c43689f"}},{"arxiv_id":"2608.27448","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27448","title":"TTPO: Test-Time Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ZJU-REAL/TTPO","path":"TTPO/ttpo_voting.py","file_url":"https://github.com/ZJU-REAL/TTPO/blob/HEAD/TTPO/ttpo_voting.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, ZJU-REAL/TTPO when it was checked","code_sha256":"52eae8df46a34940","code_sha256_prefix":"52eae8df46a34940","mcp_get_code":{"code_sha256":"52eae8df46a34940"}},{"arxiv_id":"2608.27448","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27448","title":"TTPO: Test-Time Policy Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ZJU-REAL/TTPO","path":"TTPO/eval/evaluate_math.py","file_url":"https://github.com/ZJU-REAL/TTPO/blob/HEAD/TTPO/eval/evaluate_math.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, ZJU-REAL/TTPO when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2608.09228","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-09228","title":"Privileged Solutions or Context-Induced Teacher Behavior? Dissecting On-Policy Self-Distillation","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"MBZUAI-reasoninglab/OP2SD","path":"eval/evaluate_math.py","file_url":"https://github.com/MBZUAI-reasoninglab/OP2SD/blob/HEAD/eval/evaluate_math.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, MBZUAI-reasoninglab/OP2SD when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2608.03467","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-03467","title":"When Correct Solutions Repeat: Rarity-Aware Credit Redistribution for GRPO","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"CzZ12/When-Correct-Solutions-Repeat-Rarity-Aware-Credit-Redistribution-for-GRPO","path":"domain_config.py","file_url":"https://github.com/CzZ12/When-Correct-Solutions-Repeat-Rarity-Aware-Credit-Redistribution-for-GRPO/blob/HEAD/domain_config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f249e8be89b9526c","code_sha256_prefix":"f249e8be89b9526c","mcp_get_code":{"code_sha256":"f249e8be89b9526c"}},{"arxiv_id":"2607.26627","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26627","title":"Revisiting Lossy Verification in Speculative Decoding: Mechanisms, Trade-offs, and Failure Modes","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"ZhouYuxuanYX/Fast-HSD","path":"fast_hsd/benchmarks/_math_scoring.py","file_url":"https://github.com/ZhouYuxuanYX/Fast-HSD/blob/HEAD/fast_hsd/benchmarks/_math_scoring.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cd23a3bbdde761c5","code_sha256_prefix":"cd23a3bbdde761c5","mcp_get_code":{"code_sha256":"cd23a3bbdde761c5"}},{"arxiv_id":"2607.14552","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14552","title":"Answer-Conditioned Chains of Thought Degrade Verifiable-Reasoning Distillation in Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"js-lee-AI/answer-leakage","path":"answer_leakage/matching.py","file_url":"https://github.com/js-lee-AI/answer-leakage/blob/HEAD/answer_leakage/matching.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"793c211f50002bc3","code_sha256_prefix":"793c211f50002bc3","mcp_get_code":{"code_sha256":"793c211f50002bc3"}},{"arxiv_id":"2606.23104","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23104","title":"ReNIO: Reweighting Negative Trajectory Importance for LLM On-Policy Distillation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BDML-lab/ReNIO","path":"grpo_train.py","file_url":"https://github.com/BDML-lab/ReNIO/blob/HEAD/grpo_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ZJU-REAL/TTPO, and GitHub detected no licence in that repository when it was checked","code_sha256":"728111e00c43689f","code_sha256_prefix":"728111e00c43689f","mcp_get_code":{"code_sha256":"728111e00c43689f"}},{"arxiv_id":"2606.23104","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-23104","title":"ReNIO: Reweighting Negative Trajectory Importance for LLM On-Policy Distillation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BDML-lab/ReNIO","path":"eval/evaluate_math.py","file_url":"https://github.com/BDML-lab/ReNIO/blob/HEAD/eval/evaluate_math.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ZJU-REAL/TTPO, and GitHub detected no licence in that repository when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2605.21606","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21606","title":"When Are Teacher Tokens Reliable? Position-Weighted On-Policy Self-Distillation for Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"SaFo-Lab/PW-OPSD","path":"eval/evaluate_math.py","file_url":"https://github.com/SaFo-Lab/PW-OPSD/blob/HEAD/eval/evaluate_math.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ZJU-REAL/TTPO, and GitHub detected no licence in that repository when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2605.17672","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17672","title":"Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"giovanni-vaccarino/PUMA","path":"puma/extract_final_candidates.py","file_url":"https://github.com/giovanni-vaccarino/PUMA/blob/HEAD/puma/extract_final_candidates.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, giovanni-vaccarino/PUMA when it was checked","code_sha256":"d534cfac750249cf","code_sha256_prefix":"d534cfac750249cf","mcp_get_code":{"code_sha256":"d534cfac750249cf"}},{"arxiv_id":"2605.09548","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09548","title":"Crosslingual On-Policy Self-Distillation for Multilingual Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"cisnlp/COPSD","path":"multilingual_grpo_train.py","file_url":"https://github.com/cisnlp/COPSD/blob/HEAD/multilingual_grpo_train.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, cisnlp/COPSD when it was checked","code_sha256":"90054f5de2b3ede3","code_sha256_prefix":"90054f5de2b3ede3","mcp_get_code":{"code_sha256":"90054f5de2b3ede3"}},{"arxiv_id":"2605.09548","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09548","title":"Crosslingual On-Policy Self-Distillation for Multilingual Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"cisnlp/COPSD","path":"african_langs_eval/evaluate_math.py","file_url":"https://github.com/cisnlp/COPSD/blob/HEAD/african_langs_eval/evaluate_math.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, cisnlp/COPSD when it was checked","code_sha256":"48da3f1fbb868b57","code_sha256_prefix":"48da3f1fbb868b57","mcp_get_code":{"code_sha256":"48da3f1fbb868b57"}},{"arxiv_id":"2605.05040","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05040","title":"Preference-Based Self-Distillation: Beyond KL Matching via Reward Regularization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LucasXinYu/PBSD","path":"eval/evaluate_math.py","file_url":"https://github.com/LucasXinYu/PBSD/blob/HEAD/eval/evaluate_math.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ZJU-REAL/TTPO, and GitHub detected no licence in that repository when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2605.05040","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05040","title":"Preference-Based Self-Distillation: Beyond KL Matching via Reward Regularization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"LucasXinYu/PBSD","path":"verify_utils.py","file_url":"https://github.com/LucasXinYu/PBSD/blob/HEAD/verify_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d1e73ab2175498fb","code_sha256_prefix":"d1e73ab2175498fb","mcp_get_code":{"code_sha256":"d1e73ab2175498fb"}},{"arxiv_id":"2604.04356","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04356","title":"REAM: Merging Improves Pruning of Experts in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zai-org/glm-simple-evals","path":"evals/math_eval.py","file_url":"https://github.com/zai-org/glm-simple-evals/blob/HEAD/evals/math_eval.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, zai-org/glm-simple-evals when it was checked","code_sha256":"09b470ed75dcda56","code_sha256_prefix":"09b470ed75dcda56","mcp_get_code":{"code_sha256":"09b470ed75dcda56"}},{"arxiv_id":"2603.10624","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-10624","title":"Reinforcement Learning with Conditional Expectation Reward","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"changyi7231/CER","path":"recipe/cer/src/data_preparation.py","file_url":"https://github.com/changyi7231/CER/blob/HEAD/recipe/cer/src/data_preparation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"904946a1f147981f","code_sha256_prefix":"904946a1f147981f","mcp_get_code":{"code_sha256":"904946a1f147981f"}},{"arxiv_id":"2602.19672","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-19672","title":"SkillOrchestra: Learning to Route Agents via Skill Transfer","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jiayuww/SkillOrchestra","path":"skillorchestra/eval/metrics.py","file_url":"https://github.com/jiayuww/SkillOrchestra/blob/HEAD/skillorchestra/eval/metrics.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4e5e88005347906a","code_sha256_prefix":"4e5e88005347906a","mcp_get_code":{"code_sha256":"4e5e88005347906a"}},{"arxiv_id":"2601.18734","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18734","title":"Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"siyan-zhao/OPSD","path":"grpo_train.py","file_url":"https://github.com/siyan-zhao/OPSD/blob/HEAD/grpo_train.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, siyan-zhao/OPSD when it was checked","code_sha256":"728111e00c43689f","code_sha256_prefix":"728111e00c43689f","mcp_get_code":{"code_sha256":"728111e00c43689f"}},{"arxiv_id":"2601.18734","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18734","title":"Self-Distilled Reasoner: On-Policy Self-Distillation for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"siyan-zhao/OPSD","path":"eval/evaluate_math.py","file_url":"https://github.com/siyan-zhao/OPSD/blob/HEAD/eval/evaluate_math.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, siyan-zhao/OPSD when it was checked","code_sha256":"b1030fc6426aa14c","code_sha256_prefix":"b1030fc6426aa14c","mcp_get_code":{"code_sha256":"b1030fc6426aa14c"}},{"arxiv_id":"2601.06022","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-06022","title":"AdaFuse: Adaptive Ensemble Decoding with Test-Time Scaling for LLMs","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"CCM0111/AdaFuse","path":"AdaFuse_two_models.py","file_url":"https://github.com/CCM0111/AdaFuse/blob/HEAD/AdaFuse_two_models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CCM0111/AdaFuse when it was checked","code_sha256":"40e202a1ceb43583","code_sha256_prefix":"40e202a1ceb43583","mcp_get_code":{"code_sha256":"40e202a1ceb43583"}},{"arxiv_id":"2505.10518","arxiv_id_is_arxiv":true,"paper":"/paper/multi-token-prediction-needs-registers","title":"Multi-Token Prediction Needs Registers","date":"2025-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nasosger/mutor","path":"language_modeling/src/eval/evaluate_gsm8k.py","file_url":"https://github.com/nasosger/mutor/blob/HEAD/language_modeling/src/eval/evaluate_gsm8k.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c971191751f6f79","code_sha256_prefix":"1c971191751f6f79","mcp_get_code":{"code_sha256":"1c971191751f6f79"}},{"arxiv_id":"2503.06580","arxiv_id_is_arxiv":true,"paper":"/paper/agent-models-internalizing-chain-of-action","title":"Agent models: Internalizing Chain-of-Action Generation into Reasoning models","date":"2025-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adam-bjtu/autocoa","path":"evaluation/eval_retrieval.py","file_url":"https://github.com/adam-bjtu/autocoa/blob/HEAD/evaluation/eval_retrieval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d99fd0ee8832cb2","code_sha256_prefix":"6d99fd0ee8832cb2","mcp_get_code":{"code_sha256":"6d99fd0ee8832cb2"}},{"arxiv_id":"2502.12215","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-the-test-time-scaling-of-o1-like","title":"Revisiting the Test-Time Scaling of o1-like Models: Do they Truly Possess Test-Time Scaling Capabilities?","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhiYuanZeng/test-time-scaling-eval","path":"math_evaluator.py","file_url":"https://github.com/ZhiYuanZeng/test-time-scaling-eval/blob/HEAD/math_evaluator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 trotsky1997/mathblackbox, and GitHub detected no licence in that repository when it was checked","code_sha256":"841780ad150562ae","code_sha256_prefix":"841780ad150562ae","mcp_get_code":{"code_sha256":"841780ad150562ae"}},{"arxiv_id":"2410.02884","arxiv_id_is_arxiv":true,"paper":"/paper/llama-berry-pairwise-optimization-for-o1-like","title":"LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning","date":"2024-10-03","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":true,"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":"841780ad150562ae","code_sha256_prefix":"841780ad150562ae","mcp_get_code":{"code_sha256":"841780ad150562ae"}},{"arxiv_id":"2406.07394","arxiv_id_is_arxiv":true,"paper":"/paper/accessing-gpt-4-level-mathematical-olympiad","title":"Accessing GPT-4 level Mathematical Olympiad Solutions via Monte Carlo Tree Self-refine with LLaMa-3 8B","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"trotsky1997/mathblackbox","path":"run_with_earlystopping.py","file_url":"https://github.com/trotsky1997/mathblackbox/blob/HEAD/run_with_earlystopping.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, trotsky1997/mathblackbox when it was checked","code_sha256":"841780ad150562ae","code_sha256_prefix":"841780ad150562ae","mcp_get_code":{"code_sha256":"841780ad150562ae"}},{"arxiv_id":"2025.findings-acl.1225","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.1225","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HieuNT91/attention_pruning","path":"src/math500_utils.py","file_url":"https://github.com/HieuNT91/attention_pruning/blob/HEAD/src/math500_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb8a8b4f24c96ca5","code_sha256_prefix":"fb8a8b4f24c96ca5","mcp_get_code":{"code_sha256":"fb8a8b4f24c96ca5"}}],"record_sha256":"8237cc1c071541c056f5f4ce3d147a3097f400d0886fa78c39b78cf047147413","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}