{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q2VN64MR4PEIHFQPNDNHLHQVNB","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":"dcd04cdbb4a50b4055990e057d92ea0913cca7d02231e22e90e687967584535f","cross_cats_sorted":["cs.MM","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T05:56:00Z","title_canon_sha256":"e8744a4b74e3949d28a89575a70a0a302d8191054e66ed1689d168f40b8f359e"},"schema_version":"1.0","source":{"id":"1509.05849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05849","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05849v1","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05849","created_at":"2026-05-18T01:32:36Z"},{"alias_kind":"pith_short_12","alias_value":"Q2VN64MR4PEI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2VN64MR4PEIHFQP","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2VN64MR","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fde6270f883a076259c4ef6b0a7d2a268d22fc46485529bf10533fb881288bc0","target":"graph","created_at":"2026-05-18T01:32:36Z","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 a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from signal processing (sub-sampling and aliasing), coding theory (sparse-graph codes) and number theory (Chinese-remainder-theorem) and generalizes the 1D-FFAST 2 algorithm recently proposed by Pawar and Ramchandran [1] to the 2D setting. Concretely, our proposed 2D-FFAST algorithm computes a k-sparse 2D-DFT, with a uniformly random support, of size N = Nx x Ny using","authors_text":"Frank Ong, Kannan Ramchandran, Sameer Pawar","cross_cats":["cs.MM","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T05:56:00Z","title":"Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05849","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:05af57aa0a09c4b0cd2947b54efb2b264a492d99f5a4b0738db33cea450d2d14","target":"record","created_at":"2026-05-18T01:32:36Z","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":"dcd04cdbb4a50b4055990e057d92ea0913cca7d02231e22e90e687967584535f","cross_cats_sorted":["cs.MM","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T05:56:00Z","title_canon_sha256":"e8744a4b74e3949d28a89575a70a0a302d8191054e66ed1689d168f40b8f359e"},"schema_version":"1.0","source":{"id":"1509.05849","kind":"arxiv","version":1}},"canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","first_computed_at":"2026-05-18T01:32:36.529990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:36.529990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zd2MaOXQlBYnYQ7SsVLV4K5/mas1YXsWvjy8Agr5CmkMOKLYc61ZKSib0HQeB0FkhgBrQgN65oEsflL2IxwcCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:36.530419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05af57aa0a09c4b0cd2947b54efb2b264a492d99f5a4b0738db33cea450d2d14","sha256:fde6270f883a076259c4ef6b0a7d2a268d22fc46485529bf10533fb881288bc0"],"state_sha256":"8917dffa148e9cd7e44536e280859e833970aa7008591249381b7af19ef6b88f"}