{"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":"f778490e-5d77-5b97-9f9f-f33687ce06c3","task_key":"test--f778490e-5d77-5b97-9f9f-f33687ce06c3","task_revision_id":"1","upstream_id":"","short_description":"How many graphs are there on 10 vertices labeled \\(1,2, \\ldots, 10\\) such that…","config":"","split":"test","body":"{\"problem\":\"How many graphs are there on 10 vertices labeled \\\\(1,2, \\\\ldots, 10\\\\) such that there are exactly 23 edges and no triangles?\"}","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":[]}