{"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":"43d9dbbf-c119-5067-939e-bc8a11424461","task_key":"test--43d9dbbf-c119-5067-939e-bc8a11424461","task_revision_id":"1","upstream_id":"","short_description":"Today, Ivan the Confessor prefers continuous functions \\(f:[0,1] \\rightarrow…","config":"","split":"test","body":"{\"problem\":\"Today, Ivan the Confessor prefers continuous functions \\\\(f:[0,1] \\\\rightarrow \\\\mathbb{R}\\\\) satisfying \\\\(f(x)+f(y) \\\\geq|x-y|\\\\) for all pairs \\\\(x, y \\\\in[0,1]\\\\). Find the minimum of \\\\(\\\\int_{0}^{1} f\\\\) over all preferred functions.\"}","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":[]}