{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HWSKFGDD4MYB5APLLV25I5LLRO","short_pith_number":"pith:HWSKFGDD","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"},"canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","source":{"kind":"arxiv","id":"1509.00206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00206","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00206v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00206","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"HWSKFGDD4MYB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWSKFGDD4MYB5APL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWSKFGDD","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HWSKFGDD4MYB5APLLV25I5LLRO","target":"record","payload":{"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"},"canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","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"},"source_kind":"arxiv","source_id":"1509.00206","source_version":1,"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-05-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SwNIE4zfPFJrFyHpEdBuJQSep0c2O6RUQLG2esF3vxcHbAflRG1LUgu69UjdsdlAWrfck7N8gKAX60xpw683DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:07:42.842513Z"},"content_sha256":"136a4f84de264e61d29bd4ddaf79fbcfad48e539337a08a2e23db159a1edf6cf","schema_version":"1.0","event_id":"sha256:136a4f84de264e61d29bd4ddaf79fbcfad48e539337a08a2e23db159a1edf6cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HWSKFGDD4MYB5APLLV25I5LLRO","target":"graph","payload":{"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"},"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-05-18T01:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JHkJWf2kgr8PgdG6lL+Q0k7kQfvN7GP5MNBy0V9Yu3rJGrSCDM62+lz08DGVLeTG8/UXKpQNfLQ7UDYMVhMpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:07:42.842873Z"},"content_sha256":"b54e9db633b9a6ce3ee53a2ae6aad9c62e891bb1bb285055c8c3ed321562e451","schema_version":"1.0","event_id":"sha256:b54e9db633b9a6ce3ee53a2ae6aad9c62e891bb1bb285055c8c3ed321562e451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/bundle.json","state_url":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWSKFGDD4MYB5APLLV25I5LLRO/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-06-23T14:07:42Z","links":{"resolver":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO","bundle":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/bundle.json","state":"https://pith.science/pith/HWSKFGDD4MYB5APLLV25I5LLRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWSKFGDD4MYB5APLLV25I5LLRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HWSKFGDD4MYB5APLLV25I5LLRO","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":"8f0c4f595f0c2f89a1a0a795e1bb02b1488558bc342d6d099c21ea4e2e8933a4","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-01T10:02:12Z","title_canon_sha256":"cd5e6faf25abe7f5caf36e500440376794de0bf6155cdf4c74c5ef7df4778aac"},"schema_version":"1.0","source":{"id":"1509.00206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00206","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00206v1","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00206","created_at":"2026-05-18T01:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"HWSKFGDD4MYB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HWSKFGDD4MYB5APL","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HWSKFGDD","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:b54e9db633b9a6ce3ee53a2ae6aad9c62e891bb1bb285055c8c3ed321562e451","target":"graph","created_at":"2026-05-18T01:34:14Z","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"},"paper":{"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","authors_text":"Daan Huybrechs, Roel Matthysen","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-01T10:02:12Z","title":"Fast Algorithms for the computation of Fourier Extensions of arbitrary length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00206","kind":"arxiv","version":1},"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:136a4f84de264e61d29bd4ddaf79fbcfad48e539337a08a2e23db159a1edf6cf","target":"record","created_at":"2026-05-18T01:34:14Z","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":"8f0c4f595f0c2f89a1a0a795e1bb02b1488558bc342d6d099c21ea4e2e8933a4","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2015-09-01T10:02:12Z","title_canon_sha256":"cd5e6faf25abe7f5caf36e500440376794de0bf6155cdf4c74c5ef7df4778aac"},"schema_version":"1.0","source":{"id":"1509.00206","kind":"arxiv","version":1}},"canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3da4a29863e3301e81eb5d75d4756b8b816f395b905e93f1d371b4c5cdd09d9d","first_computed_at":"2026-05-18T01:34:14.851784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:14.851784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XrVn/bNUUn+dtY0RWL2Z3UT3wNo5UFprntsUGXPz39VQ93ZrWTKG7H0oy+nBIebBk42aNSLXhISm3NHZPb71AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:14.852542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:136a4f84de264e61d29bd4ddaf79fbcfad48e539337a08a2e23db159a1edf6cf","sha256:b54e9db633b9a6ce3ee53a2ae6aad9c62e891bb1bb285055c8c3ed321562e451"],"state_sha256":"5903f65481a5db136b68264c4f89d6f3748c36eda5c2c8d15f49334536c81e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"id+0mV09B81apLjKiL0IpWCQ/qTrGJ2i6VnQ/uA50Q/oT0IpMlHmpAQnoGhnAcbUHYw8KICQksF/2L73sP73CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:07:42.844873Z","bundle_sha256":"9f466316931282aba14696952dbd414efacd38db782058e406b8c8e916803dc4"}}