{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:23Z","timestamp":1773378143546,"version":"3.50.1"},"reference-count":26,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834816","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1617-1622","source":"Crossref","is-referenced-by-count":0,"title":["A Perturbation Bound on the Subspace Estimator from Canonical Projections"],"prefix":"10.1109","author":[{"given":"Karan","family":"Srivastava","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison,Wisconsin Institute for Discovery,Department of Mathematics, Department of Biostatistics"}]},{"given":"Daniel","family":"Pimentel-Alarc\u00f3n","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Wisconsin Institute for Discovery,Department of Mathematics, Department of Biostatistics"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref12","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","first-page":"2193","article-title":"Mixture matrix completion","volume":"31","author":"pimentel-alarcon","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262820"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323448"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006708"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006584"},{"key":"ref18","first-page":"1","article-title":"Fundamental conditions for low-cp-rank tensor completion","volume":"18","author":"ashraphijuo","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3389\/fevo.2020.00084"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkw1070"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1006813"},{"key":"ref8","first-page":"1907","article-title":"Preference completion: Large-scale collaborative ranking from pairwise comparisons","author":"park","year":"2015","journal-title":"International Conference on Machine Learning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0099-z"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/15M1054201"},{"key":"ref9","article-title":"High rank matrix completion and subspace clustering with missing data","author":"balzano","year":"2012","journal-title":"Proceedings of the Conference on Artificial Intelligence and Statistics (AIStats)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282844"},{"key":"ref20","first-page":"802","article-title":"The information-theoretic requirements of subspace clustering with missing data","author":"pimentel-alarcon","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref22","article-title":"Deterministic and probabilistic conditions for finite completability of low rank tensor","volume":"1612","author":"ashraphijuo","year":"2016"},{"key":"ref21","article-title":"Deterministic and probabilistic conditions for finite completability of low-rank multi-view data","author":"ashraphijuo","year":"2017"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2780983"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/17-EJS1377SI"},{"key":"ref26","first-page":"1837","article-title":"Distributions of angles in random packing on spheres","volume":"14","author":"cai","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-012-0058-0"}],"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\/09834816.pdf?arnumber=9834816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:30Z","timestamp":1773347790000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834816","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}