{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZSKGAEMHA6LGXZKD77FXB3PHMD","short_pith_number":"pith:ZSKGAEMH","canonical_record":{"source":{"id":"1407.2802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-07-10T14:27:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8427f960b47ab448d6221ebfb22145240e60ff2003fa01996e3fb1e4249a2f8c","abstract_canon_sha256":"058e80badaabbfd4b670c8d3de1692a9a37bb9c9e1ac924c60328d49cd8d91f3"},"schema_version":"1.0"},"canonical_sha256":"cc9460118707966be543ffcb70ede760df62cb19ee4ef3450ab517e94d3dc8e7","source":{"kind":"arxiv","id":"1407.2802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2802","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2802v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2802","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZSKGAEMHA6LG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSKGAEMHA6LGXZKD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSKGAEMH","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZSKGAEMHA6LGXZKD77FXB3PHMD","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-07-10T14:27:23Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"8427f960b47ab448d6221ebfb22145240e60ff2003fa01996e3fb1e4249a2f8c","abstract_canon_sha256":"058e80badaabbfd4b670c8d3de1692a9a37bb9c9e1ac924c60328d49cd8d91f3"},"schema_version":"1.0"},"canonical_sha256":"cc9460118707966be543ffcb70ede760df62cb19ee4ef3450ab517e94d3dc8e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:53.632861Z","signature_b64":"gcSgqhmUlALHE1J+O9/uaOy1nLwitQZRnGmws1Ycd6FqjO06hCF0Lj1Vq9N1HREkGBNYSEuON6qa33bCQRZDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc9460118707966be543ffcb70ede760df62cb19ee4ef3450ab517e94d3dc8e7","last_reissued_at":"2026-05-18T02:47:53.632382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:53.632382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2802","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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSokHN9ajK/TEPFu3cj0Sh5EkP13z1YVO5nNkxeAUE1LhoMVhuK8UWD+5jBq3yvwgAsPaP2gM+OnQFjTq2WPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:35:45.253944Z"},"content_sha256":"55f45c04d899f03c3f9824d0f4d4f8b598604dca2ff157ec7d270db91db5e83f","schema_version":"1.0","event_id":"sha256:55f45c04d899f03c3f9824d0f4d4f8b598604dca2ff157ec7d270db91db5e83f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZSKGAEMHA6LGXZKD77FXB3PHMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rigorous uniform approximation of D-finite functions using Chebyshev expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.SC","authors_text":"Alexandre Benoit, Marc Mezzarobba (LIP6), Mioara Joldes (LAAS)","submitted_at":"2014-07-10T14:27:23Z","abstract_excerpt":"A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of such methods in the context of rigorous computing (where we need guarantees on the accuracy of the result), and from the complexity point of view. It is well-known that the order-n truncation of the Chebyshev expansion of a function over a given interval is a near-best uniform polynomial approximation of the function on that interval. In the case of solutions o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2802","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-18T02:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/fdE1D0UO4VIOY08OvQ1qADdsZW4tuS2LySWGnUSwqEA8W9lCeUJrTW3Q1JEWc/AxvSCtnEhklKpobYqwLpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:35:45.254471Z"},"content_sha256":"04edecdaa3aea0395a956b3e082c7e6ba8100c3e6c4b266ee8d3517720045b75","schema_version":"1.0","event_id":"sha256:04edecdaa3aea0395a956b3e082c7e6ba8100c3e6c4b266ee8d3517720045b75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/bundle.json","state_url":"https://pith.science/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/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-25T07:35:45Z","links":{"resolver":"https://pith.science/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD","bundle":"https://pith.science/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/bundle.json","state":"https://pith.science/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSKGAEMHA6LGXZKD77FXB3PHMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZSKGAEMHA6LGXZKD77FXB3PHMD","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":"058e80badaabbfd4b670c8d3de1692a9a37bb9c9e1ac924c60328d49cd8d91f3","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-07-10T14:27:23Z","title_canon_sha256":"8427f960b47ab448d6221ebfb22145240e60ff2003fa01996e3fb1e4249a2f8c"},"schema_version":"1.0","source":{"id":"1407.2802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2802","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2802v1","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2802","created_at":"2026-05-18T02:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZSKGAEMHA6LG","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSKGAEMHA6LGXZKD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSKGAEMH","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:04edecdaa3aea0395a956b3e082c7e6ba8100c3e6c4b266ee8d3517720045b75","target":"graph","created_at":"2026-05-18T02:47:53Z","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":"A wide range of numerical methods exists for computing polynomial approximations of solutions of ordinary differential equations based on Chebyshev series expansions or Chebyshev interpolation polynomials. We consider the application of such methods in the context of rigorous computing (where we need guarantees on the accuracy of the result), and from the complexity point of view. It is well-known that the order-n truncation of the Chebyshev expansion of a function over a given interval is a near-best uniform polynomial approximation of the function on that interval. In the case of solutions o","authors_text":"Alexandre Benoit, Marc Mezzarobba (LIP6), Mioara Joldes (LAAS)","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-07-10T14:27:23Z","title":"Rigorous uniform approximation of D-finite functions using Chebyshev expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2802","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:55f45c04d899f03c3f9824d0f4d4f8b598604dca2ff157ec7d270db91db5e83f","target":"record","created_at":"2026-05-18T02:47:53Z","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":"058e80badaabbfd4b670c8d3de1692a9a37bb9c9e1ac924c60328d49cd8d91f3","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-07-10T14:27:23Z","title_canon_sha256":"8427f960b47ab448d6221ebfb22145240e60ff2003fa01996e3fb1e4249a2f8c"},"schema_version":"1.0","source":{"id":"1407.2802","kind":"arxiv","version":1}},"canonical_sha256":"cc9460118707966be543ffcb70ede760df62cb19ee4ef3450ab517e94d3dc8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc9460118707966be543ffcb70ede760df62cb19ee4ef3450ab517e94d3dc8e7","first_computed_at":"2026-05-18T02:47:53.632382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:53.632382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gcSgqhmUlALHE1J+O9/uaOy1nLwitQZRnGmws1Ycd6FqjO06hCF0Lj1Vq9N1HREkGBNYSEuON6qa33bCQRZDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:53.632861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55f45c04d899f03c3f9824d0f4d4f8b598604dca2ff157ec7d270db91db5e83f","sha256:04edecdaa3aea0395a956b3e082c7e6ba8100c3e6c4b266ee8d3517720045b75"],"state_sha256":"712df23576dbd61c52bae950e5b37e96cba78e699b12cb554b8817d46ec135bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuajYwYVTmTDIK1Jd1aygOBv08D37mkeOYzXbiMFWWt6WK+owfj0mksvPZZDNjpD/+bXpC7dP/IzQgeg43s8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:35:45.257297Z","bundle_sha256":"62239eae77b7087cab9c609ff2fbdb265cadbc280d5b0d584a776b24a7153e02"}}