{"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":"27861f07-87c7-5459-9775-56c837ed68fb","task_key":"default--test--10481","task_revision_id":"1","upstream_id":"10481","short_description":"Of the following problems concerning a given undirected graph G, which is…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['Finding the longest path in G', 'Finding a longest simple cycle in G', 'Finding all Hamiltonian cycles in G', 'Finding a largest clique in G', 'Finding a minimum vertex cover in G', 'Finding a maximum independent set in G', 'Finding a minimum dominating set in G', 'Finding a maximum clique in G', 'Finding a shortest cycle in G']\",\"question\":\"Of the following problems concerning a given undirected graph G, which is currently known to be solvable in polynomial time?\",\"src\":\"ori_mmlu-college_computer_science\"}","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":[]}