{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T04:19:29Z","timestamp":1775708369658,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/lsp.2013.2285579","type":"journal-article","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T18:47:36Z","timestamp":1381862856000},"page":"1223-1226","source":"Crossref","is-referenced-by-count":54,"title":["Exact Reconstruction Analysis of Log-Sum Minimization for Compressed Sensing"],"prefix":"10.1109","volume":"20","author":[{"given":"Yanning","family":"Shen","sequence":"first","affiliation":[]},{"given":"Jun","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Hongbin","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/78.738251"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366823"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2007.898300"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.09.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864420"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"2183","DOI":"10.1109\/TIT.2009.2016018","article-title":"Sharp thresholds for high-dimensional and noisy sparsity recovery using <formula formulatype=\"inline\"><tex Notation=\"TeX\">${\\ell _1}$<\/tex><\/formula>-constrained quadratic programming (lasso)","volume":"55","author":"wainwright","year":"2009","journal-title":"IEEE Trans Inf Theory"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"cand\ufffds","year":"2008","journal-title":"Comptes Rendus de l?Academie des Sciences"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.119732"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042413"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/97\/6615960\/06631489.pdf?arnumber=6631489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:32:10Z","timestamp":1642005130000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6631489\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":14,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2013.2285579","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}