{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5OCKMXOWPH62EQAHDAQH26NYZZ","short_pith_number":"pith:5OCKMXOW","schema_version":"1.0","canonical_sha256":"eb84a65dd679fda2400718207d79b8ce68e7a890053f7b7d2ad088cefd21a29d","source":{"kind":"arxiv","id":"2502.09539","version":1},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s's integer dilation approximation problem and GCD graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.NT","authors_text":"Dimitris Koukoulopoulos, Jared Duker Lichtman, Youness Lamzouri","submitted_at":"2025-02-13T17:56:24Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.09539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-02-13T17:56:24Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"a5f5be63cb125984eb2866bf6957c88f1cce25f03a3724bdd18983c1a9c0c6ed","abstract_canon_sha256":"e24adb75eaba845df95ac20c06ec1b8489bccc98a69d5696a54873175e9131c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:59.222117Z","signature_b64":"vtkVayTSDvnvIIeH4xLHmugvCoYb9LOHfv6yp/DTsmyV8hBCy7vCF6TkyUFYMQfy/JMi9H4EMQ2LY2sdNdOLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb84a65dd679fda2400718207d79b8ce68e7a890053f7b7d2ad088cefd21a29d","last_reissued_at":"2026-07-05T10:13:59.221606Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:59.221606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s's integer dilation approximation problem and GCD graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.NT","authors_text":"Dimitris Koukoulopoulos, Jared Duker Lichtman, Youness Lamzouri","submitted_at":"2025-02-13T17:56:24Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09539","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/2502.09539/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.09539","created_at":"2026-07-05T10:13:59.221670+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.09539v1","created_at":"2026-07-05T10:13:59.221670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09539","created_at":"2026-07-05T10:13:59.221670+00:00"},{"alias_kind":"pith_short_12","alias_value":"5OCKMXOWPH62","created_at":"2026-07-05T10:13:59.221670+00:00"},{"alias_kind":"pith_short_16","alias_value":"5OCKMXOWPH62EQAH","created_at":"2026-07-05T10:13:59.221670+00:00"},{"alias_kind":"pith_short_8","alias_value":"5OCKMXOW","created_at":"2026-07-05T10:13:59.221670+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.00301","citing_title":"Primitive sets and von Mangoldt chains: Erd\\H{o}s Problem #1196 and beyond","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ","json":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ.json","graph_json":"https://pith.science/api/pith-number/5OCKMXOWPH62EQAHDAQH26NYZZ/graph.json","events_json":"https://pith.science/api/pith-number/5OCKMXOWPH62EQAHDAQH26NYZZ/events.json","paper":"https://pith.science/paper/5OCKMXOW"},"agent_actions":{"view_html":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ","download_json":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ.json","view_paper":"https://pith.science/paper/5OCKMXOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.09539&json=true","fetch_graph":"https://pith.science/api/pith-number/5OCKMXOWPH62EQAHDAQH26NYZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5OCKMXOWPH62EQAHDAQH26NYZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ/action/storage_attestation","attest_author":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ/action/author_attestation","sign_citation":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ/action/citation_signature","submit_replication":"https://pith.science/pith/5OCKMXOWPH62EQAHDAQH26NYZZ/action/replication_record"}},"created_at":"2026-07-05T10:13:59.221670+00:00","updated_at":"2026-07-05T10:13:59.221670+00:00"}