{"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":"6f40d658-7888-50bc-b5fd-f5221aed7e6e","task_key":"default--test--10655","task_revision_id":"1","upstream_id":"10655","short_description":"Which of the following algorithms has running time Θ(n^2) in the worst case but…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['Counting Sort', 'Shell Sort', 'Insertion Sort', 'Bubblesort', 'Mergesort', 'Selection Sort', 'Bucket Sort', 'Radix Sort', 'Quicksort', 'Heapsort']\",\"question\":\"Which of the following algorithms has running time Θ(n^2) in the worst case but Θ(n log n) on average?\",\"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":[]}