{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UPXYB7C7X7MSXJXXPUF25ANAR5","short_pith_number":"pith:UPXYB7C7","canonical_record":{"source":{"id":"1102.4833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:18:42Z","cross_cats_sorted":[],"title_canon_sha256":"7bcaa10f13e40212256f708d74d91e9096d16b2435fd6fc4fad253201b59d663","abstract_canon_sha256":"b727a15687193752e9212859a0b79e0102ded7188e4fc9778a699b931438727d"},"schema_version":"1.0"},"canonical_sha256":"a3ef80fc5fbfd92ba6f77d0bae81a08f705afcaa0c3ed2a75d285ee6985a283d","source":{"kind":"arxiv","id":"1102.4833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4833","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4833v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4833","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"UPXYB7C7X7MS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UPXYB7C7X7MSXJXX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UPXYB7C7","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UPXYB7C7X7MSXJXXPUF25ANAR5","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:18:42Z","cross_cats_sorted":[],"title_canon_sha256":"7bcaa10f13e40212256f708d74d91e9096d16b2435fd6fc4fad253201b59d663","abstract_canon_sha256":"b727a15687193752e9212859a0b79e0102ded7188e4fc9778a699b931438727d"},"schema_version":"1.0"},"canonical_sha256":"a3ef80fc5fbfd92ba6f77d0bae81a08f705afcaa0c3ed2a75d285ee6985a283d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.254422Z","signature_b64":"Zia1qbz9t5dZ4aGjvLHDFZKq5ZpaYdCJ9uRErILY5yDWoQKXNNzfhSmH97KDxs/nS2ZmVR1c5S4TSX4ZW4BkBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ef80fc5fbfd92ba6f77d0bae81a08f705afcaa0c3ed2a75d285ee6985a283d","last_reissued_at":"2026-05-18T04:28:07.253836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.253836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4833","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":"V8F1y+wrZMe7kQW8duyr8lmB4bHMqJEPaQVYa7S3gVoNSwoJpyWdVPkMHF4r964CkwXxJ6qCzfx3gmWVSdHfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:59:31.632560Z"},"content_sha256":"6770cdf1175bdefe6c359e5e425c4ec3e23754eabeb969b8ac9caf7704ae9166","schema_version":"1.0","event_id":"sha256:6770cdf1175bdefe6c359e5e425c4ec3e23754eabeb969b8ac9caf7704ae9166"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UPXYB7C7X7MSXJXXPUF25ANAR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The generalized Pillai equation $\\pm r a^x \\pm s b^y = c$, II","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:18:42Z","abstract_excerpt":"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$. When $(ra,sb)=1$, we show that $N \\le 3$ except for a finite number of cases all of which satisfy $\\max(a,b,r,s, x,y) < 2 \\cdot 10^{15}$ for each solution; when $(a,b)>1$, we show that $N \\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of infinite families of cases giving N=3 solutions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4833","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":"QEp8xLnCfSnqCtxtcerNvWrbH+HSKxd7iIM9HuV9L83zWLgWXIT3MnDi6vRgarnulkO/qvypcG0XulRjscKNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:59:31.633239Z"},"content_sha256":"3eaedaefbd614a748c42a059c3639dc723177d944b0070368c6039f4808bb651","schema_version":"1.0","event_id":"sha256:3eaedaefbd614a748c42a059c3639dc723177d944b0070368c6039f4808bb651"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/bundle.json","state_url":"https://pith.science/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/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-11T03:59:31Z","links":{"resolver":"https://pith.science/pith/UPXYB7C7X7MSXJXXPUF25ANAR5","bundle":"https://pith.science/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/bundle.json","state":"https://pith.science/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPXYB7C7X7MSXJXXPUF25ANAR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UPXYB7C7X7MSXJXXPUF25ANAR5","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":"b727a15687193752e9212859a0b79e0102ded7188e4fc9778a699b931438727d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:18:42Z","title_canon_sha256":"7bcaa10f13e40212256f708d74d91e9096d16b2435fd6fc4fad253201b59d663"},"schema_version":"1.0","source":{"id":"1102.4833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4833","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4833v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4833","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"UPXYB7C7X7MS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UPXYB7C7X7MSXJXX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UPXYB7C7","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:3eaedaefbd614a748c42a059c3639dc723177d944b0070368c6039f4808bb651","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":"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$. When $(ra,sb)=1$, we show that $N \\le 3$ except for a finite number of cases all of which satisfy $\\max(a,b,r,s, x,y) < 2 \\cdot 10^{15}$ for each solution; when $(a,b)>1$, we show that $N \\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of infinite families of cases giving N=3 solutions.","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:18:42Z","title":"The generalized Pillai equation $\\pm r a^x \\pm s b^y = c$, II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4833","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:6770cdf1175bdefe6c359e5e425c4ec3e23754eabeb969b8ac9caf7704ae9166","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":"b727a15687193752e9212859a0b79e0102ded7188e4fc9778a699b931438727d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-22T03:18:42Z","title_canon_sha256":"7bcaa10f13e40212256f708d74d91e9096d16b2435fd6fc4fad253201b59d663"},"schema_version":"1.0","source":{"id":"1102.4833","kind":"arxiv","version":1}},"canonical_sha256":"a3ef80fc5fbfd92ba6f77d0bae81a08f705afcaa0c3ed2a75d285ee6985a283d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3ef80fc5fbfd92ba6f77d0bae81a08f705afcaa0c3ed2a75d285ee6985a283d","first_computed_at":"2026-05-18T04:28:07.253836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:07.253836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zia1qbz9t5dZ4aGjvLHDFZKq5ZpaYdCJ9uRErILY5yDWoQKXNNzfhSmH97KDxs/nS2ZmVR1c5S4TSX4ZW4BkBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:07.254422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6770cdf1175bdefe6c359e5e425c4ec3e23754eabeb969b8ac9caf7704ae9166","sha256:3eaedaefbd614a748c42a059c3639dc723177d944b0070368c6039f4808bb651"],"state_sha256":"5b400c12e7c4cefd096ef0b727fe8c04ff1aee1b32646f06992a56d2e433e003"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uylsfoMhH57qysT9LGqEdwyl6DqFCeJZdeA6a0rvIrv6xR0yuwfXlDQCkDCpjKJkjcfrMJqoD/K6FyQgxtZrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:59:31.636846Z","bundle_sha256":"0ad174bb8248c47c55904157159c42b51e2aea48ce863538aabcbdbf36fb6f8d"}}