{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QXBKB6FXQUQBCPOZWCBYJOVNAL","short_pith_number":"pith:QXBKB6FX","schema_version":"1.0","canonical_sha256":"85c2a0f8b78520113dd9b08384baad02e08d9d01c6a3622a9611199ae984fbc8","source":{"kind":"arxiv","id":"1212.4731","version":2},"attestation_state":"computed","paper":{"title":"Multiple precision evaluation of the Airy Ai function with reduced cancellation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Marc Mezzarobba (Inria Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), Sylvain Chevillard (INRIA Sophia Antipolis)","submitted_at":"2012-12-19T16:45:44Z","abstract_excerpt":"The series expansion at the origin of the Airy function Ai(x) is alternating and hence problematic to evaluate for x > 0 due to cancellation. Based on a method recently proposed by Gawronski, M\\\"uller, and Reinhard, we exhibit two functions F and G, both with nonnegative Taylor expansions at the origin, such that Ai(x) = G(x)/F(x). The sums are now well-conditioned, but the Taylor coefficients of G turn out to obey an ill-conditioned three-term recurrence. We use the classical Miller algorithm to overcome this issue. We bound all errors and our implementation allows an arbitrary and certified "},"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":"1212.4731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-12-19T16:45:44Z","cross_cats_sorted":[],"title_canon_sha256":"7cf382e199754d5c352e28408548db4d9628cff291f5d7b7e8dca097b3af84db","abstract_canon_sha256":"aba680ec365f1d09957e788b09b6bb8d85a74e0f0fc4f74f27e0df4928dd37af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:01.224097Z","signature_b64":"kUVo/x2rewAMrBk5I9G35YxnNBWd1ww2d+NZVziRXmTIhVKhATrx5AjrzDqWnxbKIOPTjjXi8+bAZ246ObkkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85c2a0f8b78520113dd9b08384baad02e08d9d01c6a3622a9611199ae984fbc8","last_reissued_at":"2026-05-18T03:27:01.223656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:01.223656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple precision evaluation of the Airy Ai function with reduced cancellation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Marc Mezzarobba (Inria Grenoble Rh\\^one-Alpes / LIP Laboratoire de l'Informatique du Parall\\'elisme), Sylvain Chevillard (INRIA Sophia Antipolis)","submitted_at":"2012-12-19T16:45:44Z","abstract_excerpt":"The series expansion at the origin of the Airy function Ai(x) is alternating and hence problematic to evaluate for x > 0 due to cancellation. Based on a method recently proposed by Gawronski, M\\\"uller, and Reinhard, we exhibit two functions F and G, both with nonnegative Taylor expansions at the origin, such that Ai(x) = G(x)/F(x). The sums are now well-conditioned, but the Taylor coefficients of G turn out to obey an ill-conditioned three-term recurrence. We use the classical Miller algorithm to overcome this issue. We bound all errors and our implementation allows an arbitrary and certified "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4731","kind":"arxiv","version":2},"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":"1212.4731","created_at":"2026-05-18T03:27:01.223713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4731v2","created_at":"2026-05-18T03:27:01.223713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4731","created_at":"2026-05-18T03:27:01.223713+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXBKB6FXQUQB","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXBKB6FXQUQBCPOZ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXBKB6FX","created_at":"2026-05-18T12:27:20.899486+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2111.10947","citing_title":"Comparison of Numerical Solvers for Differential Equations for Holonomic Gradient Method in Statistics","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL","json":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL.json","graph_json":"https://pith.science/api/pith-number/QXBKB6FXQUQBCPOZWCBYJOVNAL/graph.json","events_json":"https://pith.science/api/pith-number/QXBKB6FXQUQBCPOZWCBYJOVNAL/events.json","paper":"https://pith.science/paper/QXBKB6FX"},"agent_actions":{"view_html":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL","download_json":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL.json","view_paper":"https://pith.science/paper/QXBKB6FX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4731&json=true","fetch_graph":"https://pith.science/api/pith-number/QXBKB6FXQUQBCPOZWCBYJOVNAL/graph.json","fetch_events":"https://pith.science/api/pith-number/QXBKB6FXQUQBCPOZWCBYJOVNAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL/action/storage_attestation","attest_author":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL/action/author_attestation","sign_citation":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL/action/citation_signature","submit_replication":"https://pith.science/pith/QXBKB6FXQUQBCPOZWCBYJOVNAL/action/replication_record"}},"created_at":"2026-05-18T03:27:01.223713+00:00","updated_at":"2026-05-18T03:27:01.223713+00:00"}