{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:40:21Z","timestamp":1729647621681,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"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":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414111","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"page":"4035-4039","source":"Crossref","is-referenced-by-count":1,"title":["An Order-Optimal Adaptive Test Plan for Noisy Group Testing Under Unknown Noise Models"],"prefix":"10.1109","author":[{"given":"Sudeep","family":"Salgia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/0166-218X(90)90022-5"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1016\/0166-218X(92)90260-H"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1016\/0378-3758(85)90084-9"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TSP.2017.2780053"},{"key":"ref14","article-title":"Optimal algorithms for the coin weighing problem with a spring scale","author":"bshouty","year":"2009","journal-title":"The 22nd Conference on Learning Theory"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ALLERTON.2019.8919896"},{"year":"2019","author":"gebhard","article-title":"Quantitative group testing in the sublinear regime","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2011.09.005","article-title":"Toward a deterministic polynomial time algorithm with optimal additive query complexity","volume":"417","author":"bshouty","year":"2012","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TIT.2014.2310477"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/ICASSP.2012.6288622"},{"key":"ref4","first-page":"697","article-title":"Solution of problem e 1399","volume":"67","author":"fine","year":"1960","journal-title":"The American Mathematical Monthly"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1109\/ICASSP39728.2021.9414111","article-title":"An order-optimal adaptive test plan for noisy group testing under unknown noise models","author":"salgia","year":"2021"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.2307\/2310126"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1080\/00029890.1963.11992174"},{"key":"ref5","first-page":"229","article-title":"On two problems in information theory","volume":"8","author":"erd\u00f6s","year":"1963","journal-title":"Magyar Tud Akad Mat Kutató Int Közl"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.2307\/2322412"},{"key":"ref7","first-page":"163","article-title":"On a search model of false coins","volume":"16","author":"djackov","year":"1975","journal-title":"Topics in Information Theory (Colloquia Mathematica Societatis Janos Bolyai)"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.jcv.2020.104382"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/0166-218X(86)90026-0"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1214\/aoms\/1177731363"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/ISIT.2016.7541824"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ISIT.2018.8437667"},{"key":"ref21","first-page":"1234","article-title":"Grotesque: Noisy group testing (quick and efficient)","author":"cai","year":"2013","journal-title":"51st Annual Allerton Conference on Communication Control and Computing"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/ISIT.2017.8006677"},{"key":"ref23","article-title":"Noisy Adaptive Group Testing: Bounds and Algorithms","author":"scarlett","year":"2018","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/ALLERTON.2019.8919740"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/ICASSP.2018.8461775"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414111.pdf?arnumber=9414111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T08:31:34Z","timestamp":1672129894000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414111","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}