{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DVL5GFPMHACBNHHHWFKHL5JPJL","short_pith_number":"pith:DVL5GFPM","canonical_record":{"source":{"id":"1604.00845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a28340e0dd114db523f32213f702c0b4bc4f11417bdd2f244d667462f146f04","abstract_canon_sha256":"e58a7beed02ad52b062f760543954460a8e020b99f8ca52acf787923abf47dd9"},"schema_version":"1.0"},"canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","source":{"kind":"arxiv","id":"1604.00845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00845","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00845v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00845","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"DVL5GFPMHACB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVL5GFPMHACBNHHH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVL5GFPM","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DVL5GFPMHACBNHHHWFKHL5JPJL","target":"record","payload":{"canonical_record":{"source":{"id":"1604.00845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a28340e0dd114db523f32213f702c0b4bc4f11417bdd2f244d667462f146f04","abstract_canon_sha256":"e58a7beed02ad52b062f760543954460a8e020b99f8ca52acf787923abf47dd9"},"schema_version":"1.0"},"canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.045215Z","signature_b64":"Vgf8WevdjtCMIaMApLmKsSlkKCdMmZf6l6EPZ3bFgs4CHsSd+kOVk0fq/csbPxpki+ZFns4/UuhbMyAI0Rj3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","last_reissued_at":"2026-05-18T01:17:48.044365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.044365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.00845","source_version":1,"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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ESdI+sTlR3HzCT0CEwMpDCem2Sj9PcdxC6A4LcWzN2G8vZ7p1BTD1V2WMQTuGh5XjmVnVCdVc4bI5MmZlbVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:44:13.805484Z"},"content_sha256":"e6aa12661742012cd3dd1f21ee3623442721b3dc1c8d728bc30bbba14608fa02","schema_version":"1.0","event_id":"sha256:e6aa12661742012cd3dd1f21ee3623442721b3dc1c8d728bc30bbba14608fa02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DVL5GFPMHACBNHHHWFKHL5JPJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Fourier Transform in Any Constant Dimension with Nearly-Optimal Sample Complexity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2016-04-04T13:19:57Z","abstract_excerpt":"We consider the problem of computing a $k$-sparse approximation to the Fourier transform of a length $N$ signal. Our main result is a randomized algorithm for computing such an approximation (i.e. achieving the $\\ell_2/\\ell_2$ sparse recovery guarantees using Fourier measurements) using $O_d(k\\log N\\log\\log N)$ samples of the signal in time domain that runs in time $O_d(k\\log^{d+3} N)$, where $d\\geq 1$ is the dimensionality of the Fourier transform. The sample complexity matches the lower bound of $\\Omega(k\\log (N/k))$ for non-adaptive algorithms due to \\cite{DIPW} for any $k\\leq N^{1-\\delta}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00845","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"},"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-18T01:17:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AxtlFBsNdV1MC3XGunBLLzdaHV+zMklUaavwXTnbTGQFUoIvsqY4IEaH/hurXD8fozbaKu8dXMLsNIRsJFZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:44:13.806168Z"},"content_sha256":"781578b2fe42781a62a031a9178d0ab979675366043532ca4c87000b07ebeb73","schema_version":"1.0","event_id":"sha256:781578b2fe42781a62a031a9178d0ab979675366043532ca4c87000b07ebeb73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/bundle.json","state_url":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/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-25T18:44:13Z","links":{"resolver":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL","bundle":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/bundle.json","state":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DVL5GFPMHACBNHHHWFKHL5JPJL","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":"e58a7beed02ad52b062f760543954460a8e020b99f8ca52acf787923abf47dd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","title_canon_sha256":"3a28340e0dd114db523f32213f702c0b4bc4f11417bdd2f244d667462f146f04"},"schema_version":"1.0","source":{"id":"1604.00845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00845","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00845v1","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00845","created_at":"2026-05-18T01:17:48Z"},{"alias_kind":"pith_short_12","alias_value":"DVL5GFPMHACB","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVL5GFPMHACBNHHH","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVL5GFPM","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:781578b2fe42781a62a031a9178d0ab979675366043532ca4c87000b07ebeb73","target":"graph","created_at":"2026-05-18T01:17: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":"We consider the problem of computing a $k$-sparse approximation to the Fourier transform of a length $N$ signal. Our main result is a randomized algorithm for computing such an approximation (i.e. achieving the $\\ell_2/\\ell_2$ sparse recovery guarantees using Fourier measurements) using $O_d(k\\log N\\log\\log N)$ samples of the signal in time domain that runs in time $O_d(k\\log^{d+3} N)$, where $d\\geq 1$ is the dimensionality of the Fourier transform. The sample complexity matches the lower bound of $\\Omega(k\\log (N/k))$ for non-adaptive algorithms due to \\cite{DIPW} for any $k\\leq N^{1-\\delta}$","authors_text":"Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","title":"Sparse Fourier Transform in Any Constant Dimension with Nearly-Optimal Sample Complexity in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00845","kind":"arxiv","version":1},"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:e6aa12661742012cd3dd1f21ee3623442721b3dc1c8d728bc30bbba14608fa02","target":"record","created_at":"2026-05-18T01:17: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":"e58a7beed02ad52b062f760543954460a8e020b99f8ca52acf787923abf47dd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","title_canon_sha256":"3a28340e0dd114db523f32213f702c0b4bc4f11417bdd2f244d667462f146f04"},"schema_version":"1.0","source":{"id":"1604.00845","kind":"arxiv","version":1}},"canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","first_computed_at":"2026-05-18T01:17:48.044365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:48.044365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vgf8WevdjtCMIaMApLmKsSlkKCdMmZf6l6EPZ3bFgs4CHsSd+kOVk0fq/csbPxpki+ZFns4/UuhbMyAI0Rj3CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:48.045215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6aa12661742012cd3dd1f21ee3623442721b3dc1c8d728bc30bbba14608fa02","sha256:781578b2fe42781a62a031a9178d0ab979675366043532ca4c87000b07ebeb73"],"state_sha256":"97bbecd034df43b2e128a31b877027d99929cd3a1a8d2e5b0106c4ea80f03098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXZeDwgB4SvThN/l7aQHPhtQYurwJPJCIEwWXffZXhZbAGOsoOSvEds+XaCyiA1AP1k8ajjK+dT8XaL4x+sYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:44:13.810118Z","bundle_sha256":"bf159bc5a225bbffd4b760646d9ab5bba7a1680b3c86d6d0c3ac711d164faf12"}}