{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSJGNSNHZKDXOACLUOIBDZF4HS","short_pith_number":"pith:KSJGNSNH","schema_version":"1.0","canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","source":{"kind":"arxiv","id":"1908.02461","version":2},"attestation_state":"computed","paper":{"title":"ATSFFT: A Novel Sparse Fast Fourier Transform Enabled With Sparsity Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"eess.SP","authors_text":"Haihang You, Runkai Yang, Sheng Shi","submitted_at":"2019-08-07T07:13:10Z","abstract_excerpt":"The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency domain. The Sparse Fast Fourier Transform (SFFT) is an innovative algorithm for discrete Fourier transforms on signals that possess characteristics of the sparsity in frequency domain. A reference implementation of the algorithm has been proven to be efficient than modern FFT library in cases of sufficient sparsity. However, the SFFT implementation has a criti"},"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":"1908.02461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-07T07:13:10Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"89e37db31abeb1a0498a4d66509bc26d15489253ab9eb74324fd4d58ce03bd54","abstract_canon_sha256":"4830024abaf409c753869154767afd6b82168fb35b338a5da7040aa35daec7f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:02.794287Z","signature_b64":"KJU/eQckl9TFYwnYXGNDxzTFl7f46TL+gBBC3cybd8ZH/xsIA6L5H1SOxyXlk8kacMtA70hd5Js8mg5GCE67CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","last_reissued_at":"2026-07-05T00:43:02.793871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:02.793871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ATSFFT: A Novel Sparse Fast Fourier Transform Enabled With Sparsity Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"eess.SP","authors_text":"Haihang You, Runkai Yang, Sheng Shi","submitted_at":"2019-08-07T07:13:10Z","abstract_excerpt":"The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency domain. The Sparse Fast Fourier Transform (SFFT) is an innovative algorithm for discrete Fourier transforms on signals that possess characteristics of the sparsity in frequency domain. A reference implementation of the algorithm has been proven to be efficient than modern FFT library in cases of sufficient sparsity. However, the SFFT implementation has a criti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02461","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02461/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02461","created_at":"2026-07-05T00:43:02.793930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02461v2","created_at":"2026-07-05T00:43:02.793930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02461","created_at":"2026-07-05T00:43:02.793930+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSJGNSNHZKDX","created_at":"2026-07-05T00:43:02.793930+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSJGNSNHZKDXOACL","created_at":"2026-07-05T00:43:02.793930+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSJGNSNH","created_at":"2026-07-05T00:43:02.793930+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/KSJGNSNHZKDXOACLUOIBDZF4HS","json":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS.json","graph_json":"https://pith.science/api/pith-number/KSJGNSNHZKDXOACLUOIBDZF4HS/graph.json","events_json":"https://pith.science/api/pith-number/KSJGNSNHZKDXOACLUOIBDZF4HS/events.json","paper":"https://pith.science/paper/KSJGNSNH"},"agent_actions":{"view_html":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS","download_json":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS.json","view_paper":"https://pith.science/paper/KSJGNSNH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02461&json=true","fetch_graph":"https://pith.science/api/pith-number/KSJGNSNHZKDXOACLUOIBDZF4HS/graph.json","fetch_events":"https://pith.science/api/pith-number/KSJGNSNHZKDXOACLUOIBDZF4HS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/action/storage_attestation","attest_author":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/action/author_attestation","sign_citation":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/action/citation_signature","submit_replication":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/action/replication_record"}},"created_at":"2026-07-05T00:43:02.793930+00:00","updated_at":"2026-07-05T00:43:02.793930+00:00"}