{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:38:03Z","timestamp":1778852283153,"version":"3.51.4"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100010218","name":"Department of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010218","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Engineering Research Board, Government of India"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.2997180","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T22:11:02Z","timestamp":1590444662000},"page":"3834-3848","source":"Crossref","is-referenced-by-count":11,"title":["Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0087-9900","authenticated-orcid":false,"given":"Shantanu Prasad","family":"Burnwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1057-1942","authenticated-orcid":false,"given":"Mathukumalli","family":"Vidyasagar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.87"},{"key":"ref33","author":"davidoff","year":"2003","journal-title":"Elementary Number Theory Group Theory and Ramanujan Graphs"},{"key":"ref32","first-page":"1","article-title":"Ramanjuan graphs","volume":"18","author":"murty","year":"2003","journal-title":"J Ramanujan Math Soc"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2827299"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1267"},{"key":"ref37","article-title":"Deterministic completion of rectangular matrices using Ramanujan bigraphs—II: Explicit constructions and phase transitions","author":"burnwal","year":"2019","journal-title":"arXiv 1910 03937v1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0109"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90112-F"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343623"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3390\/e20030171"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00129684"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2780983"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2537145"},{"key":"ref21","article-title":"Deterministic completion of rectangular matrices using ramanujan bigraphs – i: Error bounds and exact recovery using asymmetric Ramanujan graphs","author":"burnwal","year":"2019","journal-title":"arXiv 1908 09635"},{"key":"ref24","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835403"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1306110110"},{"key":"ref51","article-title":"Universal matrix completion","author":"bhojanapalli","year":"2014","journal-title":"arxiv 1402 2324v2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02126799"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2001.945730"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref15","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20483"},{"key":"ref17","first-page":"1881","article-title":"Universal matrix completion","author":"bhojanapalli","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref18","first-page":"1","article-title":"Fundamental conditions for low-cp-rank tensor completion","volume":"18","author":"ashraphijuo","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref19","first-page":"1391","article-title":"The algebraic combinatorial approach for low-rank matrix completion","volume":"16","author":"kir\u00e1ly","year":"2015","journal-title":"Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.90.144504"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.100401"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2015.18"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/9\/095022"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref7","first-page":"1638","article-title":"Universal low-rank matrix recovery from pauli measurements","author":"liu","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1222"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283053"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045630"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2239356"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0502258102"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2009.0152"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00600-0"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09099454.pdf?arnumber=9099454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:40:39Z","timestamp":1651070439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9099454\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2997180","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}