{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:15Z","timestamp":1760245035269},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010,1]]},"DOI":"10.1109\/lsp.2009.2032489","type":"journal-article","created":{"date-parts":[[2009,9,18]],"date-time":"2009-09-18T17:53:06Z","timestamp":1253296386000},"page":"40-42","source":"Crossref","is-referenced-by-count":17,"title":["Linear Systems, Sparse Solutions, and Sudoku"],"prefix":"10.1109","volume":"17","author":[{"given":"P.","family":"Babu","sequence":"first","affiliation":[]},{"given":"K.","family":"Pelckmans","sequence":"additional","affiliation":[]},{"given":"P.","family":"Stoica","sequence":"additional","affiliation":[]},{"family":"Jian Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450037906X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013004"},{"key":"ref10","year":"0"},{"key":"ref6","author":"zhang","year":"2005","journal-title":"A Simple Proof for Recoverability of L1-Minimization Go Over or Under?"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref8","author":"huckvale","year":"2005","journal-title":"The Big Book of Su Doku"},{"key":"ref7","author":"grant","year":"0","journal-title":"CVX MATLAB Software for Disciplined Convex Programming"},{"key":"ref2","article-title":"an integer programming model for the sudoku problem","volume":"8","author":"bartlett","year":"2008","journal-title":"J Online Math Applicat"},{"key":"ref9","year":"0"},{"key":"ref1","year":"2009","journal-title":"Algorithmics of SudokuWikipedia The Free Encyclopedia"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/97\/5263912\/05247059.pdf?arnumber=5247059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:58:51Z","timestamp":1633910331000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5247059\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":11,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lsp.2009.2032489","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"value":"1070-9908","type":"print"},{"value":"1558-2361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]}}}