{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D3BPWYVAEGSLJ5MBO5EDZ75G74","short_pith_number":"pith:D3BPWYVA","schema_version":"1.0","canonical_sha256":"1ec2fb62a021a4b4f58177483cffa6ff396dad0b5ab58e68fcc7624fd1076c98","source":{"kind":"arxiv","id":"2501.03837","version":2},"attestation_state":"computed","paper":{"title":"A Unified Reduction for Hypergeometric and q-Hypergeometric Creative Telescoping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Hao Du, Hui Huang, Shaoshi Chen, Yiman Gao, Ziming Li","submitted_at":"2025-01-07T14:47:02Z","abstract_excerpt":"We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general framework, we develop a unified reduction algorithm, and subsequently a creative telescoping algorithm, applicable to both hypergeometric terms and their $q$-analogues. Our algorithms allow to split up the usual shift case and the $q$-shift case only when it is really necessary, and thus instantly reveal the intrinsic differences between these two cases. Computat"},"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":"2501.03837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2025-01-07T14:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"642b8f9915741e3e771a42bb6c67b4396c051a5f3ce7153245c42713fae21045","abstract_canon_sha256":"d6454ca5539f7e219517bc2db0913447bd0b528553adbb03a381b631be01383c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:00.283451Z","signature_b64":"pPFo5ClJgu40cOueglUL5sdY2DyL3OSOS1nbySUTlXiNmfWfcaCcnBiWN800oUFuG6fXNyCBW/wY/KMoB51hDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec2fb62a021a4b4f58177483cffa6ff396dad0b5ab58e68fcc7624fd1076c98","last_reissued_at":"2026-07-05T11:44:00.282982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:00.282982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Reduction for Hypergeometric and q-Hypergeometric Creative Telescoping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Hao Du, Hui Huang, Shaoshi Chen, Yiman Gao, Ziming Li","submitted_at":"2025-01-07T14:47:02Z","abstract_excerpt":"We adapt the theory of normal and special polynomials from symbolic integration to the summation setting, and then built up a general framework embracing both the usual shift case and the $q$-shift case. In the context of this general framework, we develop a unified reduction algorithm, and subsequently a creative telescoping algorithm, applicable to both hypergeometric terms and their $q$-analogues. Our algorithms allow to split up the usual shift case and the $q$-shift case only when it is really necessary, and thus instantly reveal the intrinsic differences between these two cases. Computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03837","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/2501.03837/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":"2501.03837","created_at":"2026-07-05T11:44:00.283038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03837v2","created_at":"2026-07-05T11:44:00.283038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03837","created_at":"2026-07-05T11:44:00.283038+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3BPWYVAEGSL","created_at":"2026-07-05T11:44:00.283038+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3BPWYVAEGSLJ5MB","created_at":"2026-07-05T11:44:00.283038+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3BPWYVA","created_at":"2026-07-05T11:44:00.283038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08767","citing_title":"Telescoping Algorithms for $\\Sigma^*$-Extensions via Complete Reductions","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74","json":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74.json","graph_json":"https://pith.science/api/pith-number/D3BPWYVAEGSLJ5MBO5EDZ75G74/graph.json","events_json":"https://pith.science/api/pith-number/D3BPWYVAEGSLJ5MBO5EDZ75G74/events.json","paper":"https://pith.science/paper/D3BPWYVA"},"agent_actions":{"view_html":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74","download_json":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74.json","view_paper":"https://pith.science/paper/D3BPWYVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03837&json=true","fetch_graph":"https://pith.science/api/pith-number/D3BPWYVAEGSLJ5MBO5EDZ75G74/graph.json","fetch_events":"https://pith.science/api/pith-number/D3BPWYVAEGSLJ5MBO5EDZ75G74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74/action/storage_attestation","attest_author":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74/action/author_attestation","sign_citation":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74/action/citation_signature","submit_replication":"https://pith.science/pith/D3BPWYVAEGSLJ5MBO5EDZ75G74/action/replication_record"}},"created_at":"2026-07-05T11:44:00.283038+00:00","updated_at":"2026-07-05T11:44:00.283038+00:00"}