{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"66f2b029-0341-51e6-8b31-977b458c8375","task_key":"test--66f2b029-0341-51e6-8b31-977b458c8375","task_revision_id":"3","upstream_id":"","short_description":"Find the smallest positive number $\\lambda$, such that for any $12$ points on…","config":"","split":"test","body":"{\"problem\":\"Find the smallest positive number $\\\\lambda$, such that for any $12$ points on the plane $P_1,P_2,\\\\ldots,P_{12}$(can overlap), if the distance between any two of them does not exceed $1$, then $\\\\sum_{1\\\\le i<j\\\\le 12} |P_iP_j|^2\\\\le \\\\lambda$.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}