{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4LKD2G6B57WELJHNO5AIO6NICK","short_pith_number":"pith:4LKD2G6B","canonical_record":{"source":{"id":"1902.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T16:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"cdccd387e396a9cfb4bda1ea7cb0ad891736398a08ca45b8abdff708aebf22ee","abstract_canon_sha256":"0a484fea4d31535e75ea666956994ce1805a260deab1c018a03e1782214fb352"},"schema_version":"1.0"},"canonical_sha256":"e2d43d1bc1efec45a4ed77408779a8128f7f9281658d52a203d223f2e45ebb5c","source":{"kind":"arxiv","id":"1902.10633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10633","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10633v1","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10633","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"4LKD2G6B57WE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4LKD2G6B57WELJHN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4LKD2G6B","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4LKD2G6B57WELJHNO5AIO6NICK","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T16:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"cdccd387e396a9cfb4bda1ea7cb0ad891736398a08ca45b8abdff708aebf22ee","abstract_canon_sha256":"0a484fea4d31535e75ea666956994ce1805a260deab1c018a03e1782214fb352"},"schema_version":"1.0"},"canonical_sha256":"e2d43d1bc1efec45a4ed77408779a8128f7f9281658d52a203d223f2e45ebb5c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:30.348276Z","signature_b64":"SrRLPDPOq29ReBh0e9V2NFO4dR5KM0v6/HvX+BEF1JtwQilG45/LhYzLBpXsHbQXwXU7d8ydDT5pAZZ2x+ZyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d43d1bc1efec45a4ed77408779a8128f7f9281658d52a203d223f2e45ebb5c","last_reissued_at":"2026-05-17T23:52:30.347779Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:30.347779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10633","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-17T23:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4A5sLo/n7p/IEwVmB80gWjziJdV3MSD09lkkkAXnir1LGwB0eaxMmLFczVUca5sfHvyog0YYCPi8Qxix6MbQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:27:34.611359Z"},"content_sha256":"cb8330717ea60e0bd3a6e29b1ef242820c2385dd20e4c9194a0273dde0c1a4c4","schema_version":"1.0","event_id":"sha256:cb8330717ea60e0bd3a6e29b1ef242820c2385dd20e4c9194a0273dde0c1a4c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4LKD2G6B57WELJHNO5AIO6NICK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimension-independent Sparse Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ameya Velingker, Amir Zandieh, Michael Kapralov","submitted_at":"2019-02-27T16:53:56Z","abstract_excerpt":"The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime depends only on the size $N$ of the input vector, but not on the dimensionality of the input domain: FFT runs in time $O(N\\log N)$ irrespective of whether the DFT in question is on $\\mathbb{Z}_N$ or $\\mathbb{Z}_n^d$ for some $d>1$, where $N=n^d$.\n  The state of the art for Sparse FFT, i.e. the problem of computing the DFT of a signal that has at most $k$ nonz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10633","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-17T23:52:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQvgWhZ+CLTdaTwEMWERmNCdDDBhJUpesKYk/Y3pW7MrBk+DkS8AcijHYOWAm+O/w+VH+3p9qtuFG3UMflOODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:27:34.611992Z"},"content_sha256":"977d9b31e103a6921c454a0e50b2ebb15a40b525523a73acfd4f8f89fae29910","schema_version":"1.0","event_id":"sha256:977d9b31e103a6921c454a0e50b2ebb15a40b525523a73acfd4f8f89fae29910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LKD2G6B57WELJHNO5AIO6NICK/bundle.json","state_url":"https://pith.science/pith/4LKD2G6B57WELJHNO5AIO6NICK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LKD2G6B57WELJHNO5AIO6NICK/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-30T20:27:34Z","links":{"resolver":"https://pith.science/pith/4LKD2G6B57WELJHNO5AIO6NICK","bundle":"https://pith.science/pith/4LKD2G6B57WELJHNO5AIO6NICK/bundle.json","state":"https://pith.science/pith/4LKD2G6B57WELJHNO5AIO6NICK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LKD2G6B57WELJHNO5AIO6NICK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4LKD2G6B57WELJHNO5AIO6NICK","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":"0a484fea4d31535e75ea666956994ce1805a260deab1c018a03e1782214fb352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T16:53:56Z","title_canon_sha256":"cdccd387e396a9cfb4bda1ea7cb0ad891736398a08ca45b8abdff708aebf22ee"},"schema_version":"1.0","source":{"id":"1902.10633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10633","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10633v1","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10633","created_at":"2026-05-17T23:52:30Z"},{"alias_kind":"pith_short_12","alias_value":"4LKD2G6B57WE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4LKD2G6B57WELJHN","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4LKD2G6B","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:977d9b31e103a6921c454a0e50b2ebb15a40b525523a73acfd4f8f89fae29910","target":"graph","created_at":"2026-05-17T23:52:30Z","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":"The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime depends only on the size $N$ of the input vector, but not on the dimensionality of the input domain: FFT runs in time $O(N\\log N)$ irrespective of whether the DFT in question is on $\\mathbb{Z}_N$ or $\\mathbb{Z}_n^d$ for some $d>1$, where $N=n^d$.\n  The state of the art for Sparse FFT, i.e. the problem of computing the DFT of a signal that has at most $k$ nonz","authors_text":"Ameya Velingker, Amir Zandieh, Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T16:53:56Z","title":"Dimension-independent Sparse Fourier Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10633","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:cb8330717ea60e0bd3a6e29b1ef242820c2385dd20e4c9194a0273dde0c1a4c4","target":"record","created_at":"2026-05-17T23:52:30Z","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":"0a484fea4d31535e75ea666956994ce1805a260deab1c018a03e1782214fb352","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-27T16:53:56Z","title_canon_sha256":"cdccd387e396a9cfb4bda1ea7cb0ad891736398a08ca45b8abdff708aebf22ee"},"schema_version":"1.0","source":{"id":"1902.10633","kind":"arxiv","version":1}},"canonical_sha256":"e2d43d1bc1efec45a4ed77408779a8128f7f9281658d52a203d223f2e45ebb5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2d43d1bc1efec45a4ed77408779a8128f7f9281658d52a203d223f2e45ebb5c","first_computed_at":"2026-05-17T23:52:30.347779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:30.347779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrRLPDPOq29ReBh0e9V2NFO4dR5KM0v6/HvX+BEF1JtwQilG45/LhYzLBpXsHbQXwXU7d8ydDT5pAZZ2x+ZyAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:30.348276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb8330717ea60e0bd3a6e29b1ef242820c2385dd20e4c9194a0273dde0c1a4c4","sha256:977d9b31e103a6921c454a0e50b2ebb15a40b525523a73acfd4f8f89fae29910"],"state_sha256":"e3947d9a48d5942d83d3c6261990f6922f18355831ea331ec29f4dcdcaddc3d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4RbwBJTedz9LEXhsoynZK55qdjjdORyf8zrIsrSwJWQFwpZcOYWPMKLEMDvsQUxpmj8K5grRLUtnLs4DlCNBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:27:34.615065Z","bundle_sha256":"ecd0c4867741f334ff20ff3758cec12821c6384fe6d0687dd9981039bf4fa11e"}}