{"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":"4ebaad35-a1ec-5254-b902-40e552029c02","task_key":"test--4ebaad35-a1ec-5254-b902-40e552029c02","task_revision_id":"1","upstream_id":"","short_description":"We say that a subset of $\\mathbb{R}^{n}$ is $k$-almost contained by a hyperplane…","config":"","split":"test","body":"{\"problem\":\"We say that a subset of $\\\\mathbb{R}^{n}$ is $k$-almost contained by a hyperplane if there are less than $k$ points in that set which do not belong to the hyperplane. We call a finite set of points $k$-generic if there is no hyperplane that $k$-almost contains the set. For each pair of positive integers $k$ and $n$, find the minimal number $d(k, n)$ such that every finite $k$-generic set in $\\\\mathbb{R}^{n}$ contains a $k$-generic subset with at most $d(k, n)$ elements.\"}","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":[]}