{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PYQPARCGZGQYIDBD4QX3WG24PC","short_pith_number":"pith:PYQPARCG","canonical_record":{"source":{"id":"2506.01099","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-01T17:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"242b95ed703c4fdce830ecb954c9fd4707e44982f604f44fe2447ba3bb9946f8","abstract_canon_sha256":"05dd4071bf2b5b7fa652a659fce96e3d406c92419696d0ed454005a3e5672ac0"},"schema_version":"1.0"},"canonical_sha256":"7e20f04446c9a1840c23e42fbb1b5c78a9031b88137d6bb4cfbc91bf1a6bfe50","source":{"kind":"arxiv","id":"2506.01099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01099","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01099v1","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01099","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"PYQPARCGZGQY","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYQPARCGZGQYIDBD","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYQPARCG","created_at":"2026-07-05T11:13:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PYQPARCGZGQYIDBD4QX3WG24PC","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01099","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-01T17:48:06Z","cross_cats_sorted":[],"title_canon_sha256":"242b95ed703c4fdce830ecb954c9fd4707e44982f604f44fe2447ba3bb9946f8","abstract_canon_sha256":"05dd4071bf2b5b7fa652a659fce96e3d406c92419696d0ed454005a3e5672ac0"},"schema_version":"1.0"},"canonical_sha256":"7e20f04446c9a1840c23e42fbb1b5c78a9031b88137d6bb4cfbc91bf1a6bfe50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:46.384818Z","signature_b64":"Zne0H5e5xKbxe4yDxmI+jhXfXFR4Q3B4B7SGkJtKlmPN25DYX1Eb84SxzixptXuOuXPjuPsJ8GB9mZ1bZUKpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e20f04446c9a1840c23e42fbb1b5c78a9031b88137d6bb4cfbc91bf1a6bfe50","last_reissued_at":"2026-07-05T11:13:46.384369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:46.384369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01099","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-07-05T11:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5p4Tjjg+c6fefjCsM7a5xmEWPp2/MLiiKYRtliW86iVPvA91EgqK5LVHI35HXl9jTRjfQHZgqcA0qCTcLLJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:32.426444Z"},"content_sha256":"f27a8a7499760ac179f9603e1cf295b24e1f8fe631b69194564b440ca8597dd6","schema_version":"1.0","event_id":"sha256:f27a8a7499760ac179f9603e1cf295b24e1f8fe631b69194564b440ca8597dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PYQPARCGZGQYIDBD4QX3WG24PC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On one of Erd\\H{o}s' Problems -- An Efficient Search for Benelux Pairs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Hercher","submitted_at":"2025-06-01T17:48:06Z","abstract_excerpt":"Erd\\H{o}s asked for positive integers $m<n$, such that $m$ and $n$ have the same set of prime factors, $m+1$ and $n+1$ have the same set of prime factors, and $m+2$ and $n+2$ have the same set of prime factors. No such integers are known. If one relaxes the problem and only considers the first two conditions, an infinite series of solutions is known: $m=2^k-2$, $n=(m+1)^2-1=2^k \\cdot m$ for all integers $k\\geq 2$. One additional solution is also known: $m=75=3\\cdot 5^2$ and $n=1215=3^5 \\cdot 5$ with $m+1=76=2^2\\cdot 19$ and $n+1=1216=2^6 \\cdot 19$. No other solutions with $n<2^{32}\\approx 4.3\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01099","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01099/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-05T11:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0+2/2RrWgpRBYJ3Otd8Msf1NVUeRLGn3azio3RhUlwmmydg2JetsTC7oVqrLRx68UepRnwvZmR0RvRBfQCRICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:57:32.426927Z"},"content_sha256":"bf3d42d0b2dd888d9a9e774d8d5cd5e4d2311b9e1c829e6288e638f3be524c86","schema_version":"1.0","event_id":"sha256:bf3d42d0b2dd888d9a9e774d8d5cd5e4d2311b9e1c829e6288e638f3be524c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYQPARCGZGQYIDBD4QX3WG24PC/bundle.json","state_url":"https://pith.science/pith/PYQPARCGZGQYIDBD4QX3WG24PC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYQPARCGZGQYIDBD4QX3WG24PC/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-08T12:57:32Z","links":{"resolver":"https://pith.science/pith/PYQPARCGZGQYIDBD4QX3WG24PC","bundle":"https://pith.science/pith/PYQPARCGZGQYIDBD4QX3WG24PC/bundle.json","state":"https://pith.science/pith/PYQPARCGZGQYIDBD4QX3WG24PC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYQPARCGZGQYIDBD4QX3WG24PC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PYQPARCGZGQYIDBD4QX3WG24PC","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":"05dd4071bf2b5b7fa652a659fce96e3d406c92419696d0ed454005a3e5672ac0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-01T17:48:06Z","title_canon_sha256":"242b95ed703c4fdce830ecb954c9fd4707e44982f604f44fe2447ba3bb9946f8"},"schema_version":"1.0","source":{"id":"2506.01099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01099","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01099v1","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01099","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"PYQPARCGZGQY","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYQPARCGZGQYIDBD","created_at":"2026-07-05T11:13:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYQPARCG","created_at":"2026-07-05T11:13:46Z"}],"graph_snapshots":[{"event_id":"sha256:bf3d42d0b2dd888d9a9e774d8d5cd5e4d2311b9e1c829e6288e638f3be524c86","target":"graph","created_at":"2026-07-05T11:13:46Z","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/2506.01099/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Erd\\H{o}s asked for positive integers $m<n$, such that $m$ and $n$ have the same set of prime factors, $m+1$ and $n+1$ have the same set of prime factors, and $m+2$ and $n+2$ have the same set of prime factors. No such integers are known. If one relaxes the problem and only considers the first two conditions, an infinite series of solutions is known: $m=2^k-2$, $n=(m+1)^2-1=2^k \\cdot m$ for all integers $k\\geq 2$. One additional solution is also known: $m=75=3\\cdot 5^2$ and $n=1215=3^5 \\cdot 5$ with $m+1=76=2^2\\cdot 19$ and $n+1=1216=2^6 \\cdot 19$. No other solutions with $n<2^{32}\\approx 4.3\\","authors_text":"Christian Hercher","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-01T17:48:06Z","title":"On one of Erd\\H{o}s' Problems -- An Efficient Search for Benelux Pairs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01099","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:f27a8a7499760ac179f9603e1cf295b24e1f8fe631b69194564b440ca8597dd6","target":"record","created_at":"2026-07-05T11:13:46Z","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":"05dd4071bf2b5b7fa652a659fce96e3d406c92419696d0ed454005a3e5672ac0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2025-06-01T17:48:06Z","title_canon_sha256":"242b95ed703c4fdce830ecb954c9fd4707e44982f604f44fe2447ba3bb9946f8"},"schema_version":"1.0","source":{"id":"2506.01099","kind":"arxiv","version":1}},"canonical_sha256":"7e20f04446c9a1840c23e42fbb1b5c78a9031b88137d6bb4cfbc91bf1a6bfe50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e20f04446c9a1840c23e42fbb1b5c78a9031b88137d6bb4cfbc91bf1a6bfe50","first_computed_at":"2026-07-05T11:13:46.384369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:13:46.384369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zne0H5e5xKbxe4yDxmI+jhXfXFR4Q3B4B7SGkJtKlmPN25DYX1Eb84SxzixptXuOuXPjuPsJ8GB9mZ1bZUKpCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:13:46.384818Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f27a8a7499760ac179f9603e1cf295b24e1f8fe631b69194564b440ca8597dd6","sha256:bf3d42d0b2dd888d9a9e774d8d5cd5e4d2311b9e1c829e6288e638f3be524c86"],"state_sha256":"ce9de59a1986d0745c1acf7abab741628892113fd9454c8e842a1ddd3365046d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6P8vwq8u0XNlqrJmm4BprO9UW9sqCaEOg2traXXmdiBBIEIxuFj7ULpnQan0wyVHZRl+fK3tgxdxgDAGqdJUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:57:32.430385Z","bundle_sha256":"0563222b517ff7498b20bc5666908cf1ff92e9252c6f176def94bc086ad9f9e4"}}