{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HWSKFGDD4MYB5APLLV25I5LLRO","short_pith_number":"pith:HWSKFGDD","schema_version":"1.0","canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","source":{"kind":"arxiv","id":"1509.00206","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for the computation of Fourier Extensions of arbitrary length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Daan Huybrechs, Roel Matthysen","submitted_at":"2015-09-01T10:02:12Z","abstract_excerpt":"Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$ with $T>1$, a technique called Fourier extension or Fourier continuation. When constructed as the discrete least squares minimizer in equidistant points, the Fourier extension has been shown shown to converge geometrically in the truncation parameter $N$. A fast ${\\mathcal O}(N \\log^2 N)$ algorithm has been described to compute Fourier extensions for the ca"},"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":"1509.00206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-01T10:02:12Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"cd5e6faf25abe7f5caf36e500440376794de0bf6155cdf4c74c5ef7df4778aac","abstract_canon_sha256":"8f0c4f595f0c2f89a1a0a795e1bb02b1488558bc342d6d099c21ea4e2e8933a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:14.852542Z","signature_b64":"XrVn/bNUUn+dtY0RWL2Z3UT3wNo5UFprntsUGXPz39VQ93ZrWTKG7H0oy+nBIebBk42aNSLXhISm3NHZPb71AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","last_reissued_at":"2026-05-18T01:34:14.851784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:14.851784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for the computation of Fourier Extensions of arbitrary length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.NA","authors_text":"Daan Huybrechs, Roel Matthysen","submitted_at":"2015-09-01T10:02:12Z","abstract_excerpt":"Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$ with $T>1$, a technique called Fourier extension or Fourier continuation. When constructed as the discrete least squares minimizer in equidistant points, the Fourier extension has been shown shown to converge geometrically in the truncation parameter $N$. A fast ${\\mathcal O}(N \\log^2 N)$ algorithm has been described to compute Fourier extensions for the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00206","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":""},"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":"1509.00206","created_at":"2026-05-18T01:34:14.851925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00206v1","created_at":"2026-05-18T01:34:14.851925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00206","created_at":"2026-05-18T01:34:14.851925+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWSKFGDD4MYB","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWSKFGDD4MYB5APL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWSKFGDD","created_at":"2026-05-18T12:29:25.134429+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/HWSKFGDD4MYB5APLLV25I5LLRO","json":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO.json","graph_json":"https://pith.science/api/pith-number/HWSKFGDD4MYB5APLLV25I5LLRO/graph.json","events_json":"https://pith.science/api/pith-number/HWSKFGDD4MYB5APLLV25I5LLRO/events.json","paper":"https://pith.science/paper/HWSKFGDD"},"agent_actions":{"view_html":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO","download_json":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO.json","view_paper":"https://pith.science/paper/HWSKFGDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00206&json=true","fetch_graph":"https://pith.science/api/pith-number/HWSKFGDD4MYB5APLLV25I5LLRO/graph.json","fetch_events":"https://pith.science/api/pith-number/HWSKFGDD4MYB5APLLV25I5LLRO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/action/storage_attestation","attest_author":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/action/author_attestation","sign_citation":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/action/citation_signature","submit_replication":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/action/replication_record"}},"created_at":"2026-05-18T01:34:14.851925+00:00","updated_at":"2026-05-18T01:34:14.851925+00:00"}