{"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":"5a180586-984d-5218-aed3-6b3dae70f323","task_key":"all--test--5a180586-984d-5218-aed3-6b3dae70f323","task_revision_id":"1","upstream_id":"","short_description":"Which of the following problems can be solved by a standard greedy algorithm?","config":"all","split":"test","body":"{\"choices\":\"['I only', 'II only', 'III only', 'I and II only']\",\"question\":\"Which of the following problems can be solved by a standard greedy algorithm?\\nI. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights\\nII. Finding a maximum clique in an undirected graph\\nIII. Finding a maximum flow from a source node to a sink node in a directed graph with positive-integer edge capacities\",\"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":[]}