{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu-pro","formal_name":"MMLU-Pro","introduction":"MMLU-Pro rebuilds MMLU with ten answer options instead of four and removes items that no longer separate models. Questions span fourteen academic and professional subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","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":"fd0cc77c-594d-5cc2-9188-be82e5b7c648","task_key":"default--test--10465","task_revision_id":"1","upstream_id":"10465","short_description":"Let $X$ be uniformly distributed over $\\{1, 2, \\ldots, 256\\}$. We ask random…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['1024', '64', '1', '512', '8', '16', '4', '32', '256', '128']\",\"question\":\"Let $X$ be uniformly distributed over $\\\\{1, 2, \\\\ldots, 256\\\\}$. We ask random questions: Is $X\\\\in S_1$? Is $X\\\\in S_2$? ... until only one integer remains. All $2^256$ subsets of $\\\\{1, 2, \\\\ldots, 256\\\\}$ are equally likely. How many deterministic questions are needed to determine $X$?\",\"src\":\"theoremQA-EECS\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}