{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NB4MVOONR6M6W7Z7WAHDESDT3O","short_pith_number":"pith:NB4MVOON","schema_version":"1.0","canonical_sha256":"6878cab9cd8f99eb7f3fb00e324873dbb75c457c1914078dc2e5f34ae7a6f598","source":{"kind":"arxiv","id":"1507.01768","version":2},"attestation_state":"computed","paper":{"title":"The Restricted Isometry Property of Subsampled Fourier Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Ishay Haviv, Oded Regev","submitted_at":"2015-07-07T11:59:52Z","abstract_excerpt":"A matrix $A \\in \\mathbb{C}^{q \\times N}$ satisfies the restricted isometry property of order $k$ with constant $\\varepsilon$ if it preserves the $\\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\\pm \\varepsilon$. We prove that a matrix $A$ obtained by randomly sampling $q = O(k \\cdot \\log^2 k \\cdot \\log N)$ rows from an $N \\times N$ Fourier matrix satisfies the restricted isometry property of order $k$ with a fixed $\\varepsilon$ with high probability. This improves on Rudelson and Vershynin (Comm. Pure Appl. Math., 2008), its subsequent improvements, and Bourgain (GAFA Seminar Notes,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1507.01768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T11:59:52Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"48a9bd877179aaefdc63164e4e1e86e20ca08ebb6f1e80f81444c73ac59ed5e8","abstract_canon_sha256":"3ca6bfa476c8639b52766cc506b392ba43dd1d5874a85df2b4dc46ef63fbfdd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:23.824999Z","signature_b64":"Kj4MwTnvJSrhEZ5Dc8bXlDPk4t3lIdVd5g5XwJ5xqlwYcLKLlLNh6ljJCYcni/aT1todqUaEo+Q6FR2to5McCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6878cab9cd8f99eb7f3fb00e324873dbb75c457c1914078dc2e5f34ae7a6f598","last_reissued_at":"2026-05-18T01:30:23.824189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:23.824189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Restricted Isometry Property of Subsampled Fourier Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.DS","authors_text":"Ishay Haviv, Oded Regev","submitted_at":"2015-07-07T11:59:52Z","abstract_excerpt":"A matrix $A \\in \\mathbb{C}^{q \\times N}$ satisfies the restricted isometry property of order $k$ with constant $\\varepsilon$ if it preserves the $\\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\\pm \\varepsilon$. We prove that a matrix $A$ obtained by randomly sampling $q = O(k \\cdot \\log^2 k \\cdot \\log N)$ rows from an $N \\times N$ Fourier matrix satisfies the restricted isometry property of order $k$ with a fixed $\\varepsilon$ with high probability. This improves on Rudelson and Vershynin (Comm. Pure Appl. Math., 2008), its subsequent improvements, and Bourgain (GAFA Seminar Notes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01768","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01768","created_at":"2026-05-18T01:30:23.824306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01768v2","created_at":"2026-05-18T01:30:23.824306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01768","created_at":"2026-05-18T01:30:23.824306+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB4MVOONR6M6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB4MVOONR6M6W7Z7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB4MVOON","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O","json":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O.json","graph_json":"https://pith.science/api/pith-number/NB4MVOONR6M6W7Z7WAHDESDT3O/graph.json","events_json":"https://pith.science/api/pith-number/NB4MVOONR6M6W7Z7WAHDESDT3O/events.json","paper":"https://pith.science/paper/NB4MVOON"},"agent_actions":{"view_html":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O","download_json":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O.json","view_paper":"https://pith.science/paper/NB4MVOON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01768&json=true","fetch_graph":"https://pith.science/api/pith-number/NB4MVOONR6M6W7Z7WAHDESDT3O/graph.json","fetch_events":"https://pith.science/api/pith-number/NB4MVOONR6M6W7Z7WAHDESDT3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O/action/storage_attestation","attest_author":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O/action/author_attestation","sign_citation":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O/action/citation_signature","submit_replication":"https://pith.science/pith/NB4MVOONR6M6W7Z7WAHDESDT3O/action/replication_record"}},"created_at":"2026-05-18T01:30:23.824306+00:00","updated_at":"2026-05-18T01:30:23.824306+00:00"}