{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:47Z","timestamp":1773377627664,"version":"3.50.1"},"reference-count":22,"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:\/\/2.zoppoz.workers.dev:443\/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:\/\/2.zoppoz.workers.dev:443\/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.8849718","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"101-105","source":"Crossref","is-referenced-by-count":2,"title":["A New Algorithm for Two-Stage Group Testing"],"prefix":"10.1109","author":[{"given":"Ilya","family":"Vorobyev","sequence":"first","affiliation":[{"name":"Center for Computational and Data-Intensive Science and Engineering, Skolkovo Institute of Science and Technology, Moscow, 127051, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1120008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2861772"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946014010037"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.37236\/1377","article-title":"New bounds for union-free families of sets","volume":"5","author":"coppersmith","year":"1998","journal-title":"The Electronic Journal of Combinatorics"},{"key":"ref15","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"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.04.005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38768-5_40"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541486"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844097"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90067-1"},{"key":"ref3","first-page":"7","article-title":"Bounds on the length of disjunctive codes","volume":"18","author":"d\u2019yachkov","year":"1982","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref6","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"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"key":"ref8","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref7","article-title":"Lectures on designing screening experiments","author":"d\u2019yachkov","year":"2014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849718"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17327-1","author":"cicalese","year":"2013","journal-title":"Fault-Tolerant Search Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261811"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887089"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.05.001"}],"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":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849718.pdf?arnumber=8849718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:39Z","timestamp":1773347679000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/8849718\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":22,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/isit.2019.8849718","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}