{"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":"/paper/harp-a-challenging-human-annotated-math","title":"HARP: A challenging human-annotated math reasoning benchmark","arxiv_id":"2412.08819","date":"2024-12-11","proceeding":null,"authors":["Albert S. Yue","Lovish Madaan","Ted Moskovitz","DJ Strouse","Aaditya K. Singh"],"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.","url_abs":"https://arxiv.org/abs/2412.08819v1","url_pdf":"https://arxiv.org/pdf/2412.08819v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"harp-a-challenging-human-annotated-math","repo_url":"https://github.com/aadityasingh/harp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"math","task_name":"Math"}],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2412.08819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08819"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/aadityasingh/harp","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":10},"by_repo_kind":{"official":{"samples":10,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"12c9e8e768b232e8","entry":"apply_fn_to_trie","repo":"aadityasingh/harp","repo_kind":"official","path":"src/hendrycks_math_duplicate_find.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/hendrycks_math_duplicate_find.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"12c9e8e768b232e8"}},{"code_sha256_prefix":"6a78fa4ca56faf73","entry":"clean_latex_whitespace","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/parsing_lib.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/parsing_lib.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6a78fa4ca56faf73"}},{"code_sha256_prefix":"da52349b06d44177","entry":"count_tokens","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/costs.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/costs.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"da52349b06d44177"}},{"code_sha256_prefix":"cf5843ce85c71a69","entry":"extract_answer","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/parsing_lib.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/parsing_lib.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cf5843ce85c71a69"}},{"code_sha256_prefix":"f03fa408d8e59ee6","entry":"get_max_depth_and_p_inds","repo":"aadityasingh/harp","repo_kind":"official","path":"src/hendrycks_math_duplicate_find.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/hendrycks_math_duplicate_find.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f03fa408d8e59ee6"}},{"code_sha256_prefix":"670a283b7c871f80","entry":"get_starting_with_str","repo":"aadityasingh/harp","repo_kind":"official","path":"src/hendrycks_math_duplicate_find.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/hendrycks_math_duplicate_find.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"670a283b7c871f80"}},{"code_sha256_prefix":"71ac1255f80e8b94","entry":"has_numbers","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/latex_answer_check.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/latex_answer_check.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"71ac1255f80e8b94"}},{"code_sha256_prefix":"3edeb0b487b12039","entry":"has_structure","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/latex_answer_check.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/latex_answer_check.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"3edeb0b487b12039"}},{"code_sha256_prefix":"f43b9dca910cebb4","entry":"remove_prefix_and_suffix","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/parsing_lib.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/parsing_lib.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f43b9dca910cebb4"}},{"code_sha256_prefix":"62c9d39b633c8fd5","entry":"sympy_parse","repo":"aadityasingh/harp","repo_kind":"official","path":"src/eval/latex_answer_check.py","file_url":"https://github.com/aadityasingh/harp/blob/HEAD/src/eval/latex_answer_check.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"62c9d39b633c8fd5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}