{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:10Z","timestamp":1773378010278,"version":"3.50.1"},"reference-count":33,"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.9834693","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"3138-3143","source":"Crossref","is-referenced-by-count":1,"title":["Sketching sparse low-rank matrices with near-optimal sample- and time-complexity"],"prefix":"10.1109","author":[{"given":"Xiaoqi","family":"Liu","sequence":"first","affiliation":[{"name":"University of Cambridge,UK"}]},{"given":"Ramji","family":"Venkataramanan","sequence":"additional","affiliation":[{"name":"University of Cambridge,UK"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834693"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref13","article-title":"Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements","author":"candes","year":"2010"},{"key":"ref14","article-title":"Adaptive sparse reduced-rank regression","author":"ma","year":"2014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2401574"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383810"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2391251"},{"key":"ref28","article-title":"An active learning framework using sparse-graph codes for sparse polynomials and graph sketching","volume":"28","author":"li","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447061"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2784479"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2864276"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1201\/b18401"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.68"},{"key":"ref7","first-page":"7821","article-title":"Community structure in social and biological networks","volume":"99","author":"girvan","year":"0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2466601"},{"key":"ref9","article-title":"Estimation of simultaneously sparse and low rank matrices","author":"richard","year":"2012","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2921757"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746568"},{"key":"ref22","article-title":"SPRIGHT: A fast and robust framework for sparse Walsh-Hadamard transform","author":"li","year":"2015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447167"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282921"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2404441"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693287"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875185"}],"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\/09834693.pdf?arnumber=9834693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:53Z","timestamp":1773347753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834693","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}