{"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":"0233537f-ac0d-571b-ac52-d3523adf8c2b","task_key":"test--0233537f-ac0d-571b-ac52-d3523adf8c2b","task_revision_id":"1","upstream_id":"","short_description":"Minimize the function $F(x_1, x_2, \\cdots, x_n)=\\sum_{i=1}^{n}|x_i|$ subject to…","config":"","split":"test","body":"{\"problem\":\"Minimize the function $F(x_1, x_2, \\\\cdots, x_n)=\\\\sum_{i=1}^{n}|x_i|$ subject to the condition that after redistribution we should have at each $A_i, a_i-x_1+x_{i-1}=N$ for $i \\\\in\\\\{1,2, \\\\ldots, n\\\\}$ where $x_0$ means $x_n$.\"}","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":[]}