{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5OCKMXOWPH62EQAHDAQH26NYZZ","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":"e24adb75eaba845df95ac20c06ec1b8489bccc98a69d5696a54873175e9131c4","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-02-13T17:56:24Z","title_canon_sha256":"a5f5be63cb125984eb2866bf6957c88f1cce25f03a3724bdd18983c1a9c0c6ed"},"schema_version":"1.0","source":{"id":"2502.09539","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09539","created_at":"2026-07-05T10:13:59Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09539v1","created_at":"2026-07-05T10:13:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09539","created_at":"2026-07-05T10:13:59Z"},{"alias_kind":"pith_short_12","alias_value":"5OCKMXOWPH62","created_at":"2026-07-05T10:13:59Z"},{"alias_kind":"pith_short_16","alias_value":"5OCKMXOWPH62EQAH","created_at":"2026-07-05T10:13:59Z"},{"alias_kind":"pith_short_8","alias_value":"5OCKMXOW","created_at":"2026-07-05T10:13:59Z"}],"graph_snapshots":[{"event_id":"sha256:963d300e1a014f84569a57d2dcbea40b0b9d84cafea6d3f450da031d1afc0c69","target":"graph","created_at":"2026-07-05T10:13:59Z","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/2502.09539/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{A}\\subset\\mathbb{R}_{\\geqslant1}$ be a countable set such that $\\limsup_{x\\to\\infty}\\frac{1}{\\log x}\\sum_{\\alpha\\in\\mathcal{A}\\cap[1,x]}\\frac{1}{\\alpha}>0$. We prove that, for every $\\varepsilon>0$, there exist infinitely many pairs $(\\alpha, \\beta)\\in \\mathcal{A}^2$ such that $\\alpha\\neq \\beta$ and $|n\\alpha-\\beta| <\\varepsilon$ for some positive integer $n$. This resolves a problem of Erd\\H{o}s from 1948. A critical role in the proof is played by the machinery of GCD graphs, which were introduced by the first author and by James Maynard in their work on the Duffin--Schaeffer co","authors_text":"Dimitris Koukoulopoulos, Jared Duker Lichtman, Youness Lamzouri","cross_cats":["math.CO","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-02-13T17:56:24Z","title":"Erd\\H{o}s's integer dilation approximation problem and GCD graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09539","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:d15910fa8f2fb10c43f071dc52b5e3f2116dc22e52b4610e211320384e98ee5c","target":"record","created_at":"2026-07-05T10:13:59Z","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":"e24adb75eaba845df95ac20c06ec1b8489bccc98a69d5696a54873175e9131c4","cross_cats_sorted":["math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-02-13T17:56:24Z","title_canon_sha256":"a5f5be63cb125984eb2866bf6957c88f1cce25f03a3724bdd18983c1a9c0c6ed"},"schema_version":"1.0","source":{"id":"2502.09539","kind":"arxiv","version":1}},"canonical_sha256":"eb84a65dd679fda2400718207d79b8ce68e7a890053f7b7d2ad088cefd21a29d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb84a65dd679fda2400718207d79b8ce68e7a890053f7b7d2ad088cefd21a29d","first_computed_at":"2026-07-05T10:13:59.221606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:59.221606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtkVayTSDvnvIIeH4xLHmugvCoYb9LOHfv6yp/DTsmyV8hBCy7vCF6TkyUFYMQfy/JMi9H4EMQ2LY2sdNdOLCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:59.222117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.09539","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d15910fa8f2fb10c43f071dc52b5e3f2116dc22e52b4610e211320384e98ee5c","sha256:963d300e1a014f84569a57d2dcbea40b0b9d84cafea6d3f450da031d1afc0c69"],"state_sha256":"d7ea6ddc348028280b36b6d89c06d150b8466e4df1cbf4e338e203a5defc2b30"}