{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:01:58Z","timestamp":1770062518193,"version":"3.49.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CAREER Award","award":["DMS-1847590"],"award-info":[{"award-number":["DMS-1847590"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1934931"],"award-info":[{"award-number":["CCF-1934931"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS-2112988"],"award-info":[{"award-number":["DMS-2112988"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3167603","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T20:20:07Z","timestamp":1650313207000},"page":"5374-5390","source":"Crossref","is-referenced-by-count":7,"title":["SDP Achieves Exact Minimax Optimality in Phase Synchronization"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8627-9011","authenticated-orcid":false,"given":"Chao","family":"Gao","sequence":"first","affiliation":[{"name":"Department of Statistics, The University of Chicago, Chicago, IL, USA"}]},{"given":"Anderson Y.","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Statistics and Data Science, University of Pennsylvania, Philadelphia, PA, USA"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932678"},{"key":"ref10","article-title":"Statistical and computational guarantees of Lloyd’s algorithm and its variants","author":"lu","year":"2016","journal-title":"arXiv 1612 02099"},{"key":"ref11","article-title":"Iterative algorithm for discrete structure recovery","author":"gao","year":"2019","journal-title":"arXiv 1911 01018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2966438"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1523097113"},{"key":"ref15","article-title":"The mixing method: Low-rank coordinate descent for semidefinite programming with diagonal constraints","author":"wang","year":"2017","journal-title":"arXiv 1706 00476"},{"key":"ref16","article-title":"Convergence rate of block-coordinate maximization Burer–Monteiro method for solving large SDPs","author":"erdogdu","year":"2018","journal-title":"arXiv 1807 04428"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1428"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0707001"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-016-9341-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOP1025"},{"key":"ref4","first-page":"2132","article-title":"Multi-frequency phase synchronization","volume":"97","author":"gao","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1214\/14-AOS1274","article-title":"Consistency of spectral clustering in stochastic block models","volume":"43","author":"lei","year":"2015","journal-title":"Ann Statist"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1059-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112712"},{"key":"ref29","first-page":"5602","article-title":"Optimal estimation and completion of matrices with biclustering structures","volume":"17","author":"gao","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/17M1122025"},{"key":"ref8","article-title":"Solving orthogonal group synchronization via convex and low-rank optimization: Tightness and landscape analysis","author":"ling","year":"2020","journal-title":"arXiv 2006 00902"},{"key":"ref7","article-title":"Open problem: Tightness of maximum likelihood semidefinite relaxations","author":"bandeira","year":"2014","journal-title":"arXiv 1404 2655"},{"key":"ref2","article-title":"Group synchronization on grids","author":"abbe","year":"2017","journal-title":"arXiv 1706 08561"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/16M105808X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.02.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1854"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2594812"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2546280"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1545"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2017.8024399"},{"key":"ref26","article-title":"Convex relaxation methods for community detection","author":"li","year":"2018","journal-title":"arXiv 1810 00315"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1595"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9829223\/9759325-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09759325.pdf?arnumber=9759325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T21:24:32Z","timestamp":1661808272000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9759325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":30,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3167603","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}