{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FFC7ZSNW3HUVQEJYDMIPMNLMW4","short_pith_number":"pith:FFC7ZSNW","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"},"canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","source":{"kind":"arxiv","id":"1305.0870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0870","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0870v2","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0870","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"FFC7ZSNW3HUV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FFC7ZSNW3HUVQEJY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FFC7ZSNW","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FFC7ZSNW3HUVQEJYDMIPMNLMW4","target":"record","payload":{"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"},"canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","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"},"source_kind":"arxiv","source_id":"1305.0870","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NK7vCF7JpV8sTbFmt9FyXyx2O0R8FlPGhJVvQjraf9vCGyDOzLSFK4isIHIptV9E96kgYT9q2QEf4ODJ2VdpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:25:38.643288Z"},"content_sha256":"a751b1838f29e082fba4484b790159f7153ff104a8cde6db49b1f335473a9ea0","schema_version":"1.0","event_id":"sha256:a751b1838f29e082fba4484b790159f7153ff104a8cde6db49b1f335473a9ea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FFC7ZSNW3HUVQEJYDMIPMNLMW4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dz4JSkxv/WW1LUqOxq5wbdUYZfnX2i6Y947XXbj8Gr21cBsef9iaKnZ2LHdM7cYMvUEiiTUwkyd+EJRDJZG1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:25:38.643650Z"},"content_sha256":"32cf844471173903c9554531c325690b43aa7dfb88c772aafc0beae821c8709f","schema_version":"1.0","event_id":"sha256:32cf844471173903c9554531c325690b43aa7dfb88c772aafc0beae821c8709f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/bundle.json","state_url":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T03:25:38Z","links":{"resolver":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4","bundle":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/bundle.json","state":"https://pith.science/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFC7ZSNW3HUVQEJYDMIPMNLMW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FFC7ZSNW3HUVQEJYDMIPMNLMW4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44e719de03ead5410b2a153b30718366e343d52f3b7aeadcf53f583c8c0839c8","cross_cats_sorted":["cs.IT","cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-04T02:54:59Z","title_canon_sha256":"6b85265ae96ef89a195a2e36406871af1065aaddbe42c4cb01142820814f9635"},"schema_version":"1.0","source":{"id":"1305.0870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0870","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0870v2","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0870","created_at":"2026-05-18T02:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"FFC7ZSNW3HUV","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FFC7ZSNW3HUVQEJY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FFC7ZSNW","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:32cf844471173903c9554531c325690b43aa7dfb88c772aafc0beae821c8709f","target":"graph","created_at":"2026-05-18T02:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Kannan Ramchandran, Sameer Pawar","cross_cats":["cs.IT","cs.MM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-04T02:54:59Z","title":"Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0870","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a751b1838f29e082fba4484b790159f7153ff104a8cde6db49b1f335473a9ea0","target":"record","created_at":"2026-05-18T02:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44e719de03ead5410b2a153b30718366e343d52f3b7aeadcf53f583c8c0839c8","cross_cats_sorted":["cs.IT","cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-04T02:54:59Z","title_canon_sha256":"6b85265ae96ef89a195a2e36406871af1065aaddbe42c4cb01142820814f9635"},"schema_version":"1.0","source":{"id":"1305.0870","kind":"arxiv","version":2}},"canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2945fcc9b6d9e95811381b10f6356cb718c963ef37124a535a50e525dfa618a2","first_computed_at":"2026-05-18T02:28:48.293434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:48.293434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0RuS6mQ6bbAkFjvFVoMWGtXXfLV9nS8+gMq5u7J3E7MoBPBe/oVP6sSSBkj8afsNlpBA6jwDIFnLE8Ny40SXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:48.293801Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a751b1838f29e082fba4484b790159f7153ff104a8cde6db49b1f335473a9ea0","sha256:32cf844471173903c9554531c325690b43aa7dfb88c772aafc0beae821c8709f"],"state_sha256":"55aeea925abfc63d606ee737ea7e6f79c88acb6dd11e6a47ea9e7f8ec81c2f1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvXsibuP8tbsiGi8E67IbVpa6I7447I69Smb/JlLpobnUjf34HNyC41PWID4k9TxTQiITKqTAVVk6uSIO1NMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:25:38.645622Z","bundle_sha256":"f1af90c3265e2dcde6a4e8d97a885c71a0775572c15f2e1c88a1254eafe4652d"}}