{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:S22V3FQAMHJUAOBCTDCHFGSFZX","short_pith_number":"pith:S22V3FQA","schema_version":"1.0","canonical_sha256":"96b55d960061d340382298c4729a45cde599c39882b5ed27fd66f07388afc4c7","source":{"kind":"arxiv","id":"1612.05869","version":1},"attestation_state":"computed","paper":{"title":"Linear combinations of prime powers in sums of terms of binary recurrence sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"N. K. Meher, S. S. Rout","submitted_at":"2016-12-18T08:28:16Z","abstract_excerpt":"Let $\\{ {U_{n}\\}_{n \\geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\\{p_1,\\ldots, p_s\\}$ be fixed prime numbers and $\\{b_1,\\ldots ,b_s\\}$ be fixed non-negative integers. In this paper, we obtain the finiteness result for the solution of the Diophantine equation $U_{n_{1}} + \\cdots + U_{n_{t}} = b_1 p_1^{z_1} + \\cdots+ b_s p_s^{z_s}\n  $ under certain assumptions. Moreover, we explicitly solve the equation $F_{n_1}+ F_{n_2}= 2^{z_1} +3^{z_2}$, in non-negative integers $n_1, n_2, z_1, z_2$ with $z_2\\geq z_1$. The main tools used in this work are the lowe"},"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":"1612.05869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-18T08:28:16Z","cross_cats_sorted":[],"title_canon_sha256":"d40bd38eb39c3517f8ea7928930edf94821aef255fe7a4d06d5dffdb466562a3","abstract_canon_sha256":"93a70ac54244d931cf1621a0a71f5dee6513364abf25aaaa8611e408d3b7fe2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:46.459270Z","signature_b64":"RvC8AEWwdlnLNlad5vhqSWbzLyrz7lRyTGExoJ5NgrSAb1/nJztPmVOhEQZ6gznHPQ7zf6vk6pDawn6UTsjWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b55d960061d340382298c4729a45cde599c39882b5ed27fd66f07388afc4c7","last_reissued_at":"2026-05-18T00:54:46.458856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:46.458856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear combinations of prime powers in sums of terms of binary recurrence sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"N. K. Meher, S. S. Rout","submitted_at":"2016-12-18T08:28:16Z","abstract_excerpt":"Let $\\{ {U_{n}\\}_{n \\geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\\{p_1,\\ldots, p_s\\}$ be fixed prime numbers and $\\{b_1,\\ldots ,b_s\\}$ be fixed non-negative integers. In this paper, we obtain the finiteness result for the solution of the Diophantine equation $U_{n_{1}} + \\cdots + U_{n_{t}} = b_1 p_1^{z_1} + \\cdots+ b_s p_s^{z_s}\n  $ under certain assumptions. Moreover, we explicitly solve the equation $F_{n_1}+ F_{n_2}= 2^{z_1} +3^{z_2}$, in non-negative integers $n_1, n_2, z_1, z_2$ with $z_2\\geq z_1$. The main tools used in this work are the lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.05869","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":"1612.05869","created_at":"2026-05-18T00:54:46.458913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.05869v1","created_at":"2026-05-18T00:54:46.458913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.05869","created_at":"2026-05-18T00:54:46.458913+00:00"},{"alias_kind":"pith_short_12","alias_value":"S22V3FQAMHJU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"S22V3FQAMHJUAOBC","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"S22V3FQA","created_at":"2026-05-18T12:30:41.710351+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/S22V3FQAMHJUAOBCTDCHFGSFZX","json":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX.json","graph_json":"https://pith.science/api/pith-number/S22V3FQAMHJUAOBCTDCHFGSFZX/graph.json","events_json":"https://pith.science/api/pith-number/S22V3FQAMHJUAOBCTDCHFGSFZX/events.json","paper":"https://pith.science/paper/S22V3FQA"},"agent_actions":{"view_html":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX","download_json":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX.json","view_paper":"https://pith.science/paper/S22V3FQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.05869&json=true","fetch_graph":"https://pith.science/api/pith-number/S22V3FQAMHJUAOBCTDCHFGSFZX/graph.json","fetch_events":"https://pith.science/api/pith-number/S22V3FQAMHJUAOBCTDCHFGSFZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX/action/storage_attestation","attest_author":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX/action/author_attestation","sign_citation":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX/action/citation_signature","submit_replication":"https://pith.science/pith/S22V3FQAMHJUAOBCTDCHFGSFZX/action/replication_record"}},"created_at":"2026-05-18T00:54:46.458913+00:00","updated_at":"2026-05-18T00:54:46.458913+00:00"}