{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q2VN64MR4PEIHFQPNDNHLHQVNB","short_pith_number":"pith:Q2VN64MR","canonical_record":{"source":{"id":"1509.05849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T05:56:00Z","cross_cats_sorted":["cs.MM","cs.SY","math.IT"],"title_canon_sha256":"e8744a4b74e3949d28a89575a70a0a302d8191054e66ed1689d168f40b8f359e","abstract_canon_sha256":"dcd04cdbb4a50b4055990e057d92ea0913cca7d02231e22e90e687967584535f"},"schema_version":"1.0"},"canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","source":{"kind":"arxiv","id":"1509.05849","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q2VN64MR4PEIHFQPNDNHLHQVNB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-19T05:56:00Z","cross_cats_sorted":["cs.MM","cs.SY","math.IT"],"title_canon_sha256":"e8744a4b74e3949d28a89575a70a0a302d8191054e66ed1689d168f40b8f359e","abstract_canon_sha256":"dcd04cdbb4a50b4055990e057d92ea0913cca7d02231e22e90e687967584535f"},"schema_version":"1.0"},"canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:36.530419Z","signature_b64":"Zd2MaOXQlBYnYQ7SsVLV4K5/mas1YXsWvjy8Agr5CmkMOKLYc61ZKSib0HQeB0FkhgBrQgN65oEsflL2IxwcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","last_reissued_at":"2026-05-18T01:32:36.529990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:36.529990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05849","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-18T01:32:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMysoXQ4smYvOcjdmjVHY9dxZvGWGwIQovB8R+QSyqr4one5SOjabS26g13R8JNkpzb0hsAam5msiYl+esl9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:49:01.053267Z"},"content_sha256":"05af57aa0a09c4b0cd2947b54efb2b264a492d99f5a4b0738db33cea450d2d14","schema_version":"1.0","event_id":"sha256:05af57aa0a09c4b0cd2947b54efb2b264a492d99f5a4b0738db33cea450d2d14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q2VN64MR4PEIHFQPNDNHLHQVNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Efficient Sparse 2D Discrete Fourier Transform using Sparse-Graph Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Frank Ong, Kannan Ramchandran, Sameer Pawar","submitted_at":"2015-09-19T05:56:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05849","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-18T01:32:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cz6f54O01L8ELuc0no22q8KNZy/LyKLCL7zhgmLcWb6UQedgVHQT23iqp/7XuQTv7hFilK7z7QZBaiYDdvjBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:49:01.053949Z"},"content_sha256":"fde6270f883a076259c4ef6b0a7d2a268d22fc46485529bf10533fb881288bc0","schema_version":"1.0","event_id":"sha256:fde6270f883a076259c4ef6b0a7d2a268d22fc46485529bf10533fb881288bc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/bundle.json","state_url":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/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-27T14:49:01Z","links":{"resolver":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB","bundle":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/bundle.json","state":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YPyuphlngh6owNdGYLLPITOB/ckz1V7xZf4ZYnrW267CF+BaRwA+cmo2w/JAcDBW3NEFz2Fq+rFJ4oj600N7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:49:01.057102Z","bundle_sha256":"17c1df4d5774b61f2cda65422d26e216b7e6c0bcae46f706dad4a38be9551ec6"}}