{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T15:59:41Z","timestamp":1781798381406,"version":"3.54.5"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"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":["CIF-1513883"],"award-info":[{"award-number":["CIF-1513883"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CIF-1719133"],"award-info":[{"award-number":["CIF-1719133"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/tit.2021.3096555","type":"journal-article","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T20:54:03Z","timestamp":1626123243000},"page":"5731-5748","source":"Crossref","is-referenced-by-count":12,"title":["Low Complexity Sequential Search With Size-Dependent Measurement Noise"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4220-2327","authenticated-orcid":false,"given":"Sung-En","family":"Chiu","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7112-1043","authenticated-orcid":false,"given":"Tara","family":"Javidi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of California, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2238605"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874866"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/DSP.2009.4786013"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/120861898"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2385033"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104992"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321552"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2549043"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2883604"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/biom.12589"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914345"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2401004"},{"key":"ref32","article-title":"Noisy adaptive group testing using Bayesian sequential experimental design","author":"cuturi","year":"2020","journal-title":"arXiv 2004 12508"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1144"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2933967"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869669"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2850751"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437681"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178156"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834103"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447165"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169298"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282599"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970834"},{"key":"ref26","article-title":"Resolution limits of noisy non-adaptive 20 questions estimation","author":"zhou","year":"2019","journal-title":"arXiv 2101 06843"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2775614"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"ref20","first-page":"2128","article-title":"Active learning from imperfect labelers","author":"yan","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref41","first-page":"221","article-title":"Sequential measurement-dependent noisy search","author":"chiu","year":"2016","journal-title":"Proc IEEE Inf Theory Workshop (ITW)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2387857"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2014.2334278"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620712"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481257"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310477"},{"key":"ref8","first-page":"221","article-title":"The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well)","author":"or","year":"2008","journal-title":"Proc IEEE Ann Symp Foundations of Computer Science (FOCS)"},{"key":"ref7","first-page":"881","article-title":"Noisy binary search and its applications","author":"karp","year":"2007","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620429"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"key":"ref3","article-title":"Information-directed random walk for rare event detection in hierarchical processes","author":"wang","year":"2018","journal-title":"arXiv 1612 09067"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167129"},{"key":"ref5","first-page":"51","article-title":"An interval estimation problem for controlled observations","volume":"10","author":"burnashev","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8594163"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9523437\/9481252-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9523437\/09481252.pdf?arnumber=9481252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,14]],"date-time":"2023-03-14T20:37:59Z","timestamp":1678826279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9481252\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":42,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3096555","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}