{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"e8d6a58e-d0c3-5718-ab9e-7a541a968bf2","task_key":"test--e8d6a58e-d0c3-5718-ab9e-7a541a968bf2","task_revision_id":"1","upstream_id":"","short_description":"How many orderings $(a_{1}, \\ldots, a_{8})$ of $(1,2, \\ldots, 8)$ exist such…","config":"","split":"test","body":"{\"problem\":\"How many orderings $(a_{1}, \\\\ldots, a_{8})$ of $(1,2, \\\\ldots, 8)$ exist such that $a_{1}-a_{2}+a_{3}-a_{4}+a_{5}-a_{6}+a_{7}-a_{8}=0$ ?\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}