{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:54Z","timestamp":1773377814033,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849477","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2364-2368","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming"],"prefix":"10.1109","author":[{"given":"Yeow Meng","family":"Chee","sequence":"first","affiliation":[{"name":"Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore"}]},{"given":"Han","family":"Mao Kiah","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"529","DOI":"10.3934\/amc.2011.5.529","article-title":"Optimal batch codes: many items or low retrieval requirement","volume":"5","author":"bujt\u00e1s","year":"2011","journal-title":"Adv Math Commun"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2010.4.419"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0468-3"},{"key":"ref6","author":"chvatal","year":"1983","journal-title":"Linear Programming"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18514\/MMN.2011.325"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2009.3.13"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2012.6.165"},{"key":"ref9","first-page":"1","article-title":"Optimal combinatorial batch codes based on block designs","author":"silberstein","year":"2014","journal-title":"Des Codes Cryptogr"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.08.046"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849477.pdf?arnumber=8849477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:14Z","timestamp":1773347714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849477\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849477","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}