{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T23:12:19Z","timestamp":1771369939329,"version":"3.50.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Laboratoirede l\u00bfInformatique du Parall\u00e9lisme"},{"name":"Centre National de la Recherche Scientifique, Universit\u00e9 Claude Bernard Lyon 1, Villeurbanne, France"},{"name":"Institut National de Recherche en Informatique et Automatique, Le Chesnay Cedex, France"},{"name":"\u00c9cole Normale Sup\u00e9rieure de Lyon, Lyon, France"},{"name":"Universit\u00e9 de Lyon, Lyon"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/tit.2014.2331341","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T20:17:59Z","timestamp":1403209079000},"page":"4999-5006","source":"Crossref","is-referenced-by-count":24,"title":["Hidden Cliques and the Certification of the Restricted Isometry Property"],"prefix":"10.1109","volume":"60","author":[{"given":"Pascal","family":"Koiran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Zouzias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"pfetsch","year":"2012","journal-title":"The computational complexity of the restricted isometry property the nullspace property and related concepts in compressed sensing"},{"key":"ref11","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019aspremont","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0416-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0417-z"},{"key":"ref14","author":"alon","year":"2011","journal-title":"Inapproximability of densest \\(\\kappa \\) -subgraph from average-case hardness"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250863"},{"key":"ref16","author":"koiran","year":"2011","journal-title":"On the certification of the restricted isometry property"},{"key":"ref17","author":"tao","year":"2007","journal-title":"Open question Deterministic UUP matrices"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2248414"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1995.1005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref6","first-page":"637","article-title":"Breaking the \\(k^{2}\\) barrier for explicit RIP matrices","author":"bourgain","year":"2011","journal-title":"Proc Symp Theory of Computing (STOC)"},{"key":"ref5","author":"bourgain","year":"2010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89575"},{"key":"ref7","first-page":"251","article-title":"The diameters of octahedra","volume":"30","author":"kashin","year":"1975","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.crma.2008.03.014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090766991"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-013-9293-2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF02785860"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6851961\/06837515.pdf?arnumber=6837515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:16:01Z","timestamp":1642004161000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6837515\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":24,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2331341","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}