{"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":"50540b66-8a03-5560-95d1-597f7684b76e","task_key":"test--50540b66-8a03-5560-95d1-597f7684b76e","task_revision_id":"1","upstream_id":"","short_description":"Let $\\mathcal{H}$ be the unit hypercube of dimension 4 with a vertex at $(x, y,…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathcal{H}$ be the unit hypercube of dimension 4 with a vertex at $(x, y, z, w)$ for each choice of $x, y, z, w \\\\in \\\\{0,1\\\\}$. A bug starts at the vertex $(0,0,0,0)$. In how many ways can the bug move to $(1,1,1,1)$ by taking exactly 4 steps along the edges of $\\\\mathcal{H}$?\"}","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":[]}