{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:51:57Z","timestamp":1730274717130,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620235","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"296-300","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds for quantized matrix completion"],"prefix":"10.1109","author":[{"given":"Mary","family":"Wootters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaniv","family":"Plan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark A.","family":"Davenport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewout","family":"van den Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"journal-title":"1-bit Matrix Completion","year":"2012","author":"davenport","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020425"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709842104"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"11","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Machine Learning Research"},{"key":"12","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Machine Learning Research"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620235.pdf?arnumber=6620235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T20:54:28Z","timestamp":1490216068000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620235\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620235","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}