{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:16:29Z","timestamp":1755800189434,"version":"3.44.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,26]]},"DOI":"10.1109\/cog64752.2025.11114357","type":"proceedings-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T18:06:42Z","timestamp":1755626802000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["What Makes a Level Hard in Super Mario Maker 2?"],"prefix":"10.1109","author":[{"given":"Carlo A.","family":"Furia","sequence":"first","affiliation":[{"name":"Software Institute - USI Università della Svizzera italiana,Lugano,Switzerland"}]},{"given":"Andrea","family":"Mocci","sequence":"additional","affiliation":[{"name":"Software Institute - USI Università della Svizzera italiana,Lugano,Switzerland"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1:1","article-title":"Baba Is Universal","volume-title":"Conference on Fun with Algorithms (FUN)","author":"Abel","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcom.2012.09.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.02.037"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04052-8_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2071423.2071484"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.findings-emnlp.148"},{"issue":"4","key":"ref7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1232743.1232769","article-title":"Flow in games (and everything else). Commun","volume":"50","author":"Chen","year":"2007","journal-title":"ACM"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/bf02195664"},{"key":"ref9","first-page":"13:1","article-title":"Super Mario Bros. is Harder\/Easier Than We Thought","volume-title":"Conference on Fun with Algorithms (FUN)","author":"Demaine","year":"2016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3705013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3490953"},{"key":"ref12","article-title":"Bertopic: Neural topic modeling with a class-based tf-idf procedure","author":"Grootendorst","year":"2022","journal-title":"arXiv preprint"},{"key":"ref13","first-page":"22:1","article-title":"You Can\u2019t Solve These Super Mario Bros","volume-title":"Levels: Undecidable Mario Games. In Conference on Fun with Algorithms (FUN)","author":"Ani"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CogInfoCom63007.2024.10894725"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACII.2015.7344647"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1201\/9780429029608"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2024.3366239"},{"key":"ref18","first-page":"1","article-title":"Appropriate statistics for ordinal level data","author":"Romano","year":"2006","journal-title":"Annual meeting of the Florida Association of Institutional Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90238-4_26"},{"key":"ref20","article-title":"The computational complexity of angry birds","volume-title":"Proceedings of IJCAI 2020","author":"Stephenson","year":"2021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2019.8848096"},{"volume-title":"Mario Maker 2 datasets","year":"2022","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.09.022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2021.3072545"}],"event":{"name":"2025 IEEE Conference on Games (CoG)","start":{"date-parts":[[2025,8,26]]},"location":"Lisbon, Portugal","end":{"date-parts":[[2025,8,29]]}},"container-title":["2025 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11113832\/11113841\/11114357.pdf?arnumber=11114357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T07:16:05Z","timestamp":1755674165000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11114357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/cog64752.2025.11114357","relation":{},"subject":[],"published":{"date-parts":[[2025,8,26]]}}}