{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JUBH4GR44WFLU7RDDALQ4Z425C","short_pith_number":"pith:JUBH4GR4","canonical_record":{"source":{"id":"1606.07407","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-23T18:56:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"50b5c1b5f9f19940e5b5d30efda569c5b7e14013b98005002f7d18cbff1cba20","abstract_canon_sha256":"1065c028419be28c1accd1661813616efda8dff382672e94f54a99963ebc17be"},"schema_version":"1.0"},"canonical_sha256":"4d027e1a3ce58aba7e2318170e679ae8bac269b974b93ceed03d83696a3be1f9","source":{"kind":"arxiv","id":"1606.07407","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07407","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07407v4","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07407","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"JUBH4GR44WFL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JUBH4GR44WFLU7RD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JUBH4GR4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JUBH4GR44WFLU7RDDALQ4Z425C","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07407","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-23T18:56:06Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"50b5c1b5f9f19940e5b5d30efda569c5b7e14013b98005002f7d18cbff1cba20","abstract_canon_sha256":"1065c028419be28c1accd1661813616efda8dff382672e94f54a99963ebc17be"},"schema_version":"1.0"},"canonical_sha256":"4d027e1a3ce58aba7e2318170e679ae8bac269b974b93ceed03d83696a3be1f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:56.879193Z","signature_b64":"3kGppW2yW5UD7SRJURYSpERma7bFj+8Sd+KpNP3YKdwA1n1bp5SEzuR4w+ZNm3w7zzhuGzh7gcAhX+KQY3mSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d027e1a3ce58aba7e2318170e679ae8bac269b974b93ceed03d83696a3be1f9","last_reissued_at":"2026-05-17T23:41:56.878484Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:56.878484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07407","source_version":4,"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:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2bto+p4rfguNplHIDR9DOTr6GaCSJ1fHwxhhWiLE980PWrD9mbOnf5e5lFkL8DMBknZpjBfAwJ8M6OX44I2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:38:35.990399Z"},"content_sha256":"a225bfe2fcda3cf804fe17638e8b62ec275f46a1f3a8cb90bfe86ae93fe69821","schema_version":"1.0","event_id":"sha256:a225bfe2fcda3cf804fe17638e8b62ec275f46a1f3a8cb90bfe86ae93fe69821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JUBH4GR44WFLU7RDDALQ4Z425C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Sparse Fourier Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Bosu Choi, Yang Wang","submitted_at":"2016-06-23T18:56:06Z","abstract_excerpt":"In this paper, we discuss the development of a sublinear sparse Fourier algorithm for high-dimensional data. In ``Adaptive Sublinear Time Fourier Algorithm\" by D. Lawlor, Y. Wang and A. Christlieb (2013), an efficient algorithm with $\\Theta(k\\log k)$ average-case runtime and $\\Theta(k)$ average-case sampling complexity for the one-dimensional sparse FFT was developed for signals of bandwidth $N$, where $k$ is the number of significant modes such that $k\\ll N$.\n  In this work we develop an efficient algorithm for sparse FFT for higher dimensional signals, extending some of the ideas in the pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07407","kind":"arxiv","version":4},"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:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nx1hZiBgSN2QYLH6lIJ87gWp5GetLWhhVlldcHKbtAOSm3ZYqApWNhaq1IJG607xDX9Ty0eJXPjyK8v0GMtuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:38:35.990744Z"},"content_sha256":"bef9e87affb6c17cb865d3e75f4c8f287068fd08d06b188550e718aed81e317b","schema_version":"1.0","event_id":"sha256:bef9e87affb6c17cb865d3e75f4c8f287068fd08d06b188550e718aed81e317b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUBH4GR44WFLU7RDDALQ4Z425C/bundle.json","state_url":"https://pith.science/pith/JUBH4GR44WFLU7RDDALQ4Z425C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUBH4GR44WFLU7RDDALQ4Z425C/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-06-27T06:38:35Z","links":{"resolver":"https://pith.science/pith/JUBH4GR44WFLU7RDDALQ4Z425C","bundle":"https://pith.science/pith/JUBH4GR44WFLU7RDDALQ4Z425C/bundle.json","state":"https://pith.science/pith/JUBH4GR44WFLU7RDDALQ4Z425C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUBH4GR44WFLU7RDDALQ4Z425C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JUBH4GR44WFLU7RDDALQ4Z425C","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":"1065c028419be28c1accd1661813616efda8dff382672e94f54a99963ebc17be","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-23T18:56:06Z","title_canon_sha256":"50b5c1b5f9f19940e5b5d30efda569c5b7e14013b98005002f7d18cbff1cba20"},"schema_version":"1.0","source":{"id":"1606.07407","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07407","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07407v4","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07407","created_at":"2026-05-17T23:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"JUBH4GR44WFL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JUBH4GR44WFLU7RD","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JUBH4GR4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:bef9e87affb6c17cb865d3e75f4c8f287068fd08d06b188550e718aed81e317b","target":"graph","created_at":"2026-05-17T23:41:56Z","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":"In this paper, we discuss the development of a sublinear sparse Fourier algorithm for high-dimensional data. In ``Adaptive Sublinear Time Fourier Algorithm\" by D. Lawlor, Y. Wang and A. Christlieb (2013), an efficient algorithm with $\\Theta(k\\log k)$ average-case runtime and $\\Theta(k)$ average-case sampling complexity for the one-dimensional sparse FFT was developed for signals of bandwidth $N$, where $k$ is the number of significant modes such that $k\\ll N$.\n  In this work we develop an efficient algorithm for sparse FFT for higher dimensional signals, extending some of the ideas in the pape","authors_text":"Andrew Christlieb, Bosu Choi, Yang Wang","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-23T18:56:06Z","title":"High-Dimensional Sparse Fourier Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07407","kind":"arxiv","version":4},"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:a225bfe2fcda3cf804fe17638e8b62ec275f46a1f3a8cb90bfe86ae93fe69821","target":"record","created_at":"2026-05-17T23:41:56Z","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":"1065c028419be28c1accd1661813616efda8dff382672e94f54a99963ebc17be","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-06-23T18:56:06Z","title_canon_sha256":"50b5c1b5f9f19940e5b5d30efda569c5b7e14013b98005002f7d18cbff1cba20"},"schema_version":"1.0","source":{"id":"1606.07407","kind":"arxiv","version":4}},"canonical_sha256":"4d027e1a3ce58aba7e2318170e679ae8bac269b974b93ceed03d83696a3be1f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d027e1a3ce58aba7e2318170e679ae8bac269b974b93ceed03d83696a3be1f9","first_computed_at":"2026-05-17T23:41:56.878484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:56.878484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3kGppW2yW5UD7SRJURYSpERma7bFj+8Sd+KpNP3YKdwA1n1bp5SEzuR4w+ZNm3w7zzhuGzh7gcAhX+KQY3mSAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:56.879193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07407","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a225bfe2fcda3cf804fe17638e8b62ec275f46a1f3a8cb90bfe86ae93fe69821","sha256:bef9e87affb6c17cb865d3e75f4c8f287068fd08d06b188550e718aed81e317b"],"state_sha256":"30022601435ed57bd49e1d076da9cecb3b3a266934d6fd2049354007a22ad939"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkLlGdfXRMCX494bP6jOksVZpDd9Ct4+ZyMQU1raWzdCSvexYge80bJDr8Lo9uEmqadu5qW/AQJTKMqCNhRoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:38:35.992561Z","bundle_sha256":"7dffc5798a477adbb1c5af3fb4ece69aa924d38ce4dcb6b3c65d7022bf4e876b"}}