{"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/is-multi-choice","entry":"is_multi_choice","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":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":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"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":1,"ran_draft_wrong":0,"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":"2604.11056","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/QwenLM/Qwen2.5-Math/blob/HEAD/evaluation/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, QwenLM/Qwen2.5-Math when it was checked","code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2601.03895","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/chi2liu/ABC-GRPO/blob/HEAD/eval_math/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2505.19716","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/evanwu1125/litecot/blob/HEAD/eval/Qwen2.5-Math/evaluation/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2504.20571","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/ypwang61/one-shot-rlvr/blob/HEAD/Qwen2.5-Eval/evaluation/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2504.05185","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/ai-wand/concise-reasoning/blob/HEAD/eval/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2503.18892","arxiv_id_is_arxiv":true,"paper":"/paper/simplerl-zoo-investigating-and-taming-zero","title":"SimpleRL-Zoo: Investigating and Taming Zero Reinforcement Learning for Open Base Models in the Wild","date":"2025-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nlp/simplerl-reason","path":"examples/simplelr_math_eval/math_eval.py","file_url":"https://github.com/hkust-nlp/simplerl-reason/blob/HEAD/examples/simplelr_math_eval/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2502.06773","arxiv_id_is_arxiv":true,"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/eval_math_data_parallel.py","file_url":"https://github.com/GuanghaoYe/Emergence-of-Thinking/blob/HEAD/evaluation/eval_math_data_parallel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17fa07643a5a08e5","code_sha256_prefix":"17fa07643a5a08e5","mcp_get_code":{"code_sha256":"17fa07643a5a08e5"}},{"arxiv_id":"2410.07985","arxiv_id_is_arxiv":true,"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/math_eval.py","file_url":"https://github.com/kbsdjames/omni-math-rule/blob/HEAD/evaluation/math_eval.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kbsdjames/omni-math-rule when it was checked","code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}},{"arxiv_id":"2309.00071","arxiv_id_is_arxiv":true,"paper":"/paper/yarn-efficient-context-window-extension-of","title":"YaRN: Efficient Context Window Extension of Large Language Models","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qwenlm/qwq","path":"eval/eval/math_opensource.py","file_url":"https://github.com/qwenlm/qwq/blob/HEAD/eval/eval/math_opensource.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d338a8cb44aeb6b4","code_sha256_prefix":"d338a8cb44aeb6b4","mcp_get_code":{"code_sha256":"d338a8cb44aeb6b4"}}],"record_sha256":"90c288f3f18695cc32530df29e6092dbaeb0750c41ed0fbc6ad22daca235793d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}