{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","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":"414171c8-4c8b-571e-9a1b-a474489bb145","task_key":"all--test--414171c8-4c8b-571e-9a1b-a474489bb145","task_revision_id":"1","upstream_id":"","short_description":"For a connected, undirected graph G = (V, E), which of the following must be…","config":"all","split":"test","body":"{\"choices\":\"['I only', 'II only', 'III only', 'I and II']\",\"question\":\"For a connected, undirected graph G = (V, E), which of the following must be true?\\nI. Σ_{v∈V} degree(v) is even.\\nII. |E| ≥ |V| − 1\\nIII. G has at least one vertex with degree 1.\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}