{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OKPP7LDYRSJY7VFF43GOXVOL4G","short_pith_number":"pith:OKPP7LDY","schema_version":"1.0","canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","source":{"kind":"arxiv","id":"1409.8514","version":1},"attestation_state":"computed","paper":{"title":"Powers of two as sums of two $k-$Fibonacci numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carlos A. G\\'omez, Florian Luca, Jhon J. Bravo","submitted_at":"2014-09-30T12:19:34Z","abstract_excerpt":"For an integer $k\\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are sums of two $k-$Fibonacci numbers. The main tools used in this work are lower bounds for linear forms in logarithms and a version of the Baker--Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of \\cite{BL2} and \\cite{BL13}."},"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":"1409.8514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-30T12:19:34Z","cross_cats_sorted":[],"title_canon_sha256":"6c67257bb06dbea274d31c0fb4df8f638b61542c4fe1d1876ac2afd967efee57","abstract_canon_sha256":"3f8858c73406d6142523745ef22b5ce943b449af85e3ac0ca441e7808b4727e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:25.179626Z","signature_b64":"zBB3dd4Qy+Vi9cVtCurrWRLEwbleRp4qv1kD9LwkopuUBauAsd8OrgIFrXHphkvqQ8zuFUzhv2HMiSHFmE3rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","last_reissued_at":"2026-05-18T02:41:25.179207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:25.179207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Powers of two as sums of two $k-$Fibonacci numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carlos A. G\\'omez, Florian Luca, Jhon J. Bravo","submitted_at":"2014-09-30T12:19:34Z","abstract_excerpt":"For an integer $k\\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are sums of two $k-$Fibonacci numbers. The main tools used in this work are lower bounds for linear forms in logarithms and a version of the Baker--Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of \\cite{BL2} and \\cite{BL13}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8514","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":"1409.8514","created_at":"2026-05-18T02:41:25.179262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8514v1","created_at":"2026-05-18T02:41:25.179262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8514","created_at":"2026-05-18T02:41:25.179262+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKPP7LDYRSJY","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKPP7LDYRSJY7VFF","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKPP7LDY","created_at":"2026-05-18T12:28:41.024544+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/OKPP7LDYRSJY7VFF43GOXVOL4G","json":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G.json","graph_json":"https://pith.science/api/pith-number/OKPP7LDYRSJY7VFF43GOXVOL4G/graph.json","events_json":"https://pith.science/api/pith-number/OKPP7LDYRSJY7VFF43GOXVOL4G/events.json","paper":"https://pith.science/paper/OKPP7LDY"},"agent_actions":{"view_html":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G","download_json":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G.json","view_paper":"https://pith.science/paper/OKPP7LDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8514&json=true","fetch_graph":"https://pith.science/api/pith-number/OKPP7LDYRSJY7VFF43GOXVOL4G/graph.json","fetch_events":"https://pith.science/api/pith-number/OKPP7LDYRSJY7VFF43GOXVOL4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/action/storage_attestation","attest_author":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/action/author_attestation","sign_citation":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/action/citation_signature","submit_replication":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/action/replication_record"}},"created_at":"2026-05-18T02:41:25.179262+00:00","updated_at":"2026-05-18T02:41:25.179262+00:00"}