{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:47:41Z","timestamp":1740181661360,"version":"3.37.3"},"reference-count":48,"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":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery","award":["RGPIN-2019-05448"],"award-info":[{"award-number":["RGPIN-2019-05448"]}]},{"name":"NSERC Collaborative Research and Development","award":["CRDPJ 54367619"],"award-info":[{"award-number":["CRDPJ 54367619"]}]},{"name":"National Science Foundation","award":["IIS-1901252","CCF-1909499"],"award-info":[{"award-number":["IIS-1901252","CCF-1909499"]}]}],"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.3396787","type":"journal-article","created":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T18:09:59Z","timestamp":1715018999000},"page":"302-313","source":"Crossref","is-referenced-by-count":0,"title":["Noisy Computing of the OR and MAX Functions"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7320-3533","authenticated-orcid":false,"given":"Banghua","family":"Zhu","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1879-6559","authenticated-orcid":false,"given":"Ziao","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0619-0920","authenticated-orcid":false,"given":"Nadim","family":"Ghaddar","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3766-8031","authenticated-orcid":false,"given":"Jiantao","family":"Jiao","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Sciences, University of California at Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4077-433X","authenticated-orcid":false,"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28425"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.79921"},{"issue":"199","key":"ref4","first-page":"1","article-title":"Simple, robust and optimal ranking from pairwise comparisons","volume":"18","author":"Shah","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref5","first-page":"39","article-title":"Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons","volume-title":"Proc. Conf. Learn. Theory","volume":"65","author":"Agarwal"},{"key":"ref6","first-page":"1088","article-title":"Maximum selection and ranking under noisy comparisons","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Falahatgar"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1772"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834370"},{"key":"ref9","article-title":"Noisy sorting capacity","author":"Wang","year":"2023","journal-title":"arXiv:2202.01446"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585131"},{"article-title":"Block coding with noiseless feedback","year":"1964","author":"Berlekamp","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"issue":"3","key":"ref13","first-page":"51","article-title":"An interval estimation problem for controlled observations","volume":"10","author":"Burnashev","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90077-7"},{"key":"ref15","first-page":"881","article-title":"Noisy binary search and its applications","volume-title":"Proc. 10th Annu. ACM-SIAM Symp. Discr Algorithms","author":"Karp"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1541880.1541882"},{"key":"ref17","first-page":"255","article-title":"Anomaly detection over noisy data using learned probability distributions","volume-title":"Proc. ICML","author":"Eskin"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref19","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"Proc. COLT","author":"Audibert"},{"key":"ref20","first-page":"1","article-title":"Optimal best arm identification with fixed confidence","volume-title":"Proc. Conf. Learn. Theory","author":"Garivier"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref22","first-page":"1","article-title":"Best arm identification: A unified approach to fixed budget and fixed confidence","volume":"25","author":"Gabillon","year":"2012","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref23","first-page":"1","article-title":"On the complexity of best arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176348115"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176350820"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173995"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/22-AOS2186"},{"key":"ref28","article-title":"Recent advances in algorithmic high-dimensional robust statistics","author":"Diakonikolas","year":"2019","journal-title":"arXiv:1911.05911"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/9781108943161"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/0471725250"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3491209"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2021.107530"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"issue":"1","key":"ref35","first-page":"82","article-title":"Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"issue":"3","key":"ref36","first-page":"56","article-title":"Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/18.312190"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796310102"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185425"},{"key":"ref41","first-page":"2488","article-title":"Active learning for top-K rank aggregation from noisy comparisons","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Mohajer"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206482"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1193342380"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535278"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10461668\/10520706-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/10461668\/10520706.pdf?arnumber=10520706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:05:55Z","timestamp":1736543155000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10520706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/jsait.2024.3396787","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2024]]}}}