{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LEKP3DXET37DL72ZL65EZZP3V3","short_pith_number":"pith:LEKP3DXE","schema_version":"1.0","canonical_sha256":"5914fd8ee49efe35ff595fba4ce5fbaed464862c4e09f7700459a1ddffe40a85","source":{"kind":"arxiv","id":"2307.07216","version":2},"attestation_state":"computed","paper":{"title":"Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Hadrien Brochet","submitted_at":"2023-07-14T08:20:15Z","abstract_excerpt":"Creative telescoping is an algorithmic method initiated by Zeilberger to compute definite sums by synthesizing summands that telescope, called certificates. We describe a creative telescoping algorithm that computes telescopers for definite sums of D-finite functions as well as the associated certificates in a compact form. The algorithm relies on a discrete analogue of the generalized Hermite reduction, or equivalently, a generalization of the Abramov-Petkov\\v{s}ek reduction. We provide a Maple implementation with good timings on a variety of examples."},"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":"2307.07216","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SC","submitted_at":"2023-07-14T08:20:15Z","cross_cats_sorted":[],"title_canon_sha256":"a61d8bcfd4633c99b47159de17e2b5091fc0f866f457e0fbcd01a52619e8ecd6","abstract_canon_sha256":"1e85686ad51c0b0dda24de0253730ae311652b46455436972c202f9d3b062893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:15.374586Z","signature_b64":"+y4LfeeKiH1aB2jx0fWynspxojGKy0w6ZShytO4wCZR7IqhpGAoZNG9LLRkFWXufv9pp6CTuuyKtWaAWx9seBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5914fd8ee49efe35ff595fba4ce5fbaed464862c4e09f7700459a1ddffe40a85","last_reissued_at":"2026-07-05T07:14:15.374079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:15.374079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Hadrien Brochet","submitted_at":"2023-07-14T08:20:15Z","abstract_excerpt":"Creative telescoping is an algorithmic method initiated by Zeilberger to compute definite sums by synthesizing summands that telescope, called certificates. We describe a creative telescoping algorithm that computes telescopers for definite sums of D-finite functions as well as the associated certificates in a compact form. The algorithm relies on a discrete analogue of the generalized Hermite reduction, or equivalently, a generalization of the Abramov-Petkov\\v{s}ek reduction. We provide a Maple implementation with good timings on a variety of examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07216","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.07216/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.07216","created_at":"2026-07-05T07:14:15.374141+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.07216v2","created_at":"2026-07-05T07:14:15.374141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07216","created_at":"2026-07-05T07:14:15.374141+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEKP3DXET37D","created_at":"2026-07-05T07:14:15.374141+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEKP3DXET37DL72Z","created_at":"2026-07-05T07:14:15.374141+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEKP3DXE","created_at":"2026-07-05T07:14:15.374141+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08245","citing_title":"Fast Ramanujan-type Series for Logarithms. Part I","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3","json":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3.json","graph_json":"https://pith.science/api/pith-number/LEKP3DXET37DL72ZL65EZZP3V3/graph.json","events_json":"https://pith.science/api/pith-number/LEKP3DXET37DL72ZL65EZZP3V3/events.json","paper":"https://pith.science/paper/LEKP3DXE"},"agent_actions":{"view_html":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3","download_json":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3.json","view_paper":"https://pith.science/paper/LEKP3DXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.07216&json=true","fetch_graph":"https://pith.science/api/pith-number/LEKP3DXET37DL72ZL65EZZP3V3/graph.json","fetch_events":"https://pith.science/api/pith-number/LEKP3DXET37DL72ZL65EZZP3V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3/action/storage_attestation","attest_author":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3/action/author_attestation","sign_citation":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3/action/citation_signature","submit_replication":"https://pith.science/pith/LEKP3DXET37DL72ZL65EZZP3V3/action/replication_record"}},"created_at":"2026-07-05T07:14:15.374141+00:00","updated_at":"2026-07-05T07:14:15.374141+00:00"}