{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmmu-pro","formal_name":"MMMU-Pro","introduction":"多様な学問分野の画像とテキストを組み合わせ、マルチモーダル理解を評価するベンチマークです。公式データカードでは各設定に1,730問があり、4択・10択の標準設定と画像のみの設定を区別します。\n\nMMMU-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":"noindex"},"task_id":"1dddf655-03e2-5f97-bdca-0aeb4ac76e84","task_key":"standard~20~2810~20options~29--test--validation~5fComputer~5fScience~5f29","task_revision_id":"1","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:1:image_1.png","filename":"image_1.png","media_type":"image/png","alt":""}],"source_url":"https://mmmu-benchmark.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}