{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FFC7ZSNW3HUVQEJYDMIPMNLMW4","short_pith_number":"pith:FFC7ZSNW","schema_version":"1.0","canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","source":{"kind":"arxiv","id":"1305.0870","version":2},"attestation_state":"computed","paper":{"title":"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MM","math.IT"],"primary_cat":"cs.DS","authors_text":"Kannan Ramchandran, Sameer Pawar","submitted_at":"2013-05-04T02:54:59Z","abstract_excerpt":"Given an $n$-length input signal $\\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\\mbf{X}$, can be computed in $O(n \\log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\\mbf{X}$ is exactly $k$-sparse (where $k<<n$), can we do better? We show that asymptotically in $k$ and $n$, when $k$ is sub-linear in $n$ (precisely, $k \\propto n^{\\delta}$ where $0 < \\delta <1$), and the support of the non-zero DFT coefficients is uniformly random, we can exploit this sparsity in two fundamental ways (i) {\\bf {sample complexity}}: we need only $M=rk$ deterministica"},"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":"1305.0870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-04T02:54:59Z","cross_cats_sorted":["cs.IT","cs.MM","math.IT"],"title_canon_sha256":"6b85265ae96ef89a195a2e36406871af1065aaddbe42c4cb01142820814f9635","abstract_canon_sha256":"44e719de03ead5410b2a153b30718366e343d52f3b7aeadcf53f583c8c0839c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:48.293801Z","signature_b64":"0RuS6mQ6bbAkFjvFVoMWGtXXfLV9nS8+gMq5u7J3E7MoBPBe/oVP6sSSBkj8afsNlpBA6jwDIFnLE8Ny40SXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","last_reissued_at":"2026-05-18T02:28:48.293434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:48.293434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.MM","math.IT"],"primary_cat":"cs.DS","authors_text":"Kannan Ramchandran, Sameer Pawar","submitted_at":"2013-05-04T02:54:59Z","abstract_excerpt":"Given an $n$-length input signal $\\mbf{x}$, it is well known that its Discrete Fourier Transform (DFT), $\\mbf{X}$, can be computed in $O(n \\log n)$ complexity using a Fast Fourier Transform (FFT). If the spectrum $\\mbf{X}$ is exactly $k$-sparse (where $k<<n$), can we do better? We show that asymptotically in $k$ and $n$, when $k$ is sub-linear in $n$ (precisely, $k \\propto n^{\\delta}$ where $0 < \\delta <1$), and the support of the non-zero DFT coefficients is uniformly random, we can exploit this sparsity in two fundamental ways (i) {\\bf {sample complexity}}: we need only $M=rk$ deterministica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0870","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":"1305.0870","created_at":"2026-05-18T02:28:48.293492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0870v2","created_at":"2026-05-18T02:28:48.293492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0870","created_at":"2026-05-18T02:28:48.293492+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFC7ZSNW3HUV","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFC7ZSNW3HUVQEJY","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFC7ZSNW","created_at":"2026-05-18T12:27:45.050594+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/FFC7ZSNW3HUVQEJYDMIPMNLMW4","json":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4.json","graph_json":"https://pith.science/api/pith-number/FFC7ZSNW3HUVQEJYDMIPMNLMW4/graph.json","events_json":"https://pith.science/api/pith-number/FFC7ZSNW3HUVQEJYDMIPMNLMW4/events.json","paper":"https://pith.science/paper/FFC7ZSNW"},"agent_actions":{"view_html":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4","download_json":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4.json","view_paper":"https://pith.science/paper/FFC7ZSNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0870&json=true","fetch_graph":"https://pith.science/api/pith-number/FFC7ZSNW3HUVQEJYDMIPMNLMW4/graph.json","fetch_events":"https://pith.science/api/pith-number/FFC7ZSNW3HUVQEJYDMIPMNLMW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/action/storage_attestation","attest_author":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/action/author_attestation","sign_citation":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/action/citation_signature","submit_replication":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/action/replication_record"}},"created_at":"2026-05-18T02:28:48.293492+00:00","updated_at":"2026-05-18T02:28:48.293492+00:00"}