{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:19:40Z","timestamp":1774941580479,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF Center for Science of Information"},{"name":"AFOSR through MURI","award":["FA9550-12-1-0215"],"award-info":[{"award-number":["FA9550-12-1-0215"]}]},{"DOI":"10.13039\/501100003621","name":"Korea Space Launch Vehicle (KSLVII) Program through the Ministry of Science, ICT and Future Planning, Korean Government","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/tit.2016.2600566","type":"journal-article","created":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T14:41:49Z","timestamp":1471358509000},"page":"5881-5905","source":"Crossref","is-referenced-by-count":20,"title":["Information Recovery From Pairwise Measurements"],"prefix":"10.1109","volume":"62","author":[{"given":"Yuxin","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3101-4291","authenticated-orcid":false,"given":"Changho","family":"Suh","sequence":"additional","affiliation":[]},{"given":"Andrea J.","family":"Goldsmith","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881731"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref33","first-page":"1","article-title":"How hard is inference for structured prediction?","author":"globerson","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","article-title":"Tight error bounds for structured prediction","author":"globerson","year":"2014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736500"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a017"},{"key":"ref37","author":"durrett","year":"2007","journal-title":"Random Graph Dynamics"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2469645"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2238935"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2235192"},{"key":"ref60","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110791"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref28","article-title":"Consistency thresholds for binary symmetric block models","author":"mossel","year":"2014"},{"key":"ref27","article-title":"Exact recovery in the stochastic block model","author":"abbe","year":"2014"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2014.2368716"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282873"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875186"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970817"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282588"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref23","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"99","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5320-4"},{"key":"ref51","article-title":"Stochastic block models and reconstruction","author":"mossel","year":"2012"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref58","article-title":"Achieving optimal misclassification proportion in stochastic block model","author":"gao","year":"2015"},{"key":"ref57","article-title":"Stochastic block model and community detection in the sparse graphs: A spectral algorithm with optimal rate of recovery","author":"chin","year":"2015"},{"key":"ref56","article-title":"Accurate community detection in the stochastic block model via spectral algorithms","author":"yun","year":"2014"},{"key":"ref55","article-title":"A generic sample splitting approach for refined community recovery in stochastic block models","author":"lei","year":"2014"},{"key":"ref54","article-title":"Random Laplacian matrices and convex relaxations","author":"bandeira","year":"2015"},{"key":"ref53","article-title":"Semidefinite programs on sparse random graphs and their application to community detection","author":"montanari","year":"2015"},{"key":"ref52","article-title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","author":"chen","year":"2014"},{"key":"ref10","article-title":"Exact and stable recovery of rotations for robust synchronization","author":"wang","year":"2012"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.850703"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554839"},{"key":"ref12","first-page":"100","article-title":"Near-optimal joint object matching via convex relaxation","author":"chen","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref13","first-page":"1860","article-title":"Solving the multi-way matching problem by permutation synchronization","author":"pachauri","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12184"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10590-1_27"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3054"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq215"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20036-6_5"},{"key":"ref19","first-page":"689","article-title":"Community recovery in graphs with locality","author":"chen","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref4","article-title":"Clustering partially observed graphs via convex optimization","author":"jalali","year":"2011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref6","article-title":"Nonconvex joint alignment","author":"chen","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346205"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539801"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993227"},{"key":"ref7","first-page":"3001","article-title":"SfM with MRFs: Discrete-continuous optimization for large-scale structure from motion","author":"crandall","year":"2011","journal-title":"Proc IEEE CVPR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/ias002"},{"key":"ref46","article-title":"Bounds among f -divergences","author":"sason","year":"2015"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066138"},{"key":"ref48","article-title":"Achieving exact cluster recovery threshold via semidefinite programming","author":"hajek","year":"2014"},{"key":"ref47","first-page":"1","article-title":"Upper and lower bounds for Csiszar f-divergence in terms of Hellinger discrimination and applications","volume":"7","author":"dragomir","year":"2002","journal-title":"Nonlinear Anal Forum"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2412945"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref43","first-page":"547","article-title":"On measures of entropy and information","volume":"1","author":"r\u00e9nyi","year":"1961","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7565673\/07544497.pdf?arnumber=7544497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:42:43Z","timestamp":1641987763000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7544497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":62,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2600566","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}