{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RBQUOCMJ6GFRQ74B5PXKKMIT6Z","short_pith_number":"pith:RBQUOCMJ","schema_version":"1.0","canonical_sha256":"8861470989f18b187f81ebeea53113f64746b4c013ac6a85cb46464212862795","source":{"kind":"arxiv","id":"0912.1379","version":1},"attestation_state":"computed","paper":{"title":"A fast algorithm for the linear canonical transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jared Figueroa, Rafael G. Campos","submitted_at":"2009-12-08T00:45:35Z","abstract_excerpt":"In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(N*Log N) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a u"},"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":"0912.1379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2009-12-08T00:45:35Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"5912d69870f6ed0d1090f4227d41fed6698637b4f87fa1876447e176fa66ba8c","abstract_canon_sha256":"77655a0e74b0bea0fe074d2802544db9318fe39de700d1460ed9db117534b060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T23:06:31.196329Z","signature_b64":"tqB0TFegWCfkfNwdehPPxv6If7xumB7QqWzINvvoLyRNonwigPTTtX2/5MgdaUELyp4+0JpDEUWPFr6lM+G/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8861470989f18b187f81ebeea53113f64746b4c013ac6a85cb46464212862795","last_reissued_at":"2026-06-03T23:06:31.195879Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T23:06:31.195879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm for the linear canonical transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jared Figueroa, Rafael G. Campos","submitted_at":"2009-12-08T00:45:35Z","abstract_excerpt":"In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(N*Log N) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1379","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0912.1379/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":"0912.1379","created_at":"2026-06-03T23:06:31.195943+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1379v1","created_at":"2026-06-03T23:06:31.195943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1379","created_at":"2026-06-03T23:06:31.195943+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBQUOCMJ6GFR","created_at":"2026-06-03T23:06:31.195943+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBQUOCMJ6GFRQ74B","created_at":"2026-06-03T23:06:31.195943+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBQUOCMJ","created_at":"2026-06-03T23:06:31.195943+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/RBQUOCMJ6GFRQ74B5PXKKMIT6Z","json":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z.json","graph_json":"https://pith.science/api/pith-number/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/graph.json","events_json":"https://pith.science/api/pith-number/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/events.json","paper":"https://pith.science/paper/RBQUOCMJ"},"agent_actions":{"view_html":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z","download_json":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z.json","view_paper":"https://pith.science/paper/RBQUOCMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1379&json=true","fetch_graph":"https://pith.science/api/pith-number/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/action/storage_attestation","attest_author":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/action/author_attestation","sign_citation":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/action/citation_signature","submit_replication":"https://pith.science/pith/RBQUOCMJ6GFRQ74B5PXKKMIT6Z/action/replication_record"}},"created_at":"2026-06-03T23:06:31.195943+00:00","updated_at":"2026-06-03T23:06:31.195943+00:00"}