{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q2VN64MR4PEIHFQPNDNHLHQVNB","short_pith_number":"pith:Q2VN64MR","schema_version":"1.0","canonical_sha256":"86aadf7191e3c883960f68da759e15686e5602882adf1438d477f98a225afd9a","source":{"kind":"arxiv","id":"1509.05849","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.05849","created_at":"2026-05-18T01:32:36.530056+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.05849v1","created_at":"2026-05-18T01:32:36.530056+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05849","created_at":"2026-05-18T01:32:36.530056+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2VN64MR4PEI","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2VN64MR4PEIHFQP","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2VN64MR","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB","json":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB.json","graph_json":"https://pith.science/api/pith-number/Q2VN64MR4PEIHFQPNDNHLHQVNB/graph.json","events_json":"https://pith.science/api/pith-number/Q2VN64MR4PEIHFQPNDNHLHQVNB/events.json","paper":"https://pith.science/paper/Q2VN64MR"},"agent_actions":{"view_html":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB","download_json":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB.json","view_paper":"https://pith.science/paper/Q2VN64MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.05849&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2VN64MR4PEIHFQPNDNHLHQVNB/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2VN64MR4PEIHFQPNDNHLHQVNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/action/storage_attestation","attest_author":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/action/author_attestation","sign_citation":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/action/citation_signature","submit_replication":"https://pith.science/pith/Q2VN64MR4PEIHFQPNDNHLHQVNB/action/replication_record"}},"created_at":"2026-05-18T01:32:36.530056+00:00","updated_at":"2026-05-18T01:32:36.530056+00:00"}