{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmmu-pro","formal_name":"MMMU-Pro","introduction":"MMMU-Pro evaluates multimodal understanding across academic disciplines using images and text. The official card lists 1,730 questions per setting, separating four-option and ten-option standard settings from the vision setting.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://mmmu-benchmark.github.io/","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":"1dddf655-03e2-5f97-bdca-0aeb4ac76e84","task_key":"standard~20~2810~20options~29--test--validation~5fComputer~5fScience~5f29","task_revision_id":"4","upstream_id":"validation_Computer_Science_29","short_description":"A finite automaton (FA) is an abstract machine that can be used to represent…","config":"standard (10 options)","split":"test","body":"{\"img_type\":\"['Diagrams']\",\"options\":\"['([1-9][0-9]*)|0', '[1-9]*[0-9]', '[1-9]+[0-9]*', '([1-9][0-9]+)|0', '[1-9][0-9]*', '[0-9]+', 'none of the above', '([1-9][0-9])|0']\",\"question\":\"A finite automaton (FA) is an abstract machine that can be used to represent certain forms of computation. <image 1> The above FA identifies which of the following regular expressions?\",\"subject\":\"Computer_Science\"}","display_format":"text","language":"","answer_status":"published","assets":[{"kind":"file","reference_id":"task:1dddf655-03e2-5f97-bdca-0aeb4ac76e84:4:image_1.png","filename":"image_1.png","media_type":"image/png","alt":""}],"source_url":"https://mmmu-benchmark.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}