{"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":"ae2d695d-9734-51a1-af0a-81359de6e7e2","task_key":"test--ae2d695d-9734-51a1-af0a-81359de6e7e2","task_revision_id":"1","upstream_id":"","short_description":"Kevin starts with the vectors \\((1,0)\\) and \\((0,1)\\) and at each time step, he…","config":"","split":"test","body":"{\"problem\":\"Kevin starts with the vectors \\\\((1,0)\\\\) and \\\\((0,1)\\\\) and at each time step, he replaces one of the vectors with their sum. Find the cotangent of the minimum possible angle between the vectors after 8 time steps.\"}","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":[]}