{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:55:56Z","timestamp":1773377756358,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174055","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"1271-1276","source":"Crossref","is-referenced-by-count":0,"title":["Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions"],"prefix":"10.1109","author":[{"given":"Charvi","family":"Rastogi","sequence":"first","affiliation":[{"name":"Machine Learning Department"}]},{"given":"Sivaraman","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"Department of Statistics"}]},{"given":"Nihar","family":"Shah","sequence":"additional","affiliation":[{"name":"Machine Learning Department"}]},{"given":"Aarti","family":"Singh","sequence":"additional","affiliation":[{"name":"Machine Learning Department"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Trueskill: A Bayesian skill rating system","author":"herbrich","year":"2007","journal-title":"Advances in neural information processing systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijforecast.2009.10.002"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030402"},{"key":"ref13","article-title":"Expected complexity of graph partitioning problems","volume":"57","author":"ku?era","year":"1995","journal-title":"Discrete Appl Math"},{"key":"ref14","article-title":"Making WHOOPPEE: A collaborative approach to creating the modern student peer assessment ecosystem","author":"lamon","year":"2016","journal-title":"Educause"},{"key":"ref15","article-title":"Testing statistical hypotheses","author":"lehmann","year":"2005","journal-title":"Springer Texts in Statistics"},{"key":"ref16","author":"luce","year":"1959","journal-title":"Individual Choice Behavior A Theoretical Analysis"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/18-EJS1437"},{"key":"ref18","article-title":"Iterative ranking from pair-wise comparisons","author":"negahban","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref19","article-title":"Loss functions, axioms, and peer review","author":"noothigattu","year":"2018","journal-title":"arXiv preprint arXiv 1808 09074"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/080734066"},{"key":"ref4","article-title":"Minimax rate of testing in sparse linear regression","author":"carpentier","year":"2018","journal-title":"arXiv 1804 06494"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/151002526"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/39.3-4.324"},{"key":"ref6","first-page":"371","article-title":"Spectral MLE: Top-k rank aggregation from pairwise comparisons","author":"chen","year":"2015","journal-title":"ICML"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/87"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9876.2012.01046.x"},{"key":"ref8","author":"good","year":"2013","journal-title":"Permutation Tests A Practical Guide to Resampling Methods for Testing Hypotheses"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1432"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOAS1155SF"},{"key":"ref9","article-title":"Active ranking from pairwise comparisons and when parametric assumptions don't help","author":"heckel","year":"2016","journal-title":"arXiv 1606 08842"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/17-STS628"},{"key":"ref20","first-page":"118","article-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","author":"rajkumar","year":"2014","journal-title":"ICML"},{"key":"ref22","article-title":"Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence","volume":"17","author":"shah","year":"2016","journal-title":"JMLR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623654"},{"key":"ref24","first-page":"19","article-title":"Design and analysis of the NIPS 2016 review process","author":"shah","year":"2018","journal-title":"JMLR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634418"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1037\/h0070288"},{"key":"ref25","first-page":"1","article-title":"Simple, robust and optimal ranking from pairwise comparisons","volume":"18","author":"shah","year":"2018","journal-title":"JMLR"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174055.pdf?arnumber=9174055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:04Z","timestamp":1773347704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174055\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174055","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}