{"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":"5b757672-cf4b-5211-832d-a7a42a6adc4d","task_key":"test--5b757672-cf4b-5211-832d-a7a42a6adc4d","task_revision_id":"1","upstream_id":"","short_description":"Kelvin the Frog is trying to hop across a river. The river has 10 lilypads on…","config":"","split":"test","body":"{\"problem\":\"Kelvin the Frog is trying to hop across a river. The river has 10 lilypads on it, and he must hop on them in a specific order (the order is unknown to Kelvin). If Kelvin hops to the wrong lilypad at any point, he will be thrown back to the wrong side of the river and will have to start over. Assuming Kelvin is infinitely intelligent, what is the minimum number of hops he will need to guarantee reaching the other side?\"}","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":[]}