{"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":"687aa045-5e94-5354-9a9d-47778cf41f04","task_key":"default--test--10386","task_revision_id":"1","upstream_id":"10386","short_description":"Which of the following problems can be solved by a standard greedy algorithm?","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['None of the above', 'III only', 'I, II and III', 'III, and II, but not always I', 'I, and II, but not always III', 'I and II only', 'II only', 'II and III only', 'I only', 'I and III 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\",\"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":[]}