{"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":"d6298155-6937-54b6-9556-27c393145a20","task_key":"test--d6298155-6937-54b6-9556-27c393145a20","task_revision_id":"1","upstream_id":"","short_description":"Evaluate the infinite sum $$\\sum_{n=2}^{\\infty} \\log…","config":"","split":"test","body":"{\"problem\":\"Evaluate the infinite sum $$\\\\sum_{n=2}^{\\\\infty} \\\\log _{2}\\\\left(\\\\frac{1-\\\\frac{1}{n}}{1-\\\\frac{1}{n+1}}\\\\right)$$\"}","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":[]}