{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:59Z","timestamp":1773376919726,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619476","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"3005-3010","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Designs for Threshold Group Testing Without Gap"],"prefix":"10.1109","author":[{"given":"Thach V.","family":"Bui","sequence":"first","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeow Meng","family":"Chee","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Khu","family":"Vu","sequence":"additional","affiliation":[{"name":"National University of Singapore,Department of Industrial Systems Engineering and Management,Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Efficient designs for threshold group testing without gap","author":"Bui","year":"2024","journal-title":"arXiv preprint"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54024-5_5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1540343.1540357"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_45"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abc5961"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/1936"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893234"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36899-8_25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9754-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.06.003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2907990"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2020.02.002"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539703428002"},{"issue":"3","key":"ref15","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"Dyachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2163296"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref18","first-page":"557","article-title":"Efficiently decodable error-correcting list disjunct matrices and applications - (extended abstract)","volume-title":"Automata, Languages and Programming - 38th International Colloquium, ICALP 2011","volume":"6755","author":"Ngo","year":"2011"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00115"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659619"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3046113"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691242"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613416"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(03)00287-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2002.3257"},{"issue":"4","key":"ref27","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"Dyachkov","year":"1983","journal-title":"Problems of Control and Information Theory"},{"issue":"2","key":"ref28","first-page":"141","article-title":"Random coding bounds on the rate for list-decoding superimposed codes","volume":"19","author":"Rashad","year":"1990","journal-title":"PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORIIINFORMATSII"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.07.022"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3392239"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619476.pdf?arnumber=10619476","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:15Z","timestamp":1773347355000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619476\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619476","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}