{"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":"ca06af51-4167-544c-8842-29908fa4ecf0","task_key":"test--ca06af51-4167-544c-8842-29908fa4ecf0","task_revision_id":"1","upstream_id":"","short_description":"Can the set of lattice points $\\{(x, y) \\mid x, y \\in \\mathbb{Z}, 1 \\leq x, y…","config":"","split":"test","body":"{\"problem\":\"Can the set of lattice points $\\\\{(x, y) \\\\mid x, y \\\\in \\\\mathbb{Z}, 1 \\\\leq x, y \\\\leq 252, x \\\\neq y\\\\}$ be colored using 10 distinct colors such that for all $a \\\\neq b, b \\\\neq c$, the colors of $(a, b)$ and $(b, c)$ are distinct?\"}","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":[]}