{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:URHMYYDW4NV7ZEMTPRRUISX5FA","short_pith_number":"pith:URHMYYDW","canonical_record":{"source":{"id":"1112.4547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-12-20T02:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"2d7e7c462a59f8ee6a891a0f7d5eb7e2a9bf1d811aff89905fd850cf5a7ced5a","abstract_canon_sha256":"9b7208f255b9a86f5660df307613a773934b8665f3788000f3024b651a8e5e2b"},"schema_version":"1.0"},"canonical_sha256":"a44ecc6076e36bfc91937c63444afd2815e296fda6a38b4db6d85354294ee785","source":{"kind":"arxiv","id":"1112.4547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4547","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4547v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4547","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"URHMYYDW4NV7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"URHMYYDW4NV7ZEMT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"URHMYYDW","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:URHMYYDW4NV7ZEMTPRRUISX5FA","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-12-20T02:34:24Z","cross_cats_sorted":[],"title_canon_sha256":"2d7e7c462a59f8ee6a891a0f7d5eb7e2a9bf1d811aff89905fd850cf5a7ced5a","abstract_canon_sha256":"9b7208f255b9a86f5660df307613a773934b8665f3788000f3024b651a8e5e2b"},"schema_version":"1.0"},"canonical_sha256":"a44ecc6076e36bfc91937c63444afd2815e296fda6a38b4db6d85354294ee785","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:58.604555Z","signature_b64":"Q8rZmp6UKeSC9MOK6rfLJLiOKkc2p86aSCZMmwwajYBwGz6GPWoLasl/WmKKO4H3GDkrUPZqOZ/xltJQLYhdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a44ecc6076e36bfc91937c63444afd2815e296fda6a38b4db6d85354294ee785","last_reissued_at":"2026-05-18T04:05:58.603924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:58.603924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4547","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:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x3x/PYn8Ci8AG7fRxuerrZIfqj2cKJwx2OS+yVMSZQkdwP15QmXVTy7ZlpTNzWonPyn6jbosT9IHeW/0Ki/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:37:52.565234Z"},"content_sha256":"2d81d99301a15ec988287278e22036eab76c6cc1917efd4425c6ee38b4489da9","schema_version":"1.0","event_id":"sha256:2d81d99301a15ec988287278e22036eab76c6cc1917efd4425c6ee38b4489da9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:URHMYYDW4NV7ZEMTPRRUISX5FA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Handling a large bound for a problem on 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-12-20T02:34:24Z","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$. Previous work showed that there are nine essentially distinct $(a,b,c,r,s)$ for which $N \\ge 4$, except possibly for cases in which the solutions have $r$, $a$, $x$, $s$, $b$, and $y$ each bounded by $8 \\cdot 10^{14}$ or $2 \\cdot 10^{15}$. In this paper we show that there are no further cases with $N \\ge 4$ within these bounds. We note that $N = 3$ for an infinite number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4547","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:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWj3MZcGiKTjf2znFMweP7lUtxlqMwT66axIqdmuYiIY5TYDFeD4WFLrINKUqocvenJnY4e/rwwrBiDO40eMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:37:52.565928Z"},"content_sha256":"7074aea5ff851dbcaad22609820fe957cf4ab74383e6c371386b783acfc04145","schema_version":"1.0","event_id":"sha256:7074aea5ff851dbcaad22609820fe957cf4ab74383e6c371386b783acfc04145"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/bundle.json","state_url":"https://pith.science/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/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-11T06:37:52Z","links":{"resolver":"https://pith.science/pith/URHMYYDW4NV7ZEMTPRRUISX5FA","bundle":"https://pith.science/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/bundle.json","state":"https://pith.science/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URHMYYDW4NV7ZEMTPRRUISX5FA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:URHMYYDW4NV7ZEMTPRRUISX5FA","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":"9b7208f255b9a86f5660df307613a773934b8665f3788000f3024b651a8e5e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-12-20T02:34:24Z","title_canon_sha256":"2d7e7c462a59f8ee6a891a0f7d5eb7e2a9bf1d811aff89905fd850cf5a7ced5a"},"schema_version":"1.0","source":{"id":"1112.4547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4547","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4547v1","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4547","created_at":"2026-05-18T04:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"URHMYYDW4NV7","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"URHMYYDW4NV7ZEMT","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"URHMYYDW","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:7074aea5ff851dbcaad22609820fe957cf4ab74383e6c371386b783acfc04145","target":"graph","created_at":"2026-05-18T04:05:58Z","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$. Previous work showed that there are nine essentially distinct $(a,b,c,r,s)$ for which $N \\ge 4$, except possibly for cases in which the solutions have $r$, $a$, $x$, $s$, $b$, and $y$ each bounded by $8 \\cdot 10^{14}$ or $2 \\cdot 10^{15}$. In this paper we show that there are no further cases with $N \\ge 4$ within these bounds. We note that $N = 3$ for an infinite number ","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-12-20T02:34:24Z","title":"Handling a large bound for a problem on 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":"1112.4547","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:2d81d99301a15ec988287278e22036eab76c6cc1917efd4425c6ee38b4489da9","target":"record","created_at":"2026-05-18T04:05:58Z","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":"9b7208f255b9a86f5660df307613a773934b8665f3788000f3024b651a8e5e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-12-20T02:34:24Z","title_canon_sha256":"2d7e7c462a59f8ee6a891a0f7d5eb7e2a9bf1d811aff89905fd850cf5a7ced5a"},"schema_version":"1.0","source":{"id":"1112.4547","kind":"arxiv","version":1}},"canonical_sha256":"a44ecc6076e36bfc91937c63444afd2815e296fda6a38b4db6d85354294ee785","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a44ecc6076e36bfc91937c63444afd2815e296fda6a38b4db6d85354294ee785","first_computed_at":"2026-05-18T04:05:58.603924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:58.603924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q8rZmp6UKeSC9MOK6rfLJLiOKkc2p86aSCZMmwwajYBwGz6GPWoLasl/WmKKO4H3GDkrUPZqOZ/xltJQLYhdCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:58.604555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d81d99301a15ec988287278e22036eab76c6cc1917efd4425c6ee38b4489da9","sha256:7074aea5ff851dbcaad22609820fe957cf4ab74383e6c371386b783acfc04145"],"state_sha256":"384b6efec5a70d9743552e912d0ba1aad543b21fbf2b7d601cf749a72d1030c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFOeh4iyiIvohMc7qQoovf+p84Sr+n5vLFxdUzcXQicaQZ2AP9OYk5tlZgoMQipLpr81FAQuDWuOfgbHNrDhBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:37:52.569936Z","bundle_sha256":"0d2c1604da8aa3c866eebbe95f3d23f7ead3f5ec072f0bc4e656e8c4e52e2922"}}