{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:47:45Z","timestamp":1740181665176,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2007714","2139304","2146838","2146828"],"award-info":[{"award-number":["2007714","2139304","2146838","2146828"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/jsait.2024.3386182","type":"journal-article","created":{"date-parts":[[2024,4,15]],"date-time":"2024-04-15T17:42:50Z","timestamp":1713202970000},"page":"236-245","source":"Crossref","is-referenced-by-count":0,"title":["Improving Group Testing via Gradient Descent"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2813-3166","authenticated-orcid":false,"given":"Sundara","family":"Rajan Srinivasavaradhan","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1344-188X","authenticated-orcid":false,"given":"Pavlos","family":"Nikolopoulos","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1002-5829","authenticated-orcid":false,"given":"Christina","family":"Fragouli","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7313-9861","authenticated-orcid":false,"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of California at Los Angeles, Los Angeles, CA, USA"}]}],"member":"263","reference":[{"volume-title":"Group testing against Covid-19","year":"2020","author":"Gollier","key":"ref1"},{"volume-title":"Coronavirus test shortages trigger a new strategy: Group screening","year":"2020","author":"Broadfoot","key":"ref2"},{"volume-title":"Five people. one test. this is how you get there","year":"2020","author":"Ellenberg","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3389\/fpubh.2021.583377"},{"key":"ref5","article-title":"Tapestry: A single-round smart pooling technique for COVID-19 testing","author":"Ghosh","year":"2020","journal-title":"medRxiv, Preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.7326\/M20-1495"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1038\/d41586-020-02053-6","volume-title":"The mathematical strategy that could transform coronavirus testing","author":"Mallapaty","year":"2020"},{"volume-title":"Pooled sample testing and screening testing for covid-19","year":"2020","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/0100000099"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/SAM"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.2017.1366367"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314472"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2861772"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2873136"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaab020"},{"key":"ref20","first-page":"1374","article-title":"Optimal group testing","volume-title":"Proc. Mach. Learn. Res.","author":"Coja-Oghlan"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3123929"},{"key":"ref22","article-title":"A fast binary splitting approach to non-adaptive group testing","author":"Price","year":"2020","journal-title":"arXiv:2006.10268"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023377"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875253"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250119"},{"key":"ref26","first-page":"2341","article-title":"Group testing for connected communities","volume-title":"Proc. 24th Int. Conf. Artif. Intell. Stat.","author":"Nikolopoulos"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500791"},{"key":"ref28","article-title":"Noisy pooled PCR for virus testing","author":"Zhu","year":"2020","journal-title":"arXiv:2004.02689"},{"key":"ref29","article-title":"Contact tracing enhances the efficiency of COVID-19 group testing","author":"Goenka","year":"2020","journal-title":"arXiv:2011.14186"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3247520"},{"key":"ref31","article-title":"Network group testing","author":"Bertolotti","year":"2021","journal-title":"arXiv:2012.02847"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541525"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-50806-1","volume-title":"Mathematics of Epidemics on Networks","volume":"46","author":"Kiss","year":"2017"},{"key":"ref34","article-title":"Dynamic group testing to control and monitor disease progression in a population","author":"Srinivasavaradhan","year":"2021","journal-title":"arXiv:2106.10765"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518188"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033513"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174130"},{"volume-title":"Combinatorial Optimization: Exact and Approximate Algorithms","year":"2011","author":"Trevisan","key":"ref38"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01651330"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(77)90027-0"},{"volume-title":"Encyclopedia of Mathematics","year":"2022","author":"Fishburn","key":"ref41"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10461668\/10499967-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10461668\/10499967.pdf?arnumber=10499967","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:05:49Z","timestamp":1736543149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10499967\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3386182","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2024]]}}}