{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5G6GMIMWYMI2EQQHSIWMZQARD6","short_pith_number":"pith:5G6GMIMW","schema_version":"1.0","canonical_sha256":"e9bc662196c311a24207922cccc0111fa5380068fdcd4625e6b5e6c48c73b368","source":{"kind":"arxiv","id":"1609.00829","version":1},"attestation_state":"computed","paper":{"title":"Efficient computation of Laguerre polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.CA"],"primary_cat":"cs.NA","authors_text":"A. Gil, J. Segura, N. M. Temme","submitted_at":"2016-09-03T13:59:43Z","abstract_excerpt":"An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials $L^{(\\alpha)}_n(z)$ are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for $n$ large and $\\alpha$ small, are used depending on the parameter region.\n  Based on tests of contiguous relations in the parameter $\\alpha$ and the degree $n$ satisfied by the polynomials, we claim that a relative accuracy close or better than $10^{-12}$ can be obtained using the module LaguerrePol for computing the functions $L^{(\\alpha)"},"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":"1609.00829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2016-09-03T13:59:43Z","cross_cats_sorted":["cs.MS","math.CA"],"title_canon_sha256":"8981d5f23863fcaa285dd5f390d70d56c77a1392d03e0b174c6b642f7a4a6002","abstract_canon_sha256":"e5b59d097e83f32fee5a8c6aa73977202587877531bbcadc3730ef90d2c0fe79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:01.914852Z","signature_b64":"0kX/0kmx3n/eJlargK030bwwWGn/bAb5Is1IdIkbqghdBmBz/Qqt+WNoW3a79DYJrk7XnFpuzh8rGy9O/cfrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9bc662196c311a24207922cccc0111fa5380068fdcd4625e6b5e6c48c73b368","last_reissued_at":"2026-05-18T00:26:01.914241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:01.914241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computation of Laguerre polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.CA"],"primary_cat":"cs.NA","authors_text":"A. Gil, J. Segura, N. M. Temme","submitted_at":"2016-09-03T13:59:43Z","abstract_excerpt":"An efficient algorithm and a Fortran 90 module (LaguerrePol) for computing Laguerre polynomials $L^{(\\alpha)}_n(z)$ are presented. The standard three-term recurrence relation satisfied by the polynomials and different types of asymptotic expansions valid for $n$ large and $\\alpha$ small, are used depending on the parameter region.\n  Based on tests of contiguous relations in the parameter $\\alpha$ and the degree $n$ satisfied by the polynomials, we claim that a relative accuracy close or better than $10^{-12}$ can be obtained using the module LaguerrePol for computing the functions $L^{(\\alpha)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00829","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":"1609.00829","created_at":"2026-05-18T00:26:01.914367+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00829v1","created_at":"2026-05-18T00:26:01.914367+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00829","created_at":"2026-05-18T00:26:01.914367+00:00"},{"alias_kind":"pith_short_12","alias_value":"5G6GMIMWYMI2","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5G6GMIMWYMI2EQQH","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5G6GMIMW","created_at":"2026-05-18T12:30:01.593930+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/5G6GMIMWYMI2EQQHSIWMZQARD6","json":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6.json","graph_json":"https://pith.science/api/pith-number/5G6GMIMWYMI2EQQHSIWMZQARD6/graph.json","events_json":"https://pith.science/api/pith-number/5G6GMIMWYMI2EQQHSIWMZQARD6/events.json","paper":"https://pith.science/paper/5G6GMIMW"},"agent_actions":{"view_html":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6","download_json":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6.json","view_paper":"https://pith.science/paper/5G6GMIMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00829&json=true","fetch_graph":"https://pith.science/api/pith-number/5G6GMIMWYMI2EQQHSIWMZQARD6/graph.json","fetch_events":"https://pith.science/api/pith-number/5G6GMIMWYMI2EQQHSIWMZQARD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6/action/storage_attestation","attest_author":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6/action/author_attestation","sign_citation":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6/action/citation_signature","submit_replication":"https://pith.science/pith/5G6GMIMWYMI2EQQHSIWMZQARD6/action/replication_record"}},"created_at":"2026-05-18T00:26:01.914367+00:00","updated_at":"2026-05-18T00:26:01.914367+00:00"}