{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6U3WNGC5R5XQBD4HZ5EB4ENTL5","short_pith_number":"pith:6U3WNGC5","canonical_record":{"source":{"id":"1102.4834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"c3c74a71bdf17fd923ef246b411433a8bda1c8277b2423dd7778c3f1481ec5cb","abstract_canon_sha256":"64fdff446e3ccb815335de6a34cd1454a017c08626a99635bfe13adaff2c0e92"},"schema_version":"1.0"},"canonical_sha256":"f53766985d8f6f008f87cf481e11b35f453791eefdfa5c47b0f66bfb6ca14833","source":{"kind":"arxiv","id":"1102.4834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4834","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4834v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4834","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"6U3WNGC5R5XQ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6U3WNGC5R5XQBD4H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6U3WNGC5","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6U3WNGC5R5XQBD4HZ5EB4ENTL5","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:45:07Z","cross_cats_sorted":[],"title_canon_sha256":"c3c74a71bdf17fd923ef246b411433a8bda1c8277b2423dd7778c3f1481ec5cb","abstract_canon_sha256":"64fdff446e3ccb815335de6a34cd1454a017c08626a99635bfe13adaff2c0e92"},"schema_version":"1.0"},"canonical_sha256":"f53766985d8f6f008f87cf481e11b35f453791eefdfa5c47b0f66bfb6ca14833","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.246546Z","signature_b64":"LFtkV0j68RR4qtKZ8FH1JIEBeKbLNv5z6B4OQ8BuWXm4xp0rM988BtXC5jLJJtYXAlZBzDNvX5gV2poACi3eCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f53766985d8f6f008f87cf481e11b35f453791eefdfa5c47b0f66bfb6ca14833","last_reissued_at":"2026-05-18T04:28:07.245994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.245994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4834","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sB2/0jINYIQcYZFQ1fn2tZMhhKqaeDdAPyHgp7OQB/fGSD2uyhY4BeFK3xh22KcIUVEAiQ3dFTR1mftPBvGtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:41:31.242857Z"},"content_sha256":"bef79f385075d059b852faabc630fa48e43347ab2d405a117eb28fd7744b728e","schema_version":"1.0","event_id":"sha256:bef79f385075d059b852faabc630fa48e43347ab2d405a117eb28fd7744b728e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6U3WNGC5R5XQBD4HZ5EB4ENTL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized Pillai equation $\\pm r a^x \\pm s b^y = c$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Reese Scott, Robert Styer","submitted_at":"2011-02-22T03:45:07Z","abstract_excerpt":"In this paper we consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c$ in nonnegative integers $x, y$ and integers $u, v \\in \\{0,1\\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. We show that $N \\le 2$ when $\\gcd(ra, sb) =1$ and $\\min(x,y)>0$, except for a finite number of cases that can be found in a finite number of steps. For arbitrary $\\gcd(ra, sb)$ and $\\min(x,y) \\ge 0$, we show that when $(u,v) = (0,1)$ we have $N \\le 3$, with an infinite number of cases for which N=3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4834","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIUsNlN4e2S6Qw4h9/QWHNhSBt4b5NopD6jJZJJHTDHa2CljW9waYvsQeAjnjf9nEd+hCmCN0Q8qin4hWIROBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:41:31.243572Z"},"content_sha256":"c8b578e6b85a72f9216edf73a115d1b752a0c221c1c7528bf16eed0d22843d22","schema_version":"1.0","event_id":"sha256:c8b578e6b85a72f9216edf73a115d1b752a0c221c1c7528bf16eed0d22843d22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/bundle.json","state_url":"https://pith.science/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/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-06-11T02:41:31Z","links":{"resolver":"https://pith.science/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5","bundle":"https://pith.science/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/bundle.json","state":"https://pith.science/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6U3WNGC5R5XQBD4HZ5EB4ENTL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6U3WNGC5R5XQBD4HZ5EB4ENTL5","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":"64fdff446e3ccb815335de6a34cd1454a017c08626a99635bfe13adaff2c0e92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:45:07Z","title_canon_sha256":"c3c74a71bdf17fd923ef246b411433a8bda1c8277b2423dd7778c3f1481ec5cb"},"schema_version":"1.0","source":{"id":"1102.4834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4834","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4834v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4834","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"6U3WNGC5R5XQ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6U3WNGC5R5XQBD4H","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6U3WNGC5","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:c8b578e6b85a72f9216edf73a115d1b752a0c221c1c7528bf16eed0d22843d22","target":"graph","created_at":"2026-05-18T04:28:07Z","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":"In this paper we consider $N$, the number of solutions $(x,y,u,v)$ to the equation $ (-1)^u r a^x + (-1)^v s b^y = c$ in nonnegative integers $x, y$ and integers $u, v \\in \\{0,1\\}$, for given integers $a>1$, $b>1$, $c>0$, $r>0$ and $s>0$. We show that $N \\le 2$ when $\\gcd(ra, sb) =1$ and $\\min(x,y)>0$, except for a finite number of cases that can be found in a finite number of steps. For arbitrary $\\gcd(ra, sb)$ and $\\min(x,y) \\ge 0$, we show that when $(u,v) = (0,1)$ we have $N \\le 3$, with an infinite number of cases for which N=3.","authors_text":"Reese Scott, Robert Styer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:45:07Z","title":"The generalized Pillai equation $\\pm r a^x \\pm s b^y = c$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4834","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:bef79f385075d059b852faabc630fa48e43347ab2d405a117eb28fd7744b728e","target":"record","created_at":"2026-05-18T04:28:07Z","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":"64fdff446e3ccb815335de6a34cd1454a017c08626a99635bfe13adaff2c0e92","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:45:07Z","title_canon_sha256":"c3c74a71bdf17fd923ef246b411433a8bda1c8277b2423dd7778c3f1481ec5cb"},"schema_version":"1.0","source":{"id":"1102.4834","kind":"arxiv","version":1}},"canonical_sha256":"f53766985d8f6f008f87cf481e11b35f453791eefdfa5c47b0f66bfb6ca14833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f53766985d8f6f008f87cf481e11b35f453791eefdfa5c47b0f66bfb6ca14833","first_computed_at":"2026-05-18T04:28:07.245994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:07.245994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LFtkV0j68RR4qtKZ8FH1JIEBeKbLNv5z6B4OQ8BuWXm4xp0rM988BtXC5jLJJtYXAlZBzDNvX5gV2poACi3eCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:07.246546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bef79f385075d059b852faabc630fa48e43347ab2d405a117eb28fd7744b728e","sha256:c8b578e6b85a72f9216edf73a115d1b752a0c221c1c7528bf16eed0d22843d22"],"state_sha256":"891be16bd6565c9914e19fc8419339c73e1ebbde2afe9a204b5003209af9f02c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXkW3cRan4BfWFSWs+c3xOBjxtMiAfLOaH0UnOfwdIh/NC3hyPTVe9oZ8oTQ7haEgcPCZqBoNxTnQ3P8qwgOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:41:31.247162Z","bundle_sha256":"04cdd6dd3f5a203c315b1c82f175b21e40e67fe089a2bec2250062aefe551183"}}