{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:10Z","timestamp":1773377890978,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834370","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2541-2546","source":"Crossref","is-referenced-by-count":8,"title":["Noisy Sorting Capacity"],"prefix":"10.1109","author":[{"given":"Ziao","family":"Wang","sequence":"first","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4"}]},{"given":"Nadim","family":"Ghaddar","sequence":"additional","affiliation":[{"name":"University of California San Diego,La Jolla,CA,USA,92093"}]},{"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4"}]}],"member":"263","reference":[{"key":"ref32","first-page":"10 014","article-title":"On sample complexity upper and lower bounds for exact ranking from noisy comparisons","volume":"32","author":"ren","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref31","first-page":"881","article-title":"Noisy binary search and its applications","author":"karp","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104992"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"ref11","article-title":"Sorting from noisy information","author":"braverman","year":"2009"},{"key":"ref12","article-title":"Active learning ranking from pairwise preferences with almost optimal query complexity","volume":"24","author":"ailon","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref13","article-title":"Iterative ranking from pair-wise comparisons","volume":"25","author":"negahban","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref14","first-page":"109","article-title":"Efficient ranking from pairwise comparisons","volume":"28","author":"wauthier","year":"0"},{"key":"ref15","first-page":"i?118","article-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","author":"rajkumar","year":"2014","journal-title":"Proceedings of the 31st International Conference on International Conference on Machine Learning - Volume 32"},{"key":"ref16","first-page":"11","article-title":"Stochastically transitive models for pairwise comparisons: Statistical and computational issues","author":"shah","year":"2016","journal-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48"},{"key":"ref17","first-page":"821","article-title":"Minimax rates and efficient algorithms for noisy sorting","volume":"83","author":"mao","year":"0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/39.3-4.324"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_5"},{"key":"ref28","article-title":"Block coding with noiseless feedback","author":"berlekamp","year":"1964","journal-title":"Ph D thesis"},{"key":"ref4","first-page":"1088","article-title":"Maximum selection and ranking under noisy comparisons","volume":"70","author":"falahatgar","year":"0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1063\/1.3024514"},{"key":"ref3","first-page":"2488","article-title":"Active learning for top-k rank aggregation from noisy comparisons","author":"mohajer","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning - Volume 70 ser ICML’17"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1772"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"key":"ref5","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":"ref8","first-page":"51","article-title":"An interval estimation problem for controlled observations","volume":"10","author":"burnashev","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref7","first-page":"39","article-title":"Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons","volume":"65","author":"agarwal","year":"0"},{"key":"ref2","author":"ash","year":"1990","journal-title":"Information Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"ref1","volume":"3","author":"knuth","year":"1997","journal-title":"The art of computer programming"},{"key":"ref20","first-page":"371","article-title":"Spectral mle: Top-k rank aggregation from pairwise comparisons","volume":"37","author":"chen","year":"0"},{"key":"ref22","article-title":"Pac ranking from pairwise and listwise queries: Lower bounds and upper bounds","author":"ren","year":"2018"},{"key":"ref21","article-title":"Asymptotically optimal sequential design for rank aggregation","author":"chen","year":"2017","journal-title":"Math Oper Res"},{"key":"ref24","article-title":"A new active learning scheme with applications to learning to rank from pairwise preferences","author":"ailon","year":"2011"},{"key":"ref23","first-page":"2240","article-title":"Active ranking using pairwise comparisons","author":"jamieson","year":"2011","journal-title":"Proceedings of the 24th International Conference on Neural Information Processing Systems"},{"key":"ref26","first-page":"505","article-title":"On a problem of information theory","volume":"6","author":"r\u00e9nyi","year":"1961","journal-title":"MTA Mat Kut Int Kozl B"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834370"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834370.pdf?arnumber=9834370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:28Z","timestamp":1773347728000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834370","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}