VeRA: Renewing Reasoning Benchmarks with Executable Specifications
Not on the map. Why?
Abstract (arXiv)
Reasoning benchmarks need renewal along two axes: freshness and headroom. VeRA makes both executable and auditable by turning each item into a task family: a natural-language template, an input generator, and a deterministic answer program. VeRA-E draws fresh instances within a family; VeRA-H modifies the family toward harder tasks; and VeRA-H Pro selects one judge-ranked candidate from up to five validated proposals per seed. Execution checks, seed anchoring, answer discrimination, and independent human solving validate specifications and items. Accepted programs generate further labeled instances through local computation. Across 16 models, AIME-2024 accuracy decreases from 84.46% on seeds to 70.25% on VeRA-E variants, exposing a gap between fixed-item success and fresh-instance robustness. On AIME-2024-II, the human-audited VeRA-H Pro release lowers accuracy from 84.91% to 58.57%. Across the three hardening sources, H Pro has lower mean accuracy than H. On AMO-Bench, both releases average higher accuracy than the seeds under the evaluated budget. Initial auditing accepts 75.4% of hardened candidates; targeted repair raises usable yield to 95.1%. Executable families thus support repeatable benchmark renewal, with validation improving task quality and selection shaping the delivered challenge.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 49 of its 50 references that are in the map. First posted on arXiv 23 Jan 2026.
Builds on
49 of 50 references.
References · 49
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2023Let's Verify Step by Stepcited by 3,789
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2022Self-Instruct: Aligning Language Models with Self-Generated Instructionscited by 2,724
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,784
37 more
- 2022Competition-Level Code Generation with AlphaCodecited by 1,462
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2018Datasheets for Datasetscited by 1,386
- 2023WizardLM: Empowering large pre-trained language models to follow complex instructionscited by 1,125
- 2022Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Taskscited by 1,076
- 2022STaR: Bootstrapping Reasoning With Reasoningcited by 940
- 2021Measuring Coding Challenge Competence With APPScited by 902
- 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 735
- 2023Textbooks Are All You Needcited by 569
- 2024GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Modelscited by 550
- 2023MAmmoTH: Building Math Generalist Models through Hybrid Instruction Tuningcited by 487
- 2019Leveraging Procedural Generation to Benchmark Reinforcement Learningcited by 483
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 427
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2023Detecting Pretraining Data from Large Language Modelscited by 387
- 2023Orca: Progressive Learning from Complex Explanation Traces of GPT-4cited by 379
- 2022CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learningcited by 358
- 2023NLP Evaluation in trouble: On the Need to Measure LLM Data Contamination for each Benchmarkcited by 348
- 2025Absolute Zero: Reinforced Self-play Reasoning with Zero Datacited by 344
- 2024LiveBench: A Challenging, Contamination-Limited LLM Benchmarkcited by 262
- 2024A Careful Examination of Large Language Model Performance on Grade School Arithmeticcited by 191
- 2023Time Travel in LLMs: Tracing Data Contamination in Large Language Modelscited by 177
- 2025Seed1.5-Thinking: Advancing Superb Reasoning Models with Reinforcement Learningcited by 161
- 2023TACO: Topics in Algorithmic COde generation datasetcited by 160
- 2024GSM-Plus: A Comprehensive Benchmark for Evaluating the Robustness of LLMs as Mathematical Problem Solverscited by 158
- 2024Benchmark Data Contamination of Large Language Models: A Surveycited by 147
- 2023DyVal: Dynamic Evaluation of Large Language Models for Reasoning Taskscited by 101
- 2025AMO-Bench: Large Language Models Still Struggle in High School Math Competitionscited by 38
- 2025AutoLogi: Automated Generation of Logic Puzzles for Evaluating Reasoning Abilities of Large Language Modelscited by 31
- 2024DARG: Dynamic Evaluation of Large Language Models via Adaptive Reasoning Graphcited by 26
- 2025Mathematical Reasoning in Large Language Models: Assessing Logical and Arithmetic Errors across Wide Numerical Rangescited by 24
- 2025Putnam-AXIOM: A Functional and Static Benchmark for Measuring Higher Level Mathematical Reasoning in LLMscited by 11
- 2025VAR-MATH: Probing True Mathematical Reasoning in LLMS via Symbolic Multi-Instance Benchmarkscited by 8
- 2025BeyondBench: Contamination-Resistant Evaluation of Reasoning in Language Modelscited by 8
- 2025Benchmarking LLMs' Mathematical Reasoning with Unseen Random Variables Questionscited by 7
- 2024PaCoST: Paired Confidence Significance Testing for Benchmark Contamination Detection in Large Language Modelscited by 6
- 2025Toward Automated Robustness Evaluation of Mathematical Reasoningcited by 6
Built on by
Not cited yet.