{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZIOV5J7TRVAURA7RAEUKTADLMB","short_pith_number":"pith:ZIOV5J7T","canonical_record":{"source":{"id":"1210.4101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-10-15T16:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"b3191c24dda73da522a5d0664d370fb0e06f5884e48c2436f2776d82fb8999e8","abstract_canon_sha256":"0cce019e58a9dcde5e60b99bc61836c276294b15a1da45ba23fb286e5f28ce37"},"schema_version":"1.0"},"canonical_sha256":"ca1d5ea7f38d414883f10128a9806b605614ebced251afebfa81bfd65f476ff8","source":{"kind":"arxiv","id":"1210.4101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4101","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4101v1","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4101","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZIOV5J7TRVAU","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZIOV5J7TRVAURA7R","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZIOV5J7T","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZIOV5J7TRVAURA7RAEUKTADLMB","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-10-15T16:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"b3191c24dda73da522a5d0664d370fb0e06f5884e48c2436f2776d82fb8999e8","abstract_canon_sha256":"0cce019e58a9dcde5e60b99bc61836c276294b15a1da45ba23fb286e5f28ce37"},"schema_version":"1.0"},"canonical_sha256":"ca1d5ea7f38d414883f10128a9806b605614ebced251afebfa81bfd65f476ff8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:08.006332Z","signature_b64":"Ofg75MiWWzoD+hrPvmdPbW8L1NdomFZ9+inki+AYGKl7gEdMUu7zCG50rrjvQ2+XaWjsTQ5UwwuocF1I1bOMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca1d5ea7f38d414883f10128a9806b605614ebced251afebfa81bfd65f476ff8","last_reissued_at":"2026-05-18T03:43:08.005702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:08.005702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4101","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-18T03:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TCxd4AEfNRkT9CnYcGh2PEfeSCZeGQf5AKFzeOrtKk/xxxNLvKHxidywT1LmhbjHZH+G34p7vntvCMICeMg4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:47:24.422128Z"},"content_sha256":"b2c5395a84353b79eafc95d200cd2f9b0ed4e03e1a2c34ae9be941a1ae9aa329","schema_version":"1.0","event_id":"sha256:b2c5395a84353b79eafc95d200cd2f9b0ed4e03e1a2c34ae9be941a1ae9aa329"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZIOV5J7TRVAURA7RAEUKTADLMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the largest prime factor of the $k-$Fibonacci numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Jhon J. Bravo","submitted_at":"2012-10-15T16:51:46Z","abstract_excerpt":"Let $P(m)$ denote the largest prime factor of an integer $m\\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\\geq 2$, let $(F_{n}^{(k)})_{n\\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. Here, we show that if $n\\geq k+2$, then $P(F_n^{(k)})>c\\log\\log n$, where $c>0$ is an effectively computable constant. Furthermore, we determine all the $k-$Fibonacci numbers $F_n^{(k)}$ whose largest prime factor is less than or equal to 7."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4101","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-18T03:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhjitH7eZnJwQkLAXBCpfj4Ukey4ACBvPSQAAY9giU12Mkqd8lrL9R7ovONFCrN6SHuDCp+1GjEuepA9MQ+uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:47:24.422838Z"},"content_sha256":"2e403e2488ab534489867d1f931dbbe80333abff9db021180806f5659dfe4658","schema_version":"1.0","event_id":"sha256:2e403e2488ab534489867d1f931dbbe80333abff9db021180806f5659dfe4658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/bundle.json","state_url":"https://pith.science/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/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-25T22:47:24Z","links":{"resolver":"https://pith.science/pith/ZIOV5J7TRVAURA7RAEUKTADLMB","bundle":"https://pith.science/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/bundle.json","state":"https://pith.science/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIOV5J7TRVAURA7RAEUKTADLMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZIOV5J7TRVAURA7RAEUKTADLMB","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":"0cce019e58a9dcde5e60b99bc61836c276294b15a1da45ba23fb286e5f28ce37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-10-15T16:51:46Z","title_canon_sha256":"b3191c24dda73da522a5d0664d370fb0e06f5884e48c2436f2776d82fb8999e8"},"schema_version":"1.0","source":{"id":"1210.4101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4101","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4101v1","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4101","created_at":"2026-05-18T03:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"ZIOV5J7TRVAU","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZIOV5J7TRVAURA7R","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZIOV5J7T","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:2e403e2488ab534489867d1f931dbbe80333abff9db021180806f5659dfe4658","target":"graph","created_at":"2026-05-18T03:43:08Z","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":"Let $P(m)$ denote the largest prime factor of an integer $m\\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\\geq 2$, let $(F_{n}^{(k)})_{n\\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. Here, we show that if $n\\geq k+2$, then $P(F_n^{(k)})>c\\log\\log n$, where $c>0$ is an effectively computable constant. Furthermore, we determine all the $k-$Fibonacci numbers $F_n^{(k)}$ whose largest prime factor is less than or equal to 7.","authors_text":"Florian Luca, Jhon J. Bravo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-10-15T16:51:46Z","title":"On the largest prime factor of the $k-$Fibonacci numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4101","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:b2c5395a84353b79eafc95d200cd2f9b0ed4e03e1a2c34ae9be941a1ae9aa329","target":"record","created_at":"2026-05-18T03:43:08Z","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":"0cce019e58a9dcde5e60b99bc61836c276294b15a1da45ba23fb286e5f28ce37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-10-15T16:51:46Z","title_canon_sha256":"b3191c24dda73da522a5d0664d370fb0e06f5884e48c2436f2776d82fb8999e8"},"schema_version":"1.0","source":{"id":"1210.4101","kind":"arxiv","version":1}},"canonical_sha256":"ca1d5ea7f38d414883f10128a9806b605614ebced251afebfa81bfd65f476ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca1d5ea7f38d414883f10128a9806b605614ebced251afebfa81bfd65f476ff8","first_computed_at":"2026-05-18T03:43:08.005702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:08.005702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ofg75MiWWzoD+hrPvmdPbW8L1NdomFZ9+inki+AYGKl7gEdMUu7zCG50rrjvQ2+XaWjsTQ5UwwuocF1I1bOMBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:08.006332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2c5395a84353b79eafc95d200cd2f9b0ed4e03e1a2c34ae9be941a1ae9aa329","sha256:2e403e2488ab534489867d1f931dbbe80333abff9db021180806f5659dfe4658"],"state_sha256":"3575ed8cc4008935929a1d4b120d7faf0468e42463ccee9038381f00e7b31e74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBuZeSB8XUClI5q/64GZCBtI50KUvzsoGu1yBVxrSc0UUNEcWlySKtDa6UFP/HpknfQGF1+kDdS/nzpWHx+xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:47:24.426752Z","bundle_sha256":"f6f8c22da31d8af9f0b498d1a02666ae9317bfb81f8b6cd77ffb9dd276b6389b"}}