{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C333SRONCZRZYBBZSC2J62ILQI","short_pith_number":"pith:C333SRON","schema_version":"1.0","canonical_sha256":"16f7b945cd16639c043990b49f690b8237c671985dda8dff25f3c3001c5ba586","source":{"kind":"arxiv","id":"1804.02964","version":1},"attestation_state":"computed","paper":{"title":"Definite Sums as Solutions of Linear Recurrences With Polynomial Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Marko Petkov\\v{s}ek","submitted_at":"2018-04-09T13:17:15Z","abstract_excerpt":"We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \\in \\mathbb{N}\\setminus\\{0\\}$, $a_1,a_2,\\ldots,a_m \\in \\mathbb{N}\\setminus\\{0\\}$ and $b_1,b_2,\\ldots,b_m \\in \\mathbb{K}$, returns a linear recurrence operator $L'$ with rational coefficients such that for every sequence $h$, \\[ L\\left(\\sum_{k=0}^\\infty \\prod_{i=1}^m \\binom{a_i n + b_i}{k} h_k\\right) = 0 \\] if and only if $L' h = 0$."},"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":"1804.02964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-04-09T13:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"89d60043e15b6294d86cd614cde20dcf32e8af3904242a129a4026bac22538cb","abstract_canon_sha256":"8563d5d205dc4358c59f5479319ac9410ebd1cf6e4ddf0c2e34a7a6b3b324b6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:57.826227Z","signature_b64":"R7hAL+N9ZAshi+hapm3x19jZ2wmTdJW+y+B6MJJ7TRq1732wImXuGcuQip/gagKvy8Q2L93cYTvnK8IvuX23DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16f7b945cd16639c043990b49f690b8237c671985dda8dff25f3c3001c5ba586","last_reissued_at":"2026-05-18T00:18:57.825522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:57.825522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Definite Sums as Solutions of Linear Recurrences With Polynomial Coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Marko Petkov\\v{s}ek","submitted_at":"2018-04-09T13:17:15Z","abstract_excerpt":"We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \\in \\mathbb{N}\\setminus\\{0\\}$, $a_1,a_2,\\ldots,a_m \\in \\mathbb{N}\\setminus\\{0\\}$ and $b_1,b_2,\\ldots,b_m \\in \\mathbb{K}$, returns a linear recurrence operator $L'$ with rational coefficients such that for every sequence $h$, \\[ L\\left(\\sum_{k=0}^\\infty \\prod_{i=1}^m \\binom{a_i n + b_i}{k} h_k\\right) = 0 \\] if and only if $L' h = 0$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02964","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":"1804.02964","created_at":"2026-05-18T00:18:57.825643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02964v1","created_at":"2026-05-18T00:18:57.825643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02964","created_at":"2026-05-18T00:18:57.825643+00:00"},{"alias_kind":"pith_short_12","alias_value":"C333SRONCZRZ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C333SRONCZRZYBBZ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C333SRON","created_at":"2026-05-18T12:32:16.446611+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/C333SRONCZRZYBBZSC2J62ILQI","json":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI.json","graph_json":"https://pith.science/api/pith-number/C333SRONCZRZYBBZSC2J62ILQI/graph.json","events_json":"https://pith.science/api/pith-number/C333SRONCZRZYBBZSC2J62ILQI/events.json","paper":"https://pith.science/paper/C333SRON"},"agent_actions":{"view_html":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI","download_json":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI.json","view_paper":"https://pith.science/paper/C333SRON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02964&json=true","fetch_graph":"https://pith.science/api/pith-number/C333SRONCZRZYBBZSC2J62ILQI/graph.json","fetch_events":"https://pith.science/api/pith-number/C333SRONCZRZYBBZSC2J62ILQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI/action/storage_attestation","attest_author":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI/action/author_attestation","sign_citation":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI/action/citation_signature","submit_replication":"https://pith.science/pith/C333SRONCZRZYBBZSC2J62ILQI/action/replication_record"}},"created_at":"2026-05-18T00:18:57.825643+00:00","updated_at":"2026-05-18T00:18:57.825643+00:00"}