{"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":"4807ecc1-d6d6-5258-bebd-1f13822f153c","task_key":"default--test--10770","task_revision_id":"1","upstream_id":"10770","short_description":"Let a undirected graph G with edges E =…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['[2, 8, 5, 10]', '[2, 5, 6, 8, 10]', '[2, 6, 5, 10]', '[2, 5, 6, 10]', '[2, 6, 8, 10]', '[2, 8, 10]', '[2, 6, 10]', '[2, 5, 8, 10]', '[2, 10]', '[2, 8, 5, 6, 10]']\",\"question\":\"Let a undirected graph G with edges E = {<2,6>,<2,8>,<2,5>,<6,5>,<5,8>,<6,10>,<10,8>}, which <A,B> represent Node A is connected to Node B. What is the shortest path from node 2 to node 10? Represent the path as a list.\",\"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":[]}