{"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":"837d56fb-81f5-56b5-a3b5-3ed83a1c95c4","task_key":"test--837d56fb-81f5-56b5-a3b5-3ed83a1c95c4","task_revision_id":"1","upstream_id":"","short_description":"Find the largest positive integer $k{}$ for which there exists a convex…","config":"","split":"test","body":"{\"problem\":\"Find the largest positive integer $k{}$ for which there exists a convex polyhedron $\\\\mathcal{P}$ with 2022 edges, which satisfies the following properties:\\n[list]\\n[*]The degrees of the vertices of $\\\\mathcal{P}$ don’t differ by more than one, and\\n[*]It is possible to colour the edges of $\\\\mathcal{P}$ with $k{}$ colours such that for every colour $c{}$, and every pair of vertices $(v_1, v_2)$ of $\\\\mathcal{P}$, there is a monochromatic path between $v_1$ and $v_2$ in the colour $c{}$.\\n[/list]\\n[i]Viktor Simjanoski, Macedonia[/i]\"}","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":[]}