{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:57Z","timestamp":1773376977374,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2348638"],"award-info":[{"award-number":["CCF-2348638"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195359","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Game of Coding with Unknown Adversary"],"prefix":"10.1109","author":[{"given":"Hanzaleh","family":"Akbarinodehi","sequence":"first","affiliation":[{"name":"University of Minnesota, Twin Cities,Minneapolis,MN,USA"}]},{"given":"Parsa","family":"Moradi","sequence":"additional","affiliation":[{"name":"University of Minnesota, Twin Cities,Minneapolis,MN,USA"}]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[{"name":"University of Minnesota, Twin Cities,Minneapolis,MN,USA"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Essential Coding Theory","author":"Guruswami","year":"2022"},{"key":"ref2","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"The 22nd International Conference on Artificial Intelligence and Statistics","author":"Yu"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977918"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC49272.2021.9594259"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3151434"},{"key":"ref7","article-title":"Blockchains cannot rely on honesty","volume-title":"The 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS2020)","author":"Sliwinski","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3433210.3453087"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3386\/w31473"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619701"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00935665"},{"key":"ref12","first-page":"arXiv-2410","article-title":"Game of coding: Sybil resistant decentralized machine learning with minimal trust assumption","author":"Nodehi","year":"2024","journal-title":"arXiv e-prints"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134717"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3580507.3597680"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04645-2_23"},{"key":"ref16","article-title":"Learning optimal commitment to overcome insecurity","volume":"27","author":"Blum","year":"2014","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012149"},{"key":"ref18","first-page":"8971","article-title":"Learning to play sequential games versus unknown opponents","volume":"33","author":"Sessa","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2764468.2764478"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538308"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219193"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238232"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s12220-021-00860-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0865-5_26"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195359.pdf?arnumber=11195359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:43Z","timestamp":1773347383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195359\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195359","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}