{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JH5BN7DHZA5FM4VR5SY4NAA7BO","short_pith_number":"pith:JH5BN7DH","schema_version":"1.0","canonical_sha256":"49fa16fc67c83a5672b1ecb1c6801f0bb8d27b3fb744d799523f3c5d239fde6c","source":{"kind":"arxiv","id":"1605.05082","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Mixed Creative Telescoping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan, Bruno Salvy, Louis Dumont","submitted_at":"2016-05-17T09:56:40Z","abstract_excerpt":"Creative telescoping is a powerful computer algebra paradigm -initiated by Doron Zeilberger in the 90's- for dealing with definite integrals and sums with parameters. We address the mixed continuous-discrete case, and focus on the integration of bivariate hypergeometric-hyperexponential terms. We design a new creative telescoping algorithm operating on this class of inputs, based on a Hermite-like reduction procedure. The new algorithm has two nice features: it is efficient and it delivers, for a suitable representation of the input, a minimal-order telescoper. Its analysis reveals tight bound"},"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":"1605.05082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-05-17T09:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"8c4517c1314d4c82dadfef11cd3fbe23c7cb5e44bac3e9db738dddf4cdf3c030","abstract_canon_sha256":"d931efe14e0020b5c6ce5784612ff1e526c9ef3c5fe879c9ac8dec915c1d263c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.450225Z","signature_b64":"5syEGkptJZM3ajZKpDq1OV6r6GFmla8RjmiM0cFXhOVQCosH/DnzUnUriJhaAuizs9wYLCbjF9X0QTxRfqsFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49fa16fc67c83a5672b1ecb1c6801f0bb8d27b3fb744d799523f3c5d239fde6c","last_reissued_at":"2026-05-18T01:14:37.449539Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.449539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Mixed Creative Telescoping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Alin Bostan, Bruno Salvy, Louis Dumont","submitted_at":"2016-05-17T09:56:40Z","abstract_excerpt":"Creative telescoping is a powerful computer algebra paradigm -initiated by Doron Zeilberger in the 90's- for dealing with definite integrals and sums with parameters. We address the mixed continuous-discrete case, and focus on the integration of bivariate hypergeometric-hyperexponential terms. We design a new creative telescoping algorithm operating on this class of inputs, based on a Hermite-like reduction procedure. The new algorithm has two nice features: it is efficient and it delivers, for a suitable representation of the input, a minimal-order telescoper. Its analysis reveals tight bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05082","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":"1605.05082","created_at":"2026-05-18T01:14:37.449656+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05082v1","created_at":"2026-05-18T01:14:37.449656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05082","created_at":"2026-05-18T01:14:37.449656+00:00"},{"alias_kind":"pith_short_12","alias_value":"JH5BN7DHZA5F","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JH5BN7DHZA5FM4VR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JH5BN7DH","created_at":"2026-05-18T12:30:25.849896+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/JH5BN7DHZA5FM4VR5SY4NAA7BO","json":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO.json","graph_json":"https://pith.science/api/pith-number/JH5BN7DHZA5FM4VR5SY4NAA7BO/graph.json","events_json":"https://pith.science/api/pith-number/JH5BN7DHZA5FM4VR5SY4NAA7BO/events.json","paper":"https://pith.science/paper/JH5BN7DH"},"agent_actions":{"view_html":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO","download_json":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO.json","view_paper":"https://pith.science/paper/JH5BN7DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05082&json=true","fetch_graph":"https://pith.science/api/pith-number/JH5BN7DHZA5FM4VR5SY4NAA7BO/graph.json","fetch_events":"https://pith.science/api/pith-number/JH5BN7DHZA5FM4VR5SY4NAA7BO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO/action/storage_attestation","attest_author":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO/action/author_attestation","sign_citation":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO/action/citation_signature","submit_replication":"https://pith.science/pith/JH5BN7DHZA5FM4VR5SY4NAA7BO/action/replication_record"}},"created_at":"2026-05-18T01:14:37.449656+00:00","updated_at":"2026-05-18T01:14:37.449656+00:00"}