{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TZFUXWXWBRZTNY6BQLCDBFY4RH","short_pith_number":"pith:TZFUXWXW","schema_version":"1.0","canonical_sha256":"9e4b4bdaf60c7336e3c182c430971c89e186ce38c4336842c5700984ed61da96","source":{"kind":"arxiv","id":"1903.12146","version":1},"attestation_state":"computed","paper":{"title":"Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shravas Rao","submitted_at":"2019-03-28T17:34:10Z","abstract_excerpt":"Let $A$ be an $N \\times N$ Fourier matrix over $\\mathbb{F}_p^{\\log{N}/\\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the restricted isometry property for $k$-sparse vectors. This property states that $\\|Mv\\|_2^2$ is approximately $\\|v\\|_2^2$ for all $k$-sparse vectors $v$. In particular, if $k = \\Omega( \\log^2{N})$, we show that $\\Omega(k\\log{k}\\log{N}/\\log{p})$ rows must be sampled to satisfy the restricted isometry property with constant probability."},"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":"1903.12146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-28T17:34:10Z","cross_cats_sorted":["cs.DS","math.IT","math.PR"],"title_canon_sha256":"499811dc72be60b9a116a6d4a0ed6864a4fe1256a4b0d45a0a1210c2081d0ffc","abstract_canon_sha256":"03d2ba6e6778a27d632e8e7d89edcd024ddb99737fd560a2286980ac9fe005bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:57.920196Z","signature_b64":"fitcaQsI0TzkB78y5JZyxwhOAzmTRjW2ncMCVmbqTN0T4C2pZxrrGXMay2qqwyh6lt3fpB1Z8F+NJ81PuAmBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e4b4bdaf60c7336e3c182c430971c89e186ce38c4336842c5700984ed61da96","last_reissued_at":"2026-05-17T23:49:57.919529Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:57.919529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Shravas Rao","submitted_at":"2019-03-28T17:34:10Z","abstract_excerpt":"Let $A$ be an $N \\times N$ Fourier matrix over $\\mathbb{F}_p^{\\log{N}/\\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the restricted isometry property for $k$-sparse vectors. This property states that $\\|Mv\\|_2^2$ is approximately $\\|v\\|_2^2$ for all $k$-sparse vectors $v$. In particular, if $k = \\Omega( \\log^2{N})$, we show that $\\Omega(k\\log{k}\\log{N}/\\log{p})$ rows must be sampled to satisfy the restricted isometry property with constant probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12146","kind":"arxiv","version":1},"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":"1903.12146","created_at":"2026-05-17T23:49:57.919620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12146v1","created_at":"2026-05-17T23:49:57.919620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12146","created_at":"2026-05-17T23:49:57.919620+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZFUXWXWBRZT","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZFUXWXWBRZTNY6B","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZFUXWXW","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08362","citing_title":"Sparse Recovery for Orthogonal Polynomial Transforms","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH","json":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH.json","graph_json":"https://pith.science/api/pith-number/TZFUXWXWBRZTNY6BQLCDBFY4RH/graph.json","events_json":"https://pith.science/api/pith-number/TZFUXWXWBRZTNY6BQLCDBFY4RH/events.json","paper":"https://pith.science/paper/TZFUXWXW"},"agent_actions":{"view_html":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH","download_json":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH.json","view_paper":"https://pith.science/paper/TZFUXWXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12146&json=true","fetch_graph":"https://pith.science/api/pith-number/TZFUXWXWBRZTNY6BQLCDBFY4RH/graph.json","fetch_events":"https://pith.science/api/pith-number/TZFUXWXWBRZTNY6BQLCDBFY4RH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH/action/storage_attestation","attest_author":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH/action/author_attestation","sign_citation":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH/action/citation_signature","submit_replication":"https://pith.science/pith/TZFUXWXWBRZTNY6BQLCDBFY4RH/action/replication_record"}},"created_at":"2026-05-17T23:49:57.919620+00:00","updated_at":"2026-05-17T23:49:57.919620+00:00"}