{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5I7KPU56ETJCG3JIHRHRW73Y5P","short_pith_number":"pith:5I7KPU56","canonical_record":{"source":{"id":"2409.02047","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-03T16:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"c3664846e1e93dc958a1ed64a94b9abe4f68fc6f5fc3c3b60ca055e0700728d2","abstract_canon_sha256":"fd4e7112fe0ef31d869acf20f14af471b98f465dc6f6970a17c056d085e9aac5"},"schema_version":"1.0"},"canonical_sha256":"ea3ea7d3be24d2236d283c4f1b7f78ebd2ffcd0a05e0f90148e0dbe6b5baee55","source":{"kind":"arxiv","id":"2409.02047","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.02047","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"arxiv_version","alias_value":"2409.02047v4","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02047","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_12","alias_value":"5I7KPU56ETJC","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_16","alias_value":"5I7KPU56ETJCG3JI","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_8","alias_value":"5I7KPU56","created_at":"2026-07-05T09:50:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5I7KPU56ETJCG3JIHRHRW73Y5P","target":"record","payload":{"canonical_record":{"source":{"id":"2409.02047","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-03T16:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"c3664846e1e93dc958a1ed64a94b9abe4f68fc6f5fc3c3b60ca055e0700728d2","abstract_canon_sha256":"fd4e7112fe0ef31d869acf20f14af471b98f465dc6f6970a17c056d085e9aac5"},"schema_version":"1.0"},"canonical_sha256":"ea3ea7d3be24d2236d283c4f1b7f78ebd2ffcd0a05e0f90148e0dbe6b5baee55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:05.048617Z","signature_b64":"i8af/0KbX3OJz272tbiQTwnGygtny0jiWvgcRWQznDQHsFhWjVCkXtdUGcSn94CumwcOPu//4JunxYqkTC6+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea3ea7d3be24d2236d283c4f1b7f78ebd2ffcd0a05e0f90148e0dbe6b5baee55","last_reissued_at":"2026-07-05T09:50:05.047944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:05.047944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.02047","source_version":4,"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-07-05T09:50:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uxf6uXcoEqPRdHWaFZTi3HafjjSU/qXAy+7NiuvTcjoQfb41ymfZexgXamPMZ31npcBcypZ8Vkb16ICnFL+oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:56:31.114378Z"},"content_sha256":"9b0c35b277009857cf133d41cba96f296351866ce79d30b352152233d6d0a2b2","schema_version":"1.0","event_id":"sha256:9b0c35b277009857cf133d41cba96f296351866ce79d30b352152233d6d0a2b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5I7KPU56ETJCG3JIHRHRW73Y5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Diophantine Equation $F_n = F_l^k (F_l^m-1)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Nazim I. Mahmudov, Seyran S. Ibrahimov","submitted_at":"2024-09-03T16:52:58Z","abstract_excerpt":"In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \\geq 1$ and $k \\geq 3$. Here, $\\{ F_t \\}_{t=0}^{\\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation $F_0 = 0$, $F_1 = 1$, and $F_t = F_{t-1} + F_{t-2}$ for $t \\geq 2$. By applying Matveev's theorem, which provides lower bounds for linear forms in logarithms of algebraic numbers, along with a modified Baker-Davenport reduction method and a divisibility property of Fibonacci numbers, we show that $(n, l, k, m) = (6, 3, 3, 1)$ is the only positive integer quadr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02047","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.02047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:50:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZCItepqMXNJMTBVvvjy5gJpjKP6P/pmnUKVvaZUxFdMHfC3BJRGiLW+VeomStFBkOAreCu49SfteiLE86pfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:56:31.115002Z"},"content_sha256":"d1e28fe14f58afeaf7120b346ecaccdba73f86f97bed9e41554ccb4ebda98cf9","schema_version":"1.0","event_id":"sha256:d1e28fe14f58afeaf7120b346ecaccdba73f86f97bed9e41554ccb4ebda98cf9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/bundle.json","state_url":"https://pith.science/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/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-08-11T21:56:31Z","links":{"resolver":"https://pith.science/pith/5I7KPU56ETJCG3JIHRHRW73Y5P","bundle":"https://pith.science/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/bundle.json","state":"https://pith.science/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5I7KPU56ETJCG3JIHRHRW73Y5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5I7KPU56ETJCG3JIHRHRW73Y5P","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":"fd4e7112fe0ef31d869acf20f14af471b98f465dc6f6970a17c056d085e9aac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-03T16:52:58Z","title_canon_sha256":"c3664846e1e93dc958a1ed64a94b9abe4f68fc6f5fc3c3b60ca055e0700728d2"},"schema_version":"1.0","source":{"id":"2409.02047","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.02047","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"arxiv_version","alias_value":"2409.02047v4","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.02047","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_12","alias_value":"5I7KPU56ETJC","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_16","alias_value":"5I7KPU56ETJCG3JI","created_at":"2026-07-05T09:50:05Z"},{"alias_kind":"pith_short_8","alias_value":"5I7KPU56","created_at":"2026-07-05T09:50:05Z"}],"graph_snapshots":[{"event_id":"sha256:d1e28fe14f58afeaf7120b346ecaccdba73f86f97bed9e41554ccb4ebda98cf9","target":"graph","created_at":"2026-07-05T09:50:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.02047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \\geq 1$ and $k \\geq 3$. Here, $\\{ F_t \\}_{t=0}^{\\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation $F_0 = 0$, $F_1 = 1$, and $F_t = F_{t-1} + F_{t-2}$ for $t \\geq 2$. By applying Matveev's theorem, which provides lower bounds for linear forms in logarithms of algebraic numbers, along with a modified Baker-Davenport reduction method and a divisibility property of Fibonacci numbers, we show that $(n, l, k, m) = (6, 3, 3, 1)$ is the only positive integer quadr","authors_text":"Nazim I. Mahmudov, Seyran S. Ibrahimov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-03T16:52:58Z","title":"On the Diophantine Equation $F_n = F_l^k (F_l^m-1)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.02047","kind":"arxiv","version":4},"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:9b0c35b277009857cf133d41cba96f296351866ce79d30b352152233d6d0a2b2","target":"record","created_at":"2026-07-05T09:50:05Z","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":"fd4e7112fe0ef31d869acf20f14af471b98f465dc6f6970a17c056d085e9aac5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2024-09-03T16:52:58Z","title_canon_sha256":"c3664846e1e93dc958a1ed64a94b9abe4f68fc6f5fc3c3b60ca055e0700728d2"},"schema_version":"1.0","source":{"id":"2409.02047","kind":"arxiv","version":4}},"canonical_sha256":"ea3ea7d3be24d2236d283c4f1b7f78ebd2ffcd0a05e0f90148e0dbe6b5baee55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea3ea7d3be24d2236d283c4f1b7f78ebd2ffcd0a05e0f90148e0dbe6b5baee55","first_computed_at":"2026-07-05T09:50:05.047944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:05.047944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i8af/0KbX3OJz272tbiQTwnGygtny0jiWvgcRWQznDQHsFhWjVCkXtdUGcSn94CumwcOPu//4JunxYqkTC6+CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:05.048617Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.02047","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b0c35b277009857cf133d41cba96f296351866ce79d30b352152233d6d0a2b2","sha256:d1e28fe14f58afeaf7120b346ecaccdba73f86f97bed9e41554ccb4ebda98cf9"],"state_sha256":"a6aaffe88d0272976617d149a32d6f8c573697979971c5ee4dab70255c50148b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHK5uZo6Vckc2MVEmOJPjpay0JvDa4nipUzxRsZm8grg+mlcgNhTNVB1JSpKJtyxcU95J2n4MCUggCAMSTHkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:56:31.118811Z","bundle_sha256":"4725aa615bcfb1635e8b38c1b20db81a2cc1b11b8c40e095493e044e68f61978"}}