{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7R5JEB2XWHLMGTT5I7I77SOZPU","short_pith_number":"pith:7R5JEB2X","schema_version":"1.0","canonical_sha256":"fc7a920757b1d6c34e7d47d1ffc9d97d28e69e0a1ceaf067242b6ff78fd29a5f","source":{"kind":"arxiv","id":"1501.00320","version":1},"attestation_state":"computed","paper":{"title":"A robust sub-linear time R-FFAST algorithm for computing a sparse DFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Sameer Pawar","submitted_at":"2015-01-01T21:48:00Z","abstract_excerpt":"The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X of the signal x has only k non-zero coefficients (where k < n), can we do better? In [1], we addressed this question and presented a novel FFAST (Fast Fourier Aliasing-based Sparse Transform) algorithm that cleverly induces sparse graph alias codes in the DFT domain, via a Chinese-Remainder-Theorem (CRT)-guided sub-sampling operation of the time-domain samples. The resulting sparse grap"},"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":"1501.00320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-01T21:48:00Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"b51b990780be97417b6f4bac2d478db05da85c11ab4c936de15d8efadb87d5bf","abstract_canon_sha256":"74028d571a3d9e6ed42695f47ad3c665210b2bb87ae27066b67985ebb2ba5fd6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.581502Z","signature_b64":"Io9+SZc94UCq1c7NyuCptxlNkkUy79qWv7ypkYvFNGsebllHMdd00zwc2MUPM6KfXOt6ET1APzOIuc5xhB/CDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc7a920757b1d6c34e7d47d1ffc9d97d28e69e0a1ceaf067242b6ff78fd29a5f","last_reissued_at":"2026-05-18T02:30:09.580753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.580753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust sub-linear time R-FFAST algorithm for computing a sparse DFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Kannan Ramchandran, Sameer Pawar","submitted_at":"2015-01-01T21:48:00Z","abstract_excerpt":"The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X of the signal x has only k non-zero coefficients (where k < n), can we do better? In [1], we addressed this question and presented a novel FFAST (Fast Fourier Aliasing-based Sparse Transform) algorithm that cleverly induces sparse graph alias codes in the DFT domain, via a Chinese-Remainder-Theorem (CRT)-guided sub-sampling operation of the time-domain samples. The resulting sparse grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00320","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":"1501.00320","created_at":"2026-05-18T02:30:09.580871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00320v1","created_at":"2026-05-18T02:30:09.580871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00320","created_at":"2026-05-18T02:30:09.580871+00:00"},{"alias_kind":"pith_short_12","alias_value":"7R5JEB2XWHLM","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7R5JEB2XWHLMGTT5","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7R5JEB2X","created_at":"2026-05-18T12:29:10.953037+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/7R5JEB2XWHLMGTT5I7I77SOZPU","json":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU.json","graph_json":"https://pith.science/api/pith-number/7R5JEB2XWHLMGTT5I7I77SOZPU/graph.json","events_json":"https://pith.science/api/pith-number/7R5JEB2XWHLMGTT5I7I77SOZPU/events.json","paper":"https://pith.science/paper/7R5JEB2X"},"agent_actions":{"view_html":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU","download_json":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU.json","view_paper":"https://pith.science/paper/7R5JEB2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00320&json=true","fetch_graph":"https://pith.science/api/pith-number/7R5JEB2XWHLMGTT5I7I77SOZPU/graph.json","fetch_events":"https://pith.science/api/pith-number/7R5JEB2XWHLMGTT5I7I77SOZPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU/action/storage_attestation","attest_author":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU/action/author_attestation","sign_citation":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU/action/citation_signature","submit_replication":"https://pith.science/pith/7R5JEB2XWHLMGTT5I7I77SOZPU/action/replication_record"}},"created_at":"2026-05-18T02:30:09.580871+00:00","updated_at":"2026-05-18T02:30:09.580871+00:00"}