{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:05:30Z","timestamp":1774991130539,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541486","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"1183-1191","source":"Crossref","is-referenced-by-count":5,"title":["On a hypergraph approach to multistage group testing problems"],"prefix":"10.1109","author":[{"given":"A. G.","family":"D'yachkov","sequence":"first","affiliation":[{"name":"Lomonosov Moscow State University, Russia"}]},{"given":"I.V.","family":"Vorobyev","sequence":"additional","affiliation":[{"name":"Lomonosov Moscow State University, Russia"}]},{"given":"N.A.","family":"Polyanskii","sequence":"additional","affiliation":[{"name":"Lomonosov Moscow State University, Russia"}]},{"given":"V.Yu.","family":"Shchukin","sequence":"additional","affiliation":[{"name":"Lomonosov Moscow State University, Russia"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103752"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9781-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2014.04.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946014010037"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(97)00092-X"},{"key":"ref5","first-page":"166","article-title":"Bounds on the Length of Disjunctive Codes","volume":"18","author":"d'yachkov","year":"1982","journal-title":"Problems of Information Transmission"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946013040078"},{"key":"ref8","first-page":"112","article-title":"Lectures on Designing Screening Experiments","author":"d'yachkov","year":"2003","journal-title":"Lecture Note Series 10 Combinatorial and Computational Mathematics Center"},{"key":"ref7","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 Inform Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17327-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703428002"},{"key":"ref1","article-title":"Combinatorial Group Testing and Its Applications","volume":"12","author":"du","year":"2000","journal-title":"Series on Applied Mathematics"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541486.pdf?arnumber=7541486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:32Z","timestamp":1774986812000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541486\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541486","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}