Pith. sign in

REVIEW 3 cited by

HARP: A challenging human-annotated math reasoning benchmark

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2412.08819 v1 pith:KHTE3SOA submitted 2024-12-11 cs.LG

classification cs.LG
keywords problemsmathmodelsfrontierharpreasoningaveragecode
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Math reasoning is becoming an ever increasing area of focus as we scale large language models. However, even the previously-toughest evals like MATH are now close to saturated by frontier models (90.0% for o1-mini and 86.5% for Gemini 1.5 Pro). We introduce HARP, Human Annotated Reasoning Problems (for Math), consisting of 5,409 problems from the US national math competitions (A(J)HSME, AMC, AIME, USA(J)MO). Of these, 4,780 have answers that are automatically check-able (with libraries such as SymPy). These problems range six difficulty levels, with frontier models performing relatively poorly on the hardest bracket of 197 problems (average accuracy 41.1% for o1-mini, and 9.6% for Gemini 1.5 Pro). Our dataset also features multiple choices (for 4,110 problems) and an average of two human-written, ground-truth solutions per problem, offering new avenues of research that we explore briefly. We report evaluations for many frontier models and share some interesting analyses, such as demonstrating that frontier models across families intrinsically scale their inference-time compute for more difficult problems. Finally, we open source all code used for dataset construction (including scraping) and all code for evaluation (including answer checking) to enable future research at: https://github.com/aadityasingh/HARP.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards High Data Efficiency in Reinforcement Learning with Verifiable Reward

    cs.LG 2025-09 conditional novelty 5.0 of 10

    DEPO combines diversity/influence/difficulty-aware offline data selection with an entropy-based online rollout filter and replay, matching full-data GRPO performance with 20% data and 40% rollouts.

  2. MiroMind-M1: An Open-Source Advancement in Mathematical Reasoning via Context-Aware Multi-Stage Policy Optimization

    cs.CL 2025-07 conditional novelty 4.0 of 10

    MiroMind-M1 open-sources a two-stage SFT plus RLVR recipe with a new context-aware multi-stage policy optimization (CAMPO) that claims competitive AIME24, AIME25, and MATH500 scores among Qwen-2.5-based models.

  3. A Survey of Deep Learning for Geometry Problem Solving

    cs.CL 2025-07 conditional novelty 4.0 of 10

    This survey organizes deep learning work on geometry problem solving into task, method, benchmark, and evaluation categories, and highlights open challenges.

Pith tools