{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:35Z","timestamp":1773378155907,"version":"3.50.1"},"reference-count":39,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834449","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2409-2414","source":"Crossref","is-referenced-by-count":1,"title":["The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs"],"prefix":"10.1109","author":[{"given":"Adel","family":"Elmahdy","sequence":"first","affiliation":[{"name":"University of Minnesota,ECE"}]},{"given":"Junhyung","family":"Ahn","sequence":"additional","affiliation":[{"name":"KAIST,EE"}]},{"given":"Soheil","family":"Mohajer","sequence":"additional","affiliation":[{"name":"University of Minnesota,ECE"}]},{"given":"Changho","family":"Suh","sequence":"additional","affiliation":[{"name":"KAIST,EE"}]}],"member":"263","reference":[{"key":"ref39","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":"The Annals of Statistics"},{"key":"ref38","first-page":"391","article-title":"Stochastic block model and community detection in sparse graphs: A spectral algorithm with optimal rate of recovery","author":"chin","year":"0"},{"key":"ref33","article-title":"On the fundamental limits of matrix completion: Leveraging hierarchical similarity graphs","author":"ahn","year":"2021"},{"key":"ref32","article-title":"Matrix completion with hierarchical graph side information","volume":"33","author":"elmahdy","year":"2020","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.47"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2016.2634322"},{"key":"ref37","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","author":"ng","year":"2002","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref35","first-page":"1980","article-title":"Achieving optimal misclassification proportion in stochastic block models","volume":"18","author":"gao","year":"2017","journal-title":"J Machine Learning Research (JMLR)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2490670"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9153"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.74"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7952911"},{"key":"ref13","first-page":"121","article-title":"Controversial users demand local trust metrics: An experimental study on epinions. com community","author":"massa","year":"2005","journal-title":"AAAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CCNC.2006.1593032"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639745"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.192"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365969"},{"key":"ref19","first-page":"3697","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","author":"monti","year":"2017","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133547"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864736"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178017"},{"key":"ref3","first-page":"1548","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"cai","year":"2010","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935877"},{"key":"ref29","first-page":"6446","article-title":"Community detection and stochastic block models: recent developments","volume":"18","author":"abbe","year":"2017","journal-title":"J Machine Learning Research (JMLR)"},{"key":"ref5","article-title":"Relation regularized matrix factorization","author":"li","year":"2009","journal-title":"Twenty-First International Joint Conference on Artificial Intelligence (IJCAI)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458205"},{"key":"ref7","article-title":"Matrix completion on graphs","author":"kalofolias","year":"2014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-013-0141-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571978"},{"key":"ref20","article-title":"Graph convolutional matrix completion","author":"berg","year":"2017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636058"},{"key":"ref21","first-page":"4272","article-title":"Binary rating estimation with graph side information","author":"ahn","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref24","article-title":"Discrete-valued preference estimation with graph side information","author":"jo","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3052033"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"}],"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\/09834449.pdf?arnumber=9834449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:34Z","timestamp":1773347794000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834449\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834449","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}