{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6JY4D4325X3L5WZZ2OVCYDSMRD","short_pith_number":"pith:6JY4D432","canonical_record":{"source":{"id":"1708.04544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"e105243b3ab9e9c8358a69f10f1f73f74ab8f093e4e77d99fd479ce55784ff3c","abstract_canon_sha256":"0864fe85fc392d66e6c34b93c90e13d229ecfde1a91e03f093a71a4fbacc0f21"},"schema_version":"1.0"},"canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","source":{"kind":"arxiv","id":"1708.04544","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04544","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04544v2","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04544","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"6JY4D4325X3L","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JY4D4325X3L5WZZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JY4D432","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6JY4D4325X3L5WZZ2OVCYDSMRD","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"e105243b3ab9e9c8358a69f10f1f73f74ab8f093e4e77d99fd479ce55784ff3c","abstract_canon_sha256":"0864fe85fc392d66e6c34b93c90e13d229ecfde1a91e03f093a71a4fbacc0f21"},"schema_version":"1.0"},"canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:54.157613Z","signature_b64":"dLkXwzCSXWbzBbbLqgkosm0an171qW0I6dzeEW+pxDkQYsFj0Sl7jRoCeWBHSuppBfurT2BtBi9jRR3lG6sxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","last_reissued_at":"2026-05-18T00:37:54.157152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:54.157152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04544","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-18T00:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrQ4cPne+6XxbQ+2Hj4uwynk/iH5MkPZ3+UshFQWBmANh9WjIN+eHbUf/7zClv5K5uk9EWTYYxo1lCFE8gRUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:09:19.728374Z"},"content_sha256":"6750bee269b7f1bd2fe9fd035c540b0767e88a363efc2452e1237b775367da84","schema_version":"1.0","event_id":"sha256:6750bee269b7f1bd2fe9fd035c540b0767e88a363efc2452e1237b775367da84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6JY4D4325X3L5WZZ2OVCYDSMRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2017-08-15T15:11:18Z","abstract_excerpt":"The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received significant attention recently. It is known how to approximately compute the $k$-sparse Fourier transform in $\\approx k\\log^2 n$ time [Hassanieh et al'STOC'12], or using the optimal number $O(k\\log n)$ of samples [Indyk et al'FOCS'14] in time domain, or come within $(\\log\\log n)^{O(1)}$ factors of both these bounds simultaneously, but no algorithm achieving the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04544","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-18T00:37:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l9YcCdhLzGHx4Bewy9wy8qyeUdFMP9KCljIwmJtlAbLVgenWou0hu0THaYImEm6d9fjGvRzjAFHnqBz5xNZJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:09:19.729014Z"},"content_sha256":"622e21e980fc65a2049722e916758735691eb86401d1c4a241789504373347d9","schema_version":"1.0","event_id":"sha256:622e21e980fc65a2049722e916758735691eb86401d1c4a241789504373347d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/bundle.json","state_url":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/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-31T19:09:19Z","links":{"resolver":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD","bundle":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/bundle.json","state":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6JY4D4325X3L5WZZ2OVCYDSMRD","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":"0864fe85fc392d66e6c34b93c90e13d229ecfde1a91e03f093a71a4fbacc0f21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","title_canon_sha256":"e105243b3ab9e9c8358a69f10f1f73f74ab8f093e4e77d99fd479ce55784ff3c"},"schema_version":"1.0","source":{"id":"1708.04544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04544","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04544v2","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04544","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"6JY4D4325X3L","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JY4D4325X3L5WZZ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JY4D432","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:622e21e980fc65a2049722e916758735691eb86401d1c4a241789504373347d9","target":"graph","created_at":"2026-05-18T00:37:54Z","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 problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received significant attention recently. It is known how to approximately compute the $k$-sparse Fourier transform in $\\approx k\\log^2 n$ time [Hassanieh et al'STOC'12], or using the optimal number $O(k\\log n)$ of samples [Indyk et al'FOCS'14] in time domain, or come within $(\\log\\log n)^{O(1)}$ factors of both these bounds simultaneously, but no algorithm achieving the o","authors_text":"Michael Kapralov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","title":"Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04544","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:6750bee269b7f1bd2fe9fd035c540b0767e88a363efc2452e1237b775367da84","target":"record","created_at":"2026-05-18T00:37:54Z","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":"0864fe85fc392d66e6c34b93c90e13d229ecfde1a91e03f093a71a4fbacc0f21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","title_canon_sha256":"e105243b3ab9e9c8358a69f10f1f73f74ab8f093e4e77d99fd479ce55784ff3c"},"schema_version":"1.0","source":{"id":"1708.04544","kind":"arxiv","version":2}},"canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","first_computed_at":"2026-05-18T00:37:54.157152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:54.157152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLkXwzCSXWbzBbbLqgkosm0an171qW0I6dzeEW+pxDkQYsFj0Sl7jRoCeWBHSuppBfurT2BtBi9jRR3lG6sxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:54.157613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6750bee269b7f1bd2fe9fd035c540b0767e88a363efc2452e1237b775367da84","sha256:622e21e980fc65a2049722e916758735691eb86401d1c4a241789504373347d9"],"state_sha256":"472305f69d8de9b857b391314e381a98548396db52365fa11348438b0313ca64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQj1d+FIzLgj7Nym5K/5c0Op1+nlcROyQb0OHAhD9YZt1eg/iphEnH3rKFJ+crYno6e5NSMJL1xAHmLK+XezCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:09:19.732591Z","bundle_sha256":"08af2cec300c26b3a13f20572a0fb739ff3495609bc0e6038a26aa9b8d992d0c"}}