{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IFNGWBTNLXOPNP4AOTYQU4JFQE","short_pith_number":"pith:IFNGWBTN","schema_version":"1.0","canonical_sha256":"415a6b066d5ddcf6bf8074f10a7125812f8dd858ea4d5888fa8619f8173a04d0","source":{"kind":"arxiv","id":"0904.2452","version":2},"attestation_state":"computed","paper":{"title":"Effective Bounds for P-Recursive Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Marc Mezzarobba","submitted_at":"2009-04-16T09:39:09Z","abstract_excerpt":"We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \\leq v_n$ for all $n$. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of $u_n$. We discuss applications to the evaluation of power series with guaranteed precision."},"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":"0904.2452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2009-04-16T09:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"8575626b81478632353b38d8e69ab652b4be958d7c0835408432a3f3ed2ee0f1","abstract_canon_sha256":"42ac5c7cfc002a5128c69a3c6e9b5b7ea161f36b9f928b7a26a0107ad0907caa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:45.807040Z","signature_b64":"ngHM5Vom/i2eMP3Ho2UgJpn0dr9/LSxaBlEbFF+IcArNsLdss4IlvlTdyeHMlVkB4rlPViHPmAcaYpBhi3KRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"415a6b066d5ddcf6bf8074f10a7125812f8dd858ea4d5888fa8619f8173a04d0","last_reissued_at":"2026-05-18T03:20:45.806436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:45.806436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Bounds for P-Recursive Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Marc Mezzarobba","submitted_at":"2009-04-16T09:39:09Z","abstract_excerpt":"We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \\leq v_n$ for all $n$. Generically, the bound is tight, in the sense that its asymptotic behaviour matches that of $u_n$. We discuss applications to the evaluation of power series with guaranteed precision."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2452","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":"0904.2452","created_at":"2026-05-18T03:20:45.806516+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2452v2","created_at":"2026-05-18T03:20:45.806516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2452","created_at":"2026-05-18T03:20:45.806516+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFNGWBTNLXOP","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFNGWBTNLXOPNP4A","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFNGWBTN","created_at":"2026-05-18T12:26:00.592388+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/IFNGWBTNLXOPNP4AOTYQU4JFQE","json":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE.json","graph_json":"https://pith.science/api/pith-number/IFNGWBTNLXOPNP4AOTYQU4JFQE/graph.json","events_json":"https://pith.science/api/pith-number/IFNGWBTNLXOPNP4AOTYQU4JFQE/events.json","paper":"https://pith.science/paper/IFNGWBTN"},"agent_actions":{"view_html":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE","download_json":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE.json","view_paper":"https://pith.science/paper/IFNGWBTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2452&json=true","fetch_graph":"https://pith.science/api/pith-number/IFNGWBTNLXOPNP4AOTYQU4JFQE/graph.json","fetch_events":"https://pith.science/api/pith-number/IFNGWBTNLXOPNP4AOTYQU4JFQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE/action/storage_attestation","attest_author":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE/action/author_attestation","sign_citation":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE/action/citation_signature","submit_replication":"https://pith.science/pith/IFNGWBTNLXOPNP4AOTYQU4JFQE/action/replication_record"}},"created_at":"2026-05-18T03:20:45.806516+00:00","updated_at":"2026-05-18T03:20:45.806516+00:00"}