{"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":"53cbcefc-e71a-5888-82cb-3f2bf6dd9b6f","task_key":"test--53cbcefc-e71a-5888-82cb-3f2bf6dd9b6f","task_revision_id":"1","upstream_id":"","short_description":"There are 17 people at a party, and each has a reputation that is either…","config":"","split":"test","body":"{\"problem\":\"There are 17 people at a party, and each has a reputation that is either $1,2,3,4$, or 5. Some of them split into pairs under the condition that within each pair, the two people's reputations differ by at most 1. Compute the largest value of $k$ such that no matter what the reputations of these people are, they are able to form $k$ pairs.\"}","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":[]}