{"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":"cb95f66b-c7f8-5dec-b4d4-a2d3725a7b5e","task_key":"test--cb95f66b-c7f8-5dec-b4d4-a2d3725a7b5e","task_revision_id":"1","upstream_id":"","short_description":"In Determinant Tic-Tac-Toe, Player 1 enters a 1 in an empty \\(3 \\times 3\\)…","config":"","split":"test","body":"{\"problem\":\"In Determinant Tic-Tac-Toe, Player 1 enters a 1 in an empty \\\\(3 \\\\times 3\\\\) matrix. Player 0 counters with a 0 in a vacant position, and play continues in turn until the \\\\(3 \\\\times 3\\\\) matrix is completed with five 1's and four 0's. Player 0 wins if the determinant is 0 and player 1 wins otherwise. Assuming both players pursue optimal strategies, who will win and how?\"}","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":[]}