{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:TKWNZD45773LPOPKDQWDKOD5HF","short_pith_number":"pith:TKWNZD45","schema_version":"1.0","canonical_sha256":"9aacdc8f9dfff6b7b9ea1c2c35387d3974b215d769ddefe6890532e7c97425a5","source":{"kind":"arxiv","id":"0804.2373","version":1},"attestation_state":"computed","paper":{"title":"Fast Conversion Algorithms for Orthogonal Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan (INRIA Rocquencourt), Bruno Salvy (INRIA Rocquencourt), \\'Eric Schost","submitted_at":"2008-04-15T12:47:14Z","abstract_excerpt":"We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation."},"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":"0804.2373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2008-04-15T12:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"119ee0165f60b07c772d761313d6394d9ade167bd6ef43fe099bfbd490ba5648","abstract_canon_sha256":"ade52ee63d2c4a76c7a91810369c4bbc3db08b7dfd6bb1bf08d5a8838e505a6e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:45.832392Z","signature_b64":"qxwVhqPHp2+L8TIbW2FnqazH92CqQsXYlru3UV2626ybTMO08C1emXLivvmhIO29fHVbNb0z093uNjz5+sQIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aacdc8f9dfff6b7b9ea1c2c35387d3974b215d769ddefe6890532e7c97425a5","last_reissued_at":"2026-05-18T03:20:45.831688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:45.831688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Conversion Algorithms for Orthogonal Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan (INRIA Rocquencourt), Bruno Salvy (INRIA Rocquencourt), \\'Eric Schost","submitted_at":"2008-04-15T12:47:14Z","abstract_excerpt":"We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.2373","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":"0804.2373","created_at":"2026-05-18T03:20:45.831792+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.2373v1","created_at":"2026-05-18T03:20:45.831792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.2373","created_at":"2026-05-18T03:20:45.831792+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKWNZD45773L","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKWNZD45773LPOPK","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKWNZD45","created_at":"2026-05-18T12:25:58.018023+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/TKWNZD45773LPOPKDQWDKOD5HF","json":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF.json","graph_json":"https://pith.science/api/pith-number/TKWNZD45773LPOPKDQWDKOD5HF/graph.json","events_json":"https://pith.science/api/pith-number/TKWNZD45773LPOPKDQWDKOD5HF/events.json","paper":"https://pith.science/paper/TKWNZD45"},"agent_actions":{"view_html":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF","download_json":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF.json","view_paper":"https://pith.science/paper/TKWNZD45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.2373&json=true","fetch_graph":"https://pith.science/api/pith-number/TKWNZD45773LPOPKDQWDKOD5HF/graph.json","fetch_events":"https://pith.science/api/pith-number/TKWNZD45773LPOPKDQWDKOD5HF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF/action/storage_attestation","attest_author":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF/action/author_attestation","sign_citation":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF/action/citation_signature","submit_replication":"https://pith.science/pith/TKWNZD45773LPOPKDQWDKOD5HF/action/replication_record"}},"created_at":"2026-05-18T03:20:45.831792+00:00","updated_at":"2026-05-18T03:20:45.831792+00:00"}