{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:17:31Z","timestamp":1785604651646,"version":"3.56.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"crossref","award":["W911NF-17-1-0407"],"award-info":[{"award-number":["W911NF-17-1-0407"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical Communications and Cyber Systems","doi-asserted-by":"crossref","award":["1508875"],"award-info":[{"award-number":["1508875"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000149","name":"Division of Engineering Education and Centers","doi-asserted-by":"crossref","award":["1041877"],"award-info":[{"award-number":["1041877"]}],"id":[{"id":"10.13039\/100000149","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tsp.2018.2821648","type":"journal-article","created":{"date-parts":[[2018,4,2]],"date-time":"2018-04-02T18:02:58Z","timestamp":1522692178000},"page":"1-1","source":"Crossref","is-referenced-by-count":31,"title":["Low-rank Matrix Recovery from Noisy, Quantized and Erroneous Measurements"],"prefix":"10.1109","author":[{"given":"Pengzhi","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joe H.","family":"Chow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2012.553"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2011.6102322"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-013-0435-6"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SustainIT.2013.6685194"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472065"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SmartGridComm.2015.7436274"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2549040"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383813"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.29012\/jpc.v1i2.570","article-title":"Differential privacy for statistics: What we know and what we want to learn","volume":"1","author":"dwork","year":"2010","journal-title":"J Privacy Confidentiality"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2597131"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2015.2413935"},{"key":"ref18","first-page":"374","author":"gao","year":"0","journal-title":"Proc Asilomar Conf Signals Syst Comput"},{"key":"ref19","first-page":"1917","article-title":"Exponential\n family matrix completion under structural constraints","author":"gunasekar","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref28","article-title":"Operating reliability data confidentiality\n agreement, version 3","year":"2009"},{"key":"ref4","first-page":"1881","article-title":"Universal matrix completion","author":"bhojanapalli","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1878431.1878446"},{"key":"ref3","first-page":"1","article-title":"Probabilistic low-rank matrix completion from quantized\n measurements","volume":"17","author":"bhaskar","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-76537-2","author":"phadke","year":"2008","journal-title":"Synchronized Phasor Measurements and Their Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0701-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref7","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"cai","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2495171"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2015.7421187"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940794"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-016-0736-y"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1093"},{"key":"ref24","first-page":"1727","article-title":"Probabilistic low-rank matrix completion\n on finite alphabets","author":"lafond","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1638"},{"key":"ref26","first-page":"1959","article-title":"Sparse factor analysis for learning\n and content analytics","volume":"15","author":"lan","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854548"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/4359509\/08329537.pdf?arnumber=8329537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:49Z","timestamp":1649443729000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8329537\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2821648","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}