{"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":"6db97535-af71-5e31-8fed-6b293b318b53","task_key":"test--6db97535-af71-5e31-8fed-6b293b318b53","task_revision_id":"1","upstream_id":"","short_description":"Begining at a vertex, an ant crawls between the vertices of a regular…","config":"","split":"test","body":"{\"problem\":\"Begining at a vertex, an ant crawls between the vertices of a regular octahedron. After reaching a vertex, it randomly picks a neighboring vertex (sharing an edge) and walks to that vertex along the adjoining edge (with all possibilities equally likely.) What is the probability that after walking along 2006 edges, the ant returns to the vertex where it began?\"}","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":[]}