Home › Code › choice_answer_clean

choice_answer_clean

Syntologyentry name in harvested coderead from the graph 2026-09-24

choice_answer_clean appears in the code Syntology harvested for 17 papers, as 3 distinct code bodies found in 18 places (a place is one code body under one paper). At least one of them ran in 0 of the papers; 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named choice_answer_clean do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 0 of the 3 distinct code bodies named choice_answer_clean; 3 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
0ran · fixture could not drive it
0ran
3unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 3 of the 18 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

17 papers shown of 17, newest first; 18 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 4 papers added by Syntology; 1 papers have no page here and are shown by arXiv id only. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Where Hindsight Credit Can Reside: A Signed-Capacity View of Token Updates in RLVR added by Syntology 2026-04 (from id) QwenLM/Qwen2.5-Math/evaluation/grader.py 809c0178a7ae90ff unverified no licence file found · pointer only
All-Quadrant Bounded Clipping GRPO: Closing the Unbounded Blind Spot for Stable and Generalizable Training added by Syntology 2026-01 (from id) chi2liu/ABC-GRPO/eval_math/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
TokenSqueeze: Performance-Preserving Compression for Reasoning LLMs added by Syntology 2025-11 (from id) zhangyx1122/TokenSqueeze/utils/qwen_verify.py 809c0178a7ae90ff unverified no licence file found · pointer only
Can Large Models Teach Student Models to Solve Mathematical Problems Like Human Beings? A Reasoning Distillation Method via Multi-LoRA Interaction added by Syntology 2025-08 (from id) Xinhe-Li/LoRID/src/evaluation/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
QFFT, Question-Free Fine-Tuning for Adaptive Reasoning 15 Jun 2025 lwl-cpu/question-free-fine-tuning/eval/utils/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Prompting 26 May 2025 evanwu1125/litecot/eval/Qwen2.5-Math/evaluation/grader.py 809c0178a7ae90ff unverified MIT (permissive)
How Should We Enhance the Safety of Large Reasoning Models: An Empirical Study 21 May 2025 thu-coai/lrm-safety-study/reasoning_evaluation/utils/grader.py 809c0178a7ae90ff unverified MIT (permissive)
Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space 19 May 2025 bigai-nlco/latentseek/src/extract_judge_answer/grader.py 809c0178a7ae90ff unverified MIT (permissive)
Seek in the Dark: Reasoning via Test-Time Instance-Level Policy Gradient in Latent Space 19 May 2025 bigai-nlco/latentseek/src/extract_judge_answer/parse_utils_qwen.py 29ac3caee056dbbd unverified MIT (permissive)
Absolute Zero: Reinforced Self-play Reasoning with Zero Data 6 May 2025 LeapLabTHU/Absolute-Zero-Reasoner/absolute_zero_reasoner/rewards/custom_evaluate.py 0742e5f056e04404 unverified MIT (permissive)
Reinforcement Learning for Reasoning in Large Language Models with One Training Example 29 Apr 2025 ypwang61/one-shot-rlvr/Qwen2.5-Eval/evaluation/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
Concise Reasoning via Reinforcement Learning 7 Apr 2025 ai-wand/concise-reasoning/eval/grader.py 809c0178a7ae90ff unverified MIT (permissive)
MathFusion: Enhancing Mathematic Problem-solving of LLM through Instruction Fusion 20 Mar 2025 qizhipei/mathfusion/evaluation/dart_math/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
Revisiting the Test-Time Scaling of o1-like Models: Do they Truly Possess Test-Time Scaling Capabilities? 17 Feb 2025 ZhiYuanZeng/test-time-scaling-eval/qwen_math_evaluator.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
On the Emergence of Thinking in LLMs I: Searching for the Right Intuition 10 Feb 2025 GuanghaoYe/Emergence-of-Thinking/evaluation/grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)
Can 1B LLM Surpass 405B LLM? Rethinking Compute-Optimal Test-Time Scaling 10 Feb 2025 RyanLiu112/compute-optimal-tts/src/envs/MATH/grader.py 809c0178a7ae90ff unverified MIT (permissive)
Omni-MATH: A Universal Olympiad Level Mathematic Benchmark For Large Language Models 10 Oct 2024 kbsdjames/omni-math-rule/evaluation/grader.py 809c0178a7ae90ff unverified no licence file found · pointer only
arXiv:openreview_Tkdgg5uqNK ZhijianZhou/Disppo/recipe/disppo/eval_grader.py 809c0178a7ae90ff unverified Apache-2.0 (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections