{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BVYNNQIVJXRRI3W55EEYU4CHL3","short_pith_number":"pith:BVYNNQIV","schema_version":"1.0","canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","source":{"kind":"arxiv","id":"1709.08048","version":1},"attestation_state":"computed","paper":{"title":"On the unit distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CA","authors_text":"Alex Iosevich","submitted_at":"2017-09-23T13:06:26Z","abstract_excerpt":"The Erd\\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\\leq C_{\\epsilon} n^{1+\\epsilon}$ for any $\\epsilon>0$. The best known bound is $Cn^{\\frac{4}{3}}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $\\frac{4}{3}$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and "},"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":"1709.08048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d88d59b995a87cc6639ebee08a4b0e42307393f11db669362d6515f18b97a0e4","abstract_canon_sha256":"5b5b5780ddd32bd8f12cfcbfd1278054a1c40fb39763e5806fe4a99f33e5f1d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:28.145681Z","signature_b64":"sjNyjQ/xKZjTjP2QpnLatZ28u5+gJAUyGesbiIz9EiaaphCSHXlKBBEeEC5fg3iMtm8/suG3TKSJCBqzkERZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","last_reissued_at":"2026-05-18T00:34:28.145034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:28.145034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the unit distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CA","authors_text":"Alex Iosevich","submitted_at":"2017-09-23T13:06:26Z","abstract_excerpt":"The Erd\\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\\leq C_{\\epsilon} n^{1+\\epsilon}$ for any $\\epsilon>0$. The best known bound is $Cn^{\\frac{4}{3}}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $\\frac{4}{3}$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08048","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.08048","created_at":"2026-05-18T00:34:28.145129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08048v1","created_at":"2026-05-18T00:34:28.145129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08048","created_at":"2026-05-18T00:34:28.145129+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVYNNQIVJXRR","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVYNNQIVJXRRI3W5","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVYNNQIV","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3","json":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3.json","graph_json":"https://pith.science/api/pith-number/BVYNNQIVJXRRI3W55EEYU4CHL3/graph.json","events_json":"https://pith.science/api/pith-number/BVYNNQIVJXRRI3W55EEYU4CHL3/events.json","paper":"https://pith.science/paper/BVYNNQIV"},"agent_actions":{"view_html":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3","download_json":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3.json","view_paper":"https://pith.science/paper/BVYNNQIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08048&json=true","fetch_graph":"https://pith.science/api/pith-number/BVYNNQIVJXRRI3W55EEYU4CHL3/graph.json","fetch_events":"https://pith.science/api/pith-number/BVYNNQIVJXRRI3W55EEYU4CHL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/action/storage_attestation","attest_author":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/action/author_attestation","sign_citation":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/action/citation_signature","submit_replication":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/action/replication_record"}},"created_at":"2026-05-18T00:34:28.145129+00:00","updated_at":"2026-05-18T00:34:28.145129+00:00"}