{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T04:00:06Z","timestamp":1784001606910,"version":"3.55.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ONR-MURI","award":["DOD-002888"],"award-info":[{"award-number":["DOD-002888"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-14-1-0016"],"award-info":[{"award-number":["FA9550-14-1-0016"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CIF-31712-23800"],"award-info":[{"award-number":["CIF-31712-23800"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ONR MURI","award":["N00014-11-1-0688"],"award-info":[{"award-number":["N00014-11-1-0688"]}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research Ph.D. Fellowship","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1109\/tit.2016.2634418","type":"journal-article","created":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T19:48:51Z","timestamp":1480621731000},"page":"934-959","source":"Crossref","is-referenced-by-count":36,"title":["Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5158-9677","authenticated-orcid":false,"given":"Nihar B.","family":"Shah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivaraman","family":"Balakrishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adityanand","family":"Guntuboyina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"Efficient ranking from pairwise comparisons","author":"wauthier","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman’s footrule as a measure of disarray","volume":"39","author":"diaconis","year":"1977","journal-title":"J Roy Statist Soc Series B (Methodol )"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/132","volume":"132","author":"tao","year":"2012","journal-title":"Topics in Random Matrix Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/009117905000000044"},{"key":"ref31","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2323359"},{"key":"ref36","author":"kolokolnikov","year":"2014","journal-title":"Algebraic Connectivity of Erdös-Rényi Graphs Near the Connectivity Threshold"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"215p","DOI":"10.37236\/702","article-title":"On the spectra of general random graphs","volume":"18","author":"chung","year":"2011","journal-title":"Electron J Combinat"},{"key":"ref34","article-title":"Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges","author":"oliveira","year":"2009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0297.1997.tb00009.x"},{"key":"ref40","first-page":"371","article-title":"Spectral MLE: Top-k rank aggregation from pairwise comparisons","author":"chen","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(73)90021-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref13","first-page":"268","article-title":"Noisy sorting without resampling","author":"braverman","year":"2008","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2738-0"},{"key":"ref15","author":"marden","year":"1996","journal-title":"Analyzing and Modeling Rank Data"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS396"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250806"},{"key":"ref18","volume":"912","author":"silvapulle","year":"2011","journal-title":"Constrained Statistical Inference Order Inequality Shape Constraints"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2006.09.003"},{"key":"ref28","author":"brouwer","year":"2011","journal-title":"Spectra of Graphs"},{"key":"ref4","first-page":"2474","article-title":"Iterative ranking from pair-wise comparisons","author":"negahban","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1019160125"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1037\/h0070288"},{"key":"ref6","first-page":"2049","article-title":"Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence","volume":"17","author":"shah","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(76)90044-6"},{"key":"ref5","first-page":"1475","article-title":"Minimax-optimal inference from partial rankings","author":"hajek","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3758\/BF03343344"},{"key":"ref7","first-page":"69","article-title":"Experimental tests of a stochastic decision theory","author":"davidson","year":"1959","journal-title":"Measurement Definitions and Theories"},{"key":"ref2","author":"luce","year":"1959","journal-title":"Individual Choice Behavior A Theoretical Analysis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1037\/h0032955"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/39.3-4.324"},{"key":"ref20","article-title":"On matrix estimation under monotonicity constraints","author":"chatterjee","year":"2015"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-1-4757-2545-2_3","article-title":"Weak convergence","author":"van der vaart","year":"1996","journal-title":"Weak Convergence and Empirical Processes"},{"key":"ref21","first-page":"118","article-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","author":"rajkumar","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1120.1610"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347251"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541480"},{"key":"ref26","author":"ledoux","year":"2001","journal-title":"The Concentration of Measure Phenomenon"},{"key":"ref43","first-page":"214","article-title":"A topic modeling approach to ranking","author":"ding","year":"2015","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/050623905"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/7823065\/7763782-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7823065\/07763782.pdf?arnumber=7763782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T00:26:26Z","timestamp":1749774386000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7763782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2634418","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}