{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KSJGNSNHZKDXOACLUOIBDZF4HS","short_pith_number":"pith:KSJGNSNH","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"},"canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","source":{"kind":"arxiv","id":"1908.02461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02461","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02461v2","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02461","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_12","alias_value":"KSJGNSNHZKDX","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_16","alias_value":"KSJGNSNHZKDXOACL","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_8","alias_value":"KSJGNSNH","created_at":"2026-07-05T00:43:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KSJGNSNHZKDXOACLUOIBDZF4HS","target":"record","payload":{"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"},"canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","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"},"source_kind":"arxiv","source_id":"1908.02461","source_version":2,"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-07-05T00:43:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AuVQZudxL/aH5OPMejzyfeQfC0v3C8bU40Jkoj+jlJsyaWgMomLZOKtHNeq1mjtWppeoQ8WuNKlD9zVigrakCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:09:45.599853Z"},"content_sha256":"bbfe1f5d05e13be8002b33d0deca31ddaf17fad8835ae65c3d99b01610e6db5f","schema_version":"1.0","event_id":"sha256:bbfe1f5d05e13be8002b33d0deca31ddaf17fad8835ae65c3d99b01610e6db5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KSJGNSNHZKDXOACLUOIBDZF4HS","target":"graph","payload":{"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"},"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-07-05T00:43:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bk6nIR5kR003jE82CW3YjVpKO2NicnmT46OEdb5LZXSTZ0nymIOxPfvlxjxgiZa+13g97vkoi0YsySGVOV9wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:09:45.600386Z"},"content_sha256":"06cb28e950b953315e46575e245fff56592aa69679a1be6e9111d2163293e94f","schema_version":"1.0","event_id":"sha256:06cb28e950b953315e46575e245fff56592aa69679a1be6e9111d2163293e94f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/bundle.json","state_url":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/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-08-16T06:09:45Z","links":{"resolver":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS","bundle":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/bundle.json","state":"https://pith.science/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSJGNSNHZKDXOACLUOIBDZF4HS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KSJGNSNHZKDXOACLUOIBDZF4HS","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":"4830024abaf409c753869154767afd6b82168fb35b338a5da7040aa35daec7f3","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-07T07:13:10Z","title_canon_sha256":"89e37db31abeb1a0498a4d66509bc26d15489253ab9eb74324fd4d58ce03bd54"},"schema_version":"1.0","source":{"id":"1908.02461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02461","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02461v2","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02461","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_12","alias_value":"KSJGNSNHZKDX","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_16","alias_value":"KSJGNSNHZKDXOACL","created_at":"2026-07-05T00:43:02Z"},{"alias_kind":"pith_short_8","alias_value":"KSJGNSNH","created_at":"2026-07-05T00:43:02Z"}],"graph_snapshots":[{"event_id":"sha256:06cb28e950b953315e46575e245fff56592aa69679a1be6e9111d2163293e94f","target":"graph","created_at":"2026-07-05T00:43:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.02461/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haihang You, Runkai Yang, Sheng Shi","cross_cats":["eess.IV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-07T07:13:10Z","title":"ATSFFT: A Novel Sparse Fast Fourier Transform Enabled With Sparsity Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02461","kind":"arxiv","version":2},"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:bbfe1f5d05e13be8002b33d0deca31ddaf17fad8835ae65c3d99b01610e6db5f","target":"record","created_at":"2026-07-05T00:43:02Z","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":"4830024abaf409c753869154767afd6b82168fb35b338a5da7040aa35daec7f3","cross_cats_sorted":["eess.IV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-08-07T07:13:10Z","title_canon_sha256":"89e37db31abeb1a0498a4d66509bc26d15489253ab9eb74324fd4d58ce03bd54"},"schema_version":"1.0","source":{"id":"1908.02461","kind":"arxiv","version":2}},"canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"549266c9a7ca8777004ba39011e4bc3cbd0578ca450092cde0bc47a83d04e0cf","first_computed_at":"2026-07-05T00:43:02.793871Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:43:02.793871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KJU/eQckl9TFYwnYXGNDxzTFl7f46TL+gBBC3cybd8ZH/xsIA6L5H1SOxyXlk8kacMtA70hd5Js8mg5GCE67CA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:43:02.794287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbfe1f5d05e13be8002b33d0deca31ddaf17fad8835ae65c3d99b01610e6db5f","sha256:06cb28e950b953315e46575e245fff56592aa69679a1be6e9111d2163293e94f"],"state_sha256":"4546af6ef58e82e7ad19747a2af2abd9f836b67d7b80eb247eca36793225edf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5VjiUiFzXd0TBmxLRaqsjjva4gt09npps+aEM+cveAZMUbi4KcEmAhTbEzexQ/nScVVMGE4tMF/BD6SvO3K2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:09:45.605218Z","bundle_sha256":"443234629aa0213422cb91f94d20cd3d99c24160e3653b122f5a66e01971df63"}}