{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OKPP7LDYRSJY7VFF43GOXVOL4G","short_pith_number":"pith:OKPP7LDY","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"},"canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","source":{"kind":"arxiv","id":"1409.8514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8514","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8514v1","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8514","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"OKPP7LDYRSJY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OKPP7LDYRSJY7VFF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OKPP7LDY","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OKPP7LDYRSJY7VFF43GOXVOL4G","target":"record","payload":{"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"},"canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","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"},"source_kind":"arxiv","source_id":"1409.8514","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HA1q9IAaxRXxmETcxTcaiZrCHPi720h0Ab8IclPuXRi2mZuR9388sJFqzXz7sVfLSpWrgL6W2L7DsGHZOt9VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:45.105899Z"},"content_sha256":"d742806db05a5aa999666bfad56ffbfcf5db45bae183a602b14b4b89eb47380d","schema_version":"1.0","event_id":"sha256:d742806db05a5aa999666bfad56ffbfcf5db45bae183a602b14b4b89eb47380d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OKPP7LDYRSJY7VFF43GOXVOL4G","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKLYUddXHWB1PXTKXa9R5UKNX/CcRV5zjsp49ijGNXW1EqTpuzApXDzCy+xcY5NuKJi2fil/fhXFAQxOJ8kFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:51:45.106607Z"},"content_sha256":"4ce6c3613201b25816add68b734061f7b4135e331bc223b6095fcc8670d7b3d2","schema_version":"1.0","event_id":"sha256:4ce6c3613201b25816add68b734061f7b4135e331bc223b6095fcc8670d7b3d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/bundle.json","state_url":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:51:45Z","links":{"resolver":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G","bundle":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/bundle.json","state":"https://pith.science/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OKPP7LDYRSJY7VFF43GOXVOL4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OKPP7LDYRSJY7VFF43GOXVOL4G","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3f8858c73406d6142523745ef22b5ce943b449af85e3ac0ca441e7808b4727e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-30T12:19:34Z","title_canon_sha256":"6c67257bb06dbea274d31c0fb4df8f638b61542c4fe1d1876ac2afd967efee57"},"schema_version":"1.0","source":{"id":"1409.8514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8514","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8514v1","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8514","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"OKPP7LDYRSJY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"OKPP7LDYRSJY7VFF","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"OKPP7LDY","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:4ce6c3613201b25816add68b734061f7b4135e331bc223b6095fcc8670d7b3d2","target":"graph","created_at":"2026-05-18T02:41:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}.","authors_text":"Carlos A. G\\'omez, Florian Luca, Jhon J. Bravo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-30T12:19:34Z","title":"Powers of two as sums of two $k-$Fibonacci numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8514","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d742806db05a5aa999666bfad56ffbfcf5db45bae183a602b14b4b89eb47380d","target":"record","created_at":"2026-05-18T02:41:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3f8858c73406d6142523745ef22b5ce943b449af85e3ac0ca441e7808b4727e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-09-30T12:19:34Z","title_canon_sha256":"6c67257bb06dbea274d31c0fb4df8f638b61542c4fe1d1876ac2afd967efee57"},"schema_version":"1.0","source":{"id":"1409.8514","kind":"arxiv","version":1}},"canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"729effac788c938fd4a5e6ccebd5cbe1baceb6e94bc2c86f632dfa58764f0f10","first_computed_at":"2026-05-18T02:41:25.179207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:25.179207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBB3dd4Qy+Vi9cVtCurrWRLEwbleRp4qv1kD9LwkopuUBauAsd8OrgIFrXHphkvqQ8zuFUzhv2HMiSHFmE3rCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:25.179626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d742806db05a5aa999666bfad56ffbfcf5db45bae183a602b14b4b89eb47380d","sha256:4ce6c3613201b25816add68b734061f7b4135e331bc223b6095fcc8670d7b3d2"],"state_sha256":"a72206df891e19a935039367278cf6daf9b19b4a8a5a3147d16e991574b3b7eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qy73ev+1L/wI2uXrrErK9NBlwzBqUe97ntv1tlGSorrssk4eHDviE1oX5QzGvTt+LW4KtlyeC+4nV9nYl5oqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:51:45.110135Z","bundle_sha256":"f1596a7755c6539b21ffce52d6915e0b1eb5ea3a52163ff44e628c12d4783cf9"}}