{"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":"003a9615-038e-54d8-9847-20b75bc2d58a","task_key":"test--003a9615-038e-54d8-9847-20b75bc2d58a","task_revision_id":"1","upstream_id":"","short_description":"Find the maximum number of points $X_{i}$ such that for each $i$, $\\triangle A B…","config":"","split":"test","body":"{\"problem\":\"Find the maximum number of points $X_{i}$ such that for each $i$, $\\\\triangle A B X_{i} \\\\cong \\\\triangle C D X_{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":[]}