{"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":"b9f52e16-4a91-5d9d-a29e-e859cff49e89","task_key":"test--b9f52e16-4a91-5d9d-a29e-e859cff49e89","task_revision_id":"1","upstream_id":"","short_description":"A deck of 100 cards is labeled $1,2, \\ldots, 100$ from top to bottom. The top…","config":"","split":"test","body":"{\"problem\":\"A deck of 100 cards is labeled $1,2, \\\\ldots, 100$ from top to bottom. The top two cards are drawn; one of them is discarded at random, and the other is inserted back at the bottom of the deck. This process is repeated until only one card remains in the deck. Compute the expected value of the label of the remaining card.\"}","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":[]}