{"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":"a0b1b87a-ec3e-5b5e-a372-68058e33f808","task_key":"all--test--a0b1b87a-ec3e-5b5e-a372-68058e33f808","task_revision_id":"1","upstream_id":"","short_description":"An Euler circuit of an undirected graph is a circuit in which each edge of the…","config":"all","split":"test","body":"{\"choices\":\"['I only', 'II only', 'III only', 'I and II']\",\"question\":\"An Euler circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an Euler circuit?\\nI. A complete graph with 12 vertices\\nII. A complete graph with 13 vertices\\nIII. A tree with 13 vertices\",\"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":[]}