{"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/extract-multi-choice-answer","entry":"extract_multi_choice_answer","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":13,"n_papers_ran":0,"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":2,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"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":"2604.11056","paper":"/paper/arxiv-2604-11056","title":"Where Hindsight Credit Can Reside: A Signed-Capacity View of Token Updates in RLVR","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"QwenLM/Qwen2.5-Math","path":"evaluation/parser.py","file_url":"https://github.com/QwenLM/Qwen2.5-Math/blob/HEAD/evaluation/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2604.08281","paper":"/paper/arxiv-2604-08281","title":"When to Trust Tools? Adaptive Tool Trust Calibration For Tool-Integrated Math Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"00Dreamer00/ATTC","path":"parser.py","file_url":"https://github.com/00Dreamer00/ATTC/blob/HEAD/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2601.03895","paper":"/paper/arxiv-2601-03895","title":"All-Quadrant Bounded Clipping GRPO: Closing the Unbounded Blind Spot for Stable and Generalizable Training","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"chi2liu/ABC-GRPO","path":"eval_math/parser.py","file_url":"https://github.com/chi2liu/ABC-GRPO/blob/HEAD/eval_math/parser.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":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2506.12860","paper":"/paper/qfft-question-free-fine-tuning-for-adaptive","title":"QFFT, Question-Free Fine-Tuning for Adaptive Reasoning","date":"2025-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lwl-cpu/question-free-fine-tuning","path":"eval/utils/parser.py","file_url":"https://github.com/lwl-cpu/question-free-fine-tuning/blob/HEAD/eval/utils/parser.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":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2505.19716","paper":"/paper/concise-reasoning-big-gains-pruning-long","title":"Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Prompting","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"evanwu1125/litecot","path":"eval/Qwen2.5-Math/evaluation/parser.py","file_url":"https://github.com/evanwu1125/litecot/blob/HEAD/eval/Qwen2.5-Math/evaluation/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2505.11730","paper":"/paper/rethinking-optimal-verification-granularity","title":"Rethinking Optimal Verification Granularity for Compute-Efficient Test-Time Scaling","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmarkc/VG-Search","path":"src/sal/utils/qwen_math_parser.py","file_url":"https://github.com/hmarkc/VG-Search/blob/HEAD/src/sal/utils/qwen_math_parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2504.20571","paper":"/paper/reinforcement-learning-for-reasoning-in-large","title":"Reinforcement Learning for Reasoning in Large Language Models with One Training Example","date":"2025-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ypwang61/one-shot-rlvr","path":"Qwen2.5-Eval/evaluation/parser.py","file_url":"https://github.com/ypwang61/one-shot-rlvr/blob/HEAD/Qwen2.5-Eval/evaluation/parser.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":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2504.05185","paper":"/paper/concise-reasoning-via-reinforcement-learning","title":"Concise Reasoning via Reinforcement Learning","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-wand/concise-reasoning","path":"eval/parser.py","file_url":"https://github.com/ai-wand/concise-reasoning/blob/HEAD/eval/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2502.06773","paper":"/paper/on-the-emergence-of-thinking-in-llms-i","title":"On the Emergence of Thinking in LLMs I: Searching for the Right Intuition","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GuanghaoYe/Emergence-of-Thinking","path":"evaluation/parser.py","file_url":"https://github.com/GuanghaoYe/Emergence-of-Thinking/blob/HEAD/evaluation/parser.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":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2410.07985","paper":"/paper/omni-math-a-universal-olympiad-level","title":"Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kbsdjames/omni-math-rule","path":"evaluation/parser.py","file_url":"https://github.com/kbsdjames/omni-math-rule/blob/HEAD/evaluation/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2408.03314","paper":"/paper/2408-03314","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/search-and-learn","path":"src/sal/utils/qwen_math_parser.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/utils/qwen_math_parser.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":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"2405.14365","paper":"/paper/jiuzhang3-0-efficiently-improving","title":"JiuZhang3.0: Efficiently Improving Mathematical Reasoning by Training Small Data Synthesis Models","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rucaibox/jiuzhang3.0","path":"eval/parser.py","file_url":"https://github.com/rucaibox/jiuzhang3.0/blob/HEAD/eval/parser.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ed2f4689128f9885","mcp_get_code":{"code_sha256":"ed2f4689128f9885"}},{"arxiv_id":"openreview_Tkdgg5uqNK","paper":null,"title":"arXiv:openreview_Tkdgg5uqNK","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ZhijianZhou/Disppo","path":"recipe/disppo/eval_parser.py","file_url":"https://github.com/ZhijianZhou/Disppo/blob/HEAD/recipe/disppo/eval_parser.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":"26668573c5389108","mcp_get_code":{"code_sha256":"26668573c5389108"}}]}