{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GYQZZCBQOHTSYYURYZ7F5QGT2M","short_pith_number":"pith:GYQZZCBQ","schema_version":"1.0","canonical_sha256":"36219c883071e72c6291c67e5ec0d3d33526207a1e914f4f3af99cf791501422","source":{"kind":"arxiv","id":"1210.4960","version":3},"attestation_state":"computed","paper":{"title":"A new Truncated Fourier Transform algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Andrew Arnold","submitted_at":"2012-10-17T21:16:30Z","abstract_excerpt":"Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth \"jumps\" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in terms of ring operations, is comparable to existing not-in-place TFT methods. We also describe a transformation that maps between two families of TFT algorithms that use different sets of evaluation points."},"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":"1210.4960","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-10-17T21:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"14ca2e6e97623c0ab083c06188dd6ff7d6f6e3e68cd9bcd07aa665d98cb6e359","abstract_canon_sha256":"5811f37475e5376a4cf7da79b3a50648287f529e70f7f2c9d202e5e60a0f4763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:13.591794Z","signature_b64":"E45Qklmxn/k06VF1RWy/kY3nYmfRVx64SsJiacPl53AqPYSxNvrOuwJIODhWw1jY1Mh7D+V7LCJNk3nTZZyoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36219c883071e72c6291c67e5ec0d3d33526207a1e914f4f3af99cf791501422","last_reissued_at":"2026-05-18T03:35:13.591056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:13.591056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Truncated Fourier Transform algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Andrew Arnold","submitted_at":"2012-10-17T21:16:30Z","abstract_excerpt":"Truncated Fourier Transforms (TFTs), first introduced by Van der Hoeven, refer to a family of algorithms that attempt to smooth \"jumps\" in complexity exhibited by FFT algorithms. We present an in-place TFT whose time complexity, measured in terms of ring operations, is comparable to existing not-in-place TFT methods. We also describe a transformation that maps between two families of TFT algorithms that use different sets of evaluation points."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4960","kind":"arxiv","version":3},"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":"1210.4960","created_at":"2026-05-18T03:35:13.591196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4960v3","created_at":"2026-05-18T03:35:13.591196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4960","created_at":"2026-05-18T03:35:13.591196+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYQZZCBQOHTS","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYQZZCBQOHTSYYUR","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYQZZCBQ","created_at":"2026-05-18T12:27:06.952714+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/GYQZZCBQOHTSYYURYZ7F5QGT2M","json":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M.json","graph_json":"https://pith.science/api/pith-number/GYQZZCBQOHTSYYURYZ7F5QGT2M/graph.json","events_json":"https://pith.science/api/pith-number/GYQZZCBQOHTSYYURYZ7F5QGT2M/events.json","paper":"https://pith.science/paper/GYQZZCBQ"},"agent_actions":{"view_html":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M","download_json":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M.json","view_paper":"https://pith.science/paper/GYQZZCBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4960&json=true","fetch_graph":"https://pith.science/api/pith-number/GYQZZCBQOHTSYYURYZ7F5QGT2M/graph.json","fetch_events":"https://pith.science/api/pith-number/GYQZZCBQOHTSYYURYZ7F5QGT2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M/action/storage_attestation","attest_author":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M/action/author_attestation","sign_citation":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M/action/citation_signature","submit_replication":"https://pith.science/pith/GYQZZCBQOHTSYYURYZ7F5QGT2M/action/replication_record"}},"created_at":"2026-05-18T03:35:13.591196+00:00","updated_at":"2026-05-18T03:35:13.591196+00:00"}