{"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":"6541ea1e-19a0-510f-853e-94348322b233","task_key":"test--6541ea1e-19a0-510f-853e-94348322b233","task_revision_id":"1","upstream_id":"","short_description":"An $n$-string is a string of digits formed by writing the numbers $1,2, \\ldots,…","config":"","split":"test","body":"{\"problem\":\"An $n$-string is a string of digits formed by writing the numbers $1,2, \\\\ldots, n$ in some order (in base ten). For example, one possible 10-string is $$35728910461$$ What is the smallest $n>1$ such that there exists a palindromic $n$-string?\"}","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":[]}