{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LPB6ZRNTQVNBFSHNOYMQWG4WFW","short_pith_number":"pith:LPB6ZRNT","canonical_record":{"source":{"id":"1303.1209","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-03-05T22:28:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"414cfbae7514912f2ffd9c1c676b1e2dbe3bd5ac8ea3c872db7be97e723bccd8","abstract_canon_sha256":"91725cc0953d79fff3654d4d1744e77d5fdc5f930a733519c534bbd7149710d8"},"schema_version":"1.0"},"canonical_sha256":"5bc3ecc5b3855a12c8ed76190b1b962d913f88ac613bff60cc7d6add822072d2","source":{"kind":"arxiv","id":"1303.1209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1209","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1209v1","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1209","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"LPB6ZRNTQVNB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LPB6ZRNTQVNBFSHN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LPB6ZRNT","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LPB6ZRNTQVNBFSHNOYMQWG4WFW","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1209","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-03-05T22:28:21Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"414cfbae7514912f2ffd9c1c676b1e2dbe3bd5ac8ea3c872db7be97e723bccd8","abstract_canon_sha256":"91725cc0953d79fff3654d4d1744e77d5fdc5f930a733519c534bbd7149710d8"},"schema_version":"1.0"},"canonical_sha256":"5bc3ecc5b3855a12c8ed76190b1b962d913f88ac613bff60cc7d6add822072d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:44.185849Z","signature_b64":"nuHhRbkry9zAxnd8iJsyx8nM93a1nKnuabmNFQ0tyBVOENCHR4APS3LCIfj3V85dz4K6AI2ZmH0RME7n7sfuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bc3ecc5b3855a12c8ed76190b1b962d913f88ac613bff60cc7d6add822072d2","last_reissued_at":"2026-05-18T03:31:44.185246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:44.185246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1209","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-18T03:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk4/JM2UcPAQ0uHsQlhyDmy9sHXRxu3rAcZsHOjzgEttLHhz3IY95pIs7dpSSUMS4vyl6UDQSz5cY+kiHPd7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:23:51.256219Z"},"content_sha256":"aa637ef6cd1df659be45e4d179cacf384a23cb3970d06c10310c988e7b1c5b8a","schema_version":"1.0","event_id":"sha256:aa637ef6cd1df659be45e4d179cacf384a23cb3970d06c10310c988e7b1c5b8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LPB6ZRNTQVNBFSHNOYMQWG4WFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Badih Ghazi, Dina Katabi, Eric Price, Haitham Hassanieh, Lixin Shi, Piotr Indyk","submitted_at":"2013-03-05T22:28:21Z","abstract_excerpt":"We present the first sample-optimal sublinear time algorithms for the sparse Discrete Fourier Transform over a two-dimensional sqrt{n} x sqrt{n} grid. Our algorithms are analyzed for /average case/ signals. For signals whose spectrum is exactly sparse, our algorithms use O(k) samples and run in O(k log k) time, where k is the expected sparsity of the signal. For signals whose spectrum is approximately sparse, our algorithm uses O(k log n) samples and runs in O(k log^2 n) time; the latter algorithm works for k=Theta(sqrt{n}). The number of samples used by our algorithms matches the known lower "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1209","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-18T03:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICNJJPDvNzUr6iiKewVdGsEI9M6WxjOduQiTq9wltwLtgLPVZNbjrx3UNkXws/uHbcgRznfRu29+FeTzX9I2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:23:51.256585Z"},"content_sha256":"e9a8ed33e683574335dc9d8882cfd6ce2caf485bc16709aa0ad0d1e2980a7dac","schema_version":"1.0","event_id":"sha256:e9a8ed33e683574335dc9d8882cfd6ce2caf485bc16709aa0ad0d1e2980a7dac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/bundle.json","state_url":"https://pith.science/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/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-03T00:23:51Z","links":{"resolver":"https://pith.science/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW","bundle":"https://pith.science/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/bundle.json","state":"https://pith.science/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPB6ZRNTQVNBFSHNOYMQWG4WFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LPB6ZRNTQVNBFSHNOYMQWG4WFW","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":"91725cc0953d79fff3654d4d1744e77d5fdc5f930a733519c534bbd7149710d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-03-05T22:28:21Z","title_canon_sha256":"414cfbae7514912f2ffd9c1c676b1e2dbe3bd5ac8ea3c872db7be97e723bccd8"},"schema_version":"1.0","source":{"id":"1303.1209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1209","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1209v1","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1209","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"LPB6ZRNTQVNB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LPB6ZRNTQVNBFSHN","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LPB6ZRNT","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:e9a8ed33e683574335dc9d8882cfd6ce2caf485bc16709aa0ad0d1e2980a7dac","target":"graph","created_at":"2026-05-18T03:31:44Z","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 present the first sample-optimal sublinear time algorithms for the sparse Discrete Fourier Transform over a two-dimensional sqrt{n} x sqrt{n} grid. Our algorithms are analyzed for /average case/ signals. For signals whose spectrum is exactly sparse, our algorithms use O(k) samples and run in O(k log k) time, where k is the expected sparsity of the signal. For signals whose spectrum is approximately sparse, our algorithm uses O(k log n) samples and runs in O(k log^2 n) time; the latter algorithm works for k=Theta(sqrt{n}). The number of samples used by our algorithms matches the known lower ","authors_text":"Badih Ghazi, Dina Katabi, Eric Price, Haitham Hassanieh, Lixin Shi, Piotr Indyk","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-03-05T22:28:21Z","title":"Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1209","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:aa637ef6cd1df659be45e4d179cacf384a23cb3970d06c10310c988e7b1c5b8a","target":"record","created_at":"2026-05-18T03:31:44Z","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":"91725cc0953d79fff3654d4d1744e77d5fdc5f930a733519c534bbd7149710d8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2013-03-05T22:28:21Z","title_canon_sha256":"414cfbae7514912f2ffd9c1c676b1e2dbe3bd5ac8ea3c872db7be97e723bccd8"},"schema_version":"1.0","source":{"id":"1303.1209","kind":"arxiv","version":1}},"canonical_sha256":"5bc3ecc5b3855a12c8ed76190b1b962d913f88ac613bff60cc7d6add822072d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bc3ecc5b3855a12c8ed76190b1b962d913f88ac613bff60cc7d6add822072d2","first_computed_at":"2026-05-18T03:31:44.185246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:44.185246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nuHhRbkry9zAxnd8iJsyx8nM93a1nKnuabmNFQ0tyBVOENCHR4APS3LCIfj3V85dz4K6AI2ZmH0RME7n7sfuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:44.185849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa637ef6cd1df659be45e4d179cacf384a23cb3970d06c10310c988e7b1c5b8a","sha256:e9a8ed33e683574335dc9d8882cfd6ce2caf485bc16709aa0ad0d1e2980a7dac"],"state_sha256":"98fa45814e5b16216cb5c097cf5f652d92987c2ed5fec436ce1fb656d8d32cea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfL4jvjUBA8vZOvDXnqn1XVTxnjIsChcXTTBCQ8m0jPYoehZz6rn71Nc4FfAJXVohs1NgfqDCORBAM1s316IDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:23:51.258501Z","bundle_sha256":"e549566fdba1b388140c25f224de301130347d1c704ab45e740fc5f4fe418565"}}