{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:59:24Z","timestamp":1757627964551,"version":"3.44.0"},"reference-count":14,"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.11114382","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":["The Maximum Number of Sets for 12 Cards is 14"],"prefix":"10.1109","author":[{"given":"Justin","family":"Stevens","sequence":"first","affiliation":[{"name":"Washington University in St. Louis,Division of Computational and Data Sciences,St. Louis,MO,USA"}]},{"given":"Duncan","family":"Wilson","sequence":"additional","affiliation":[{"name":"Independent Researcher, San Francisco, CA, USA"}]},{"given":"Richard","family":"Kelley","sequence":"additional","affiliation":[{"name":"Independent Researcher, Washington, DC, USA"}]}],"member":"263","reference":[{"volume-title":"The on-line encyclopedia of integer sequences","year":"2025","key":"ref1"},{"volume-title":"The maximum number of sets for N cards and the total number of internal sets for all partitions of the deck","year":"2009","author":"Vinci","key":"ref2"},{"volume-title":"SETSET-ALL","year":"2001","author":"Knuth","key":"ref3"},{"key":"ref4","article-title":"Maximum number of quads","author":"Byrapuram","year":"2023","journal-title":"arXiv preprint"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884483","volume-title":"The Joy of SET: The Many Mathematical Dimensions of a Seemingly Simple Card Game","author":"McMahon","year":"2017"},{"issue":"1","key":"ref6","first-page":"10","article-title":"Geometric models of the card game set","volume":"8","author":"Tucker","year":"2007","journal-title":"Rose-Hulman Undergraduate Mathematics Journal"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-34017-8_9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5948\/9781614442080"},{"volume-title":"Introductory combinatorics","year":"2004","author":"Brualdi","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CoG57401.2023.10333219"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"volume-title":"Mathematical proof of the magic squares","year":"2019","author":"Falco","key":"ref12"},{"article-title":"The game set as $\\mathbb{F}_{3}^{4}$","year":"2011","author":"Fairbanks","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/bf02984846"}],"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\/11114382.pdf?arnumber=11114382","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T05:27:17Z","timestamp":1757482037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11114382\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cog64752.2025.11114382","relation":{},"subject":[],"published":{"date-parts":[[2025,8,26]]}}}