{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:42Z","timestamp":1773377082376,"version":"3.50.1"},"reference-count":11,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195523","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":1,"title":["Optimal Functional $2^{s-1}$-Batch Codes: Exploring New Sufficient Conditions"],"prefix":"10.1109","author":[{"given":"Lev","family":"Yohananov","sequence":"first","affiliation":[{"name":"MIGAL - Galilee Research Institute,The Computer Science Department,Kiryat Shmona,Israel,11016"}]},{"given":"Isaac Barouch","family":"Essayag","sequence":"additional","affiliation":[{"name":"MIGAL - Galilee Research Institute,The Computer Science Department,Kiryat Shmona,Israel,11016"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003411"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2010.11.008"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1063\/1.1703773"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref5","article-title":"Finding a perfect matching of $\\mathbb{F}_{2}^{n}$ with prescribed differences","volume-title":"arXiv preprint","author":"Kov\u00e1cs","year":"2023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(08)x7030-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277956"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3162158"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849453"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977631"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195523","article-title":"Optimal Functional $2^{s-1}$ Batch Codes: Exploring New Sufficient Conditions","volume-title":"arXiv preprint","author":"Yohananov","year":"2025"}],"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\/11195523.pdf?arnumber=11195523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:32Z","timestamp":1773347432000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195523","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}