{"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":"56cb8ede-214f-5817-b1f2-3ad983d06402","task_key":"test--56cb8ede-214f-5817-b1f2-3ad983d06402","task_revision_id":"1","upstream_id":"","short_description":"G.H. Hardy once went to visit Srinivasa Ramanujan in the hospital, and he…","config":"","split":"test","body":"{\"problem\":\"G.H. Hardy once went to visit Srinivasa Ramanujan in the hospital, and he started the conversation with: \\\"I came here in taxi-cab number 1729. That number seems dull to me, which I hope isn't a bad omen.\\\" \\\"Nonsense,\\\" said Ramanujan. \\\"The number isn't dull at all. It's quite interesting. It's the smallest number that can be expressed as the sum of two cubes in two different ways.\\\" Ramanujan had immediately seen that $1729 = 12^{3} + 1^{3} = 10^{3} + 9^{3}$. What is the smallest positive integer representable as the sum of the cubes of three positive integers in two different ways?\"}","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":[]}