{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:32Z","timestamp":1773377672364,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2006455,2107344"],"award-info":[{"award-number":["CCF-2006455,2107344"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518270","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1973-1978","source":"Crossref","is-referenced-by-count":6,"title":["Semiquantitative Group Testing in at Most Two Rounds"],"prefix":"10.1109","author":[{"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[{"name":"University of Michigan,Department of EECS,Ann Arbor,MI"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"Naval Information Warfare Center,San Diego"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[{"name":"University of Illinois,Department of ECE,Urbana,IL"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089379"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2327630"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524002"},{"key":"ref13","first-page":"26","article-title":"A coding model for a multiple-access adder channel","author":"d'yachkov","year":"1981","journal-title":"Probl Peradach Inform"},{"key":"ref14","first-page":"229","article-title":"A survey of superimposed code theory","volume":"12","author":"dyachkov","year":"1983","journal-title":"Problems of Control and Information Theory"},{"key":"ref15","article-title":"AC-DC: Amplification curve diagnostics for Covid-19 group testing","author":"gabrys","year":"2020","journal-title":"ArXiv"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1975.10480324"},{"key":"ref17","first-page":"557","article-title":"Efficiently decodable error-correcting list disjunct matrices and applications","author":"ngo","year":"2011","journal-title":"International Colloquium on Automata Languages and Programming"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2163296"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1975.10480324"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902397"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01609873"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref6","article-title":"Lectures on designing screening experiments","author":"dyachkov","year":"2004","journal-title":"Lecture Notes Series"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057026"},{"key":"ref8","article-title":"Determining subsets by unramified experiments","author":"lindstrom","year":"1975","journal-title":"A Survey of Statistical Design and Linear Models"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_45"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053689"},{"key":"ref9","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03409-1_7"},{"key":"ref22","article-title":"Combinatorial group testing schemes with near-optimal decoding time","author":"cheraghchi","year":"0","journal-title":"Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1996.0012"},{"key":"ref26","article-title":"Improved algorithms for non-adaptive group testing with consecutive positives","author":"bui","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref25","first-page":"659","article-title":"Randomness conductors and constant-degree expansion beyond the degree\/2 barrier","author":"capalbo","year":"0","journal-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC)"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518270.pdf?arnumber=9518270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:49Z","timestamp":1773347689000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518270\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518270","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}