{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RR7YU4IWEDZBIKQ2OFKCS6APEC","short_pith_number":"pith:RR7YU4IW","canonical_record":{"source":{"id":"1706.02740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"833f82100887e4cd7e3289bd09bee18af20301427d15740c5ac86ce58d14e8aa","abstract_canon_sha256":"92aff4edacf600ca85056e9a984f061e9e458b5c197af55660c06d4403f7ee81"},"schema_version":"1.0"},"canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","source":{"kind":"arxiv","id":"1706.02740","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02740","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02740v1","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02740","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"RR7YU4IWEDZB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR7YU4IWEDZBIKQ2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR7YU4IW","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RR7YU4IWEDZBIKQ2OFKCS6APEC","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"833f82100887e4cd7e3289bd09bee18af20301427d15740c5ac86ce58d14e8aa","abstract_canon_sha256":"92aff4edacf600ca85056e9a984f061e9e458b5c197af55660c06d4403f7ee81"},"schema_version":"1.0"},"canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:41.101476Z","signature_b64":"wNyhjm1VE+ciNbQG8Ef4NHTX9ejwjfcPsmCYvwCpHd9wzaASxi/w5Vy0shM8kPBmAOq8VTotIrNBpKjpttcQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","last_reissued_at":"2026-05-18T00:42:41.100762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:41.100762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02740","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-18T00:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cS+weKRQFUHLpo69PhC27S7qM1fu3smJiIyuVAurOa4c8PT2amG84UK0huyCcIf/uq6dJBR6yjw2zYeOj2SQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:20:32.943956Z"},"content_sha256":"788d2eac01aab16b380345d2fad4f846cdb10bc849f90a4c13e76d33c3409fb8","schema_version":"1.0","event_id":"sha256:788d2eac01aab16b380345d2fad4f846cdb10bc849f90a4c13e76d33c3409fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RR7YU4IWEDZBIKQ2OFKCS6APEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Mark A. Iwen, Ruochuan Zhang, Sami Merhi","submitted_at":"2017-06-08T19:40:28Z","abstract_excerpt":"In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\\mathbf{\\hat{f}} \\in \\mathbb{C}^N$ of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in just $\\left( s \\log N\\right)^{\\mathcal{O}(1)}$-time using only a similarly small number of entries of $\\mathbf{f}$. In particular, we present a deterministic SFT algorithm which is guaranteed to always recover a near best $s$-term approximation of the DFT of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in $\\mathcal{O} \\left( s^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02740","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-18T00:42:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qW3mcUPZ16OCy2pdIs06oXQAwMfquEkyuRH2u2oFOSiL4S16gkybsL4QCvHZJ4lCrrZGCkvjRgRvFR9wJ3oOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:20:32.944652Z"},"content_sha256":"65855066e099f9dcfb9d91450e1c85c9375e5e466d5b83b47df7a35642f98790","schema_version":"1.0","event_id":"sha256:65855066e099f9dcfb9d91450e1c85c9375e5e466d5b83b47df7a35642f98790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/bundle.json","state_url":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/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-25T13:20:32Z","links":{"resolver":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC","bundle":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/bundle.json","state":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RR7YU4IWEDZBIKQ2OFKCS6APEC","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":"92aff4edacf600ca85056e9a984f061e9e458b5c197af55660c06d4403f7ee81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","title_canon_sha256":"833f82100887e4cd7e3289bd09bee18af20301427d15740c5ac86ce58d14e8aa"},"schema_version":"1.0","source":{"id":"1706.02740","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02740","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02740v1","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02740","created_at":"2026-05-18T00:42:41Z"},{"alias_kind":"pith_short_12","alias_value":"RR7YU4IWEDZB","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RR7YU4IWEDZBIKQ2","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RR7YU4IW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:65855066e099f9dcfb9d91450e1c85c9375e5e466d5b83b47df7a35642f98790","target":"graph","created_at":"2026-05-18T00:42:41Z","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 consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\\mathbf{\\hat{f}} \\in \\mathbb{C}^N$ of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in just $\\left( s \\log N\\right)^{\\mathcal{O}(1)}$-time using only a similarly small number of entries of $\\mathbf{f}$. In particular, we present a deterministic SFT algorithm which is guaranteed to always recover a near best $s$-term approximation of the DFT of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in $\\mathcal{O} \\left( s^","authors_text":"Andrew Christlieb, Mark A. Iwen, Ruochuan Zhang, Sami Merhi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","title":"A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02740","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:788d2eac01aab16b380345d2fad4f846cdb10bc849f90a4c13e76d33c3409fb8","target":"record","created_at":"2026-05-18T00:42:41Z","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":"92aff4edacf600ca85056e9a984f061e9e458b5c197af55660c06d4403f7ee81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","title_canon_sha256":"833f82100887e4cd7e3289bd09bee18af20301427d15740c5ac86ce58d14e8aa"},"schema_version":"1.0","source":{"id":"1706.02740","kind":"arxiv","version":1}},"canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","first_computed_at":"2026-05-18T00:42:41.100762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:41.100762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wNyhjm1VE+ciNbQG8Ef4NHTX9ejwjfcPsmCYvwCpHd9wzaASxi/w5Vy0shM8kPBmAOq8VTotIrNBpKjpttcQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:41.101476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02740","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:788d2eac01aab16b380345d2fad4f846cdb10bc849f90a4c13e76d33c3409fb8","sha256:65855066e099f9dcfb9d91450e1c85c9375e5e466d5b83b47df7a35642f98790"],"state_sha256":"3ef4e1a8fcf304b80ea0dff8a32226859207e58fa572237448c25db37d0be658"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZSwegL9e6kJosT6DKMkLhz2FKD+NTx1abU04Xv9ukg+27va98mlhokP1l0UINl7zlUibnnK+ASYBy5LmufaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:20:32.947918Z","bundle_sha256":"7f12ac35875e9f5a9047c37a8fb9673bfa32fa466e3a08ef04d9da7cfdf3826b"}}