{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A66X3GMACR25ABFSBXRS7YK7VA","short_pith_number":"pith:A66X3GMA","schema_version":"1.0","canonical_sha256":"07bd7d99801475d004b20de32fe15fa816a92189fc1efede14b110717d6393cc","source":{"kind":"arxiv","id":"1707.08213","version":2},"attestation_state":"computed","paper":{"title":"The 2D Tree Sliding Window Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Lee F. Richardson, William F. Eddy","submitted_at":"2017-07-25T20:48:46Z","abstract_excerpt":"We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey Fast Fourier Transform (FFT). For an $N_0 \\times N_1$ array and $n_0 \\times n_1$ windows, our algorithm takes $O(N_0 N_1 n_0 n_1)$ operations. We provide a C implementation of our algorithm for the Radix-2 case, compare ours with existing algorithms, and show how our algorithm easily extends to higher dimensions."},"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":"1707.08213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-25T20:48:46Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"2482a0b38858a01e937bfd1aede45a4624b06860f2f81c11e1ab3a46612d206b","abstract_canon_sha256":"96fb489fe157ec0f9243ea4cd5f76d2ffd60b477698a48990e0be7b7e61c281e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:29.466724Z","signature_b64":"zXvSp7HYL+L67AlFtry6AbNBnnWrcpV/QqyXwtvkgz0+Eu5qmkwLYjshmvYkhNFf40qMHPtcCpS6kEjBHslSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07bd7d99801475d004b20de32fe15fa816a92189fc1efede14b110717d6393cc","last_reissued_at":"2026-05-17T23:52:29.466333Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:29.466333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The 2D Tree Sliding Window Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"cs.DS","authors_text":"Lee F. Richardson, William F. Eddy","submitted_at":"2017-07-25T20:48:46Z","abstract_excerpt":"We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey Fast Fourier Transform (FFT). For an $N_0 \\times N_1$ array and $n_0 \\times n_1$ windows, our algorithm takes $O(N_0 N_1 n_0 n_1)$ operations. We provide a C implementation of our algorithm for the Radix-2 case, compare ours with existing algorithms, and show how our algorithm easily extends to higher dimensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08213","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":""},"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":"1707.08213","created_at":"2026-05-17T23:52:29.466395+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08213v2","created_at":"2026-05-17T23:52:29.466395+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08213","created_at":"2026-05-17T23:52:29.466395+00:00"},{"alias_kind":"pith_short_12","alias_value":"A66X3GMACR25","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A66X3GMACR25ABFS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A66X3GMA","created_at":"2026-05-18T12:31:05.417338+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/A66X3GMACR25ABFSBXRS7YK7VA","json":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA.json","graph_json":"https://pith.science/api/pith-number/A66X3GMACR25ABFSBXRS7YK7VA/graph.json","events_json":"https://pith.science/api/pith-number/A66X3GMACR25ABFSBXRS7YK7VA/events.json","paper":"https://pith.science/paper/A66X3GMA"},"agent_actions":{"view_html":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA","download_json":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA.json","view_paper":"https://pith.science/paper/A66X3GMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08213&json=true","fetch_graph":"https://pith.science/api/pith-number/A66X3GMACR25ABFSBXRS7YK7VA/graph.json","fetch_events":"https://pith.science/api/pith-number/A66X3GMACR25ABFSBXRS7YK7VA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA/action/storage_attestation","attest_author":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA/action/author_attestation","sign_citation":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA/action/citation_signature","submit_replication":"https://pith.science/pith/A66X3GMACR25ABFSBXRS7YK7VA/action/replication_record"}},"created_at":"2026-05-17T23:52:29.466395+00:00","updated_at":"2026-05-17T23:52:29.466395+00:00"}