{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:APQZJIXMEAZON3VW4ZNLCZJWBR","short_pith_number":"pith:APQZJIXM","canonical_record":{"source":{"id":"1902.03491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-09T21:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"f0349a610c7493e854bb9b8450117f3c98fc1475668e979a7ead67918d3efa76","abstract_canon_sha256":"176fd8d0da7db341d82cd8768be7e5fd8a712e3bc8fa4cc8adbae8dbfef06df5"},"schema_version":"1.0"},"canonical_sha256":"03e194a2ec2032e6eeb6e65ab165360c40bd337f9ebbd1ca65b5f68025827902","source":{"kind":"arxiv","id":"1902.03491","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03491","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03491v3","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03491","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"APQZJIXMEAZO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"APQZJIXMEAZON3VW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"APQZJIXM","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:APQZJIXMEAZON3VW4ZNLCZJWBR","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-09T21:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"f0349a610c7493e854bb9b8450117f3c98fc1475668e979a7ead67918d3efa76","abstract_canon_sha256":"176fd8d0da7db341d82cd8768be7e5fd8a712e3bc8fa4cc8adbae8dbfef06df5"},"schema_version":"1.0"},"canonical_sha256":"03e194a2ec2032e6eeb6e65ab165360c40bd337f9ebbd1ca65b5f68025827902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:42.503274Z","signature_b64":"zBgTIwb2w91ApbGVrYbEiIdXt/V2z62WDmbPAo3GExKL9NCNOhgPGH5AtmmSl84LHj+yHysoYCqY6GliD+/+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03e194a2ec2032e6eeb6e65ab165360c40bd337f9ebbd1ca65b5f68025827902","last_reissued_at":"2026-05-17T23:44:42.502644Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:42.502644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03491","source_version":3,"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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFLfW3UkWdPJ2IuxVk94+wmfzBWXk8yaJyfjnctiSwedYsj50cXnf8s1edgsFTKNknCjEzpgjVUj9XANa3i3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:34.064898Z"},"content_sha256":"6e30acee67d116bb02b21da52cb5fb2222c4beab831d52d4c6d06cd7564ce774","schema_version":"1.0","event_id":"sha256:6e30acee67d116bb02b21da52cb5fb2222c4beab831d52d4c6d06cd7564ce774"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:APQZJIXMEAZON3VW4ZNLCZJWBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the problem of Pillai with Fibonacci numbers, Padovan numbers, and Tribonacci numbers and powers of $3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Mahadi Ddamulira","submitted_at":"2019-02-09T21:18:27Z","abstract_excerpt":"Consider the sequences: $ \\{F_{n}\\}_{n\\geq 0} $ of Fibonacci numbers defined by $ F_0=0 $, $ F_1 =1$ and $ F_{n+2}=F_{n+1}+ F_{n} $ for all $ n\\geq 0 $; $ \\{P_{n}\\}_{n\\geq 0} $ of Padovan numbers defined by $ P_0=0 $, $ P_1 =1 = P_2 $ and $ P_{n+3}=P_{n+1}+ P_{n} $ for all $ n\\geq 0 $; and $ \\{T_{n}\\}_{n\\geq 0} $ of Tribonacci numbers defined by $ T_0=0 $, $ T_1 =1= T_2$ and $ T_{n+3}=T_{n_2}+T_{n+1}+ T_{n} $ for all $ n\\geq 0 $. In this paper, we find all integers $ c $ having at least two representations as a difference between: a Fibonacci number and a power of $ 3 $; a Padovan number and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03491","kind":"arxiv","version":3},"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-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66b1t+LEZ5rnZyC3/LmZwGQ5GmrAQ8bzTeRiKOjW2tkTY18UroyHbSE7hvw/EluOOZyS2eI49OrH6tK//1I0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:01:34.065622Z"},"content_sha256":"352ce1fdc73cff1a88075031d85f8958b8beb39fad29d48a723e11d3d0f07eb7","schema_version":"1.0","event_id":"sha256:352ce1fdc73cff1a88075031d85f8958b8beb39fad29d48a723e11d3d0f07eb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/bundle.json","state_url":"https://pith.science/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/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:01:34Z","links":{"resolver":"https://pith.science/pith/APQZJIXMEAZON3VW4ZNLCZJWBR","bundle":"https://pith.science/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/bundle.json","state":"https://pith.science/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APQZJIXMEAZON3VW4ZNLCZJWBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:APQZJIXMEAZON3VW4ZNLCZJWBR","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":"176fd8d0da7db341d82cd8768be7e5fd8a712e3bc8fa4cc8adbae8dbfef06df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-09T21:18:27Z","title_canon_sha256":"f0349a610c7493e854bb9b8450117f3c98fc1475668e979a7ead67918d3efa76"},"schema_version":"1.0","source":{"id":"1902.03491","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03491","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03491v3","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03491","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"APQZJIXMEAZO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"APQZJIXMEAZON3VW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"APQZJIXM","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:352ce1fdc73cff1a88075031d85f8958b8beb39fad29d48a723e11d3d0f07eb7","target":"graph","created_at":"2026-05-17T23:44:42Z","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":"Consider the sequences: $ \\{F_{n}\\}_{n\\geq 0} $ of Fibonacci numbers defined by $ F_0=0 $, $ F_1 =1$ and $ F_{n+2}=F_{n+1}+ F_{n} $ for all $ n\\geq 0 $; $ \\{P_{n}\\}_{n\\geq 0} $ of Padovan numbers defined by $ P_0=0 $, $ P_1 =1 = P_2 $ and $ P_{n+3}=P_{n+1}+ P_{n} $ for all $ n\\geq 0 $; and $ \\{T_{n}\\}_{n\\geq 0} $ of Tribonacci numbers defined by $ T_0=0 $, $ T_1 =1= T_2$ and $ T_{n+3}=T_{n_2}+T_{n+1}+ T_{n} $ for all $ n\\geq 0 $. In this paper, we find all integers $ c $ having at least two representations as a difference between: a Fibonacci number and a power of $ 3 $; a Padovan number and a","authors_text":"Mahadi Ddamulira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-09T21:18:27Z","title":"On the problem of Pillai with Fibonacci numbers, Padovan numbers, and Tribonacci numbers and powers of $3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03491","kind":"arxiv","version":3},"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:6e30acee67d116bb02b21da52cb5fb2222c4beab831d52d4c6d06cd7564ce774","target":"record","created_at":"2026-05-17T23:44:42Z","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":"176fd8d0da7db341d82cd8768be7e5fd8a712e3bc8fa4cc8adbae8dbfef06df5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-02-09T21:18:27Z","title_canon_sha256":"f0349a610c7493e854bb9b8450117f3c98fc1475668e979a7ead67918d3efa76"},"schema_version":"1.0","source":{"id":"1902.03491","kind":"arxiv","version":3}},"canonical_sha256":"03e194a2ec2032e6eeb6e65ab165360c40bd337f9ebbd1ca65b5f68025827902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03e194a2ec2032e6eeb6e65ab165360c40bd337f9ebbd1ca65b5f68025827902","first_computed_at":"2026-05-17T23:44:42.502644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:42.502644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBgTIwb2w91ApbGVrYbEiIdXt/V2z62WDmbPAo3GExKL9NCNOhgPGH5AtmmSl84LHj+yHysoYCqY6GliD+/+CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:42.503274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03491","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e30acee67d116bb02b21da52cb5fb2222c4beab831d52d4c6d06cd7564ce774","sha256:352ce1fdc73cff1a88075031d85f8958b8beb39fad29d48a723e11d3d0f07eb7"],"state_sha256":"4c831120727185b9c925cecefc5dbfa8b59705d39c7e8f29d7603e17e1e8ed5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NcYmZsB+s3+dwdDctIsdqcbIQaJlPjpy3/fmKVJlX/BMvodxdjMvb1B4vNNROiSVvhzJvGsH9UnmqGNeMPhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:01:34.071284Z","bundle_sha256":"87dbb8c05da9b768966ba9637755f6539052e18484428096a27946df9821005c"}}