{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RPSZDILLYMZYU2BQHSLOY2NQTZ","short_pith_number":"pith:RPSZDILL","schema_version":"1.0","canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","source":{"kind":"arxiv","id":"2605.20579","version":1},"attestation_state":"computed","paper":{"title":"An explicit lower bound for the unit distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Will Sawin","submitted_at":"2026-05-20T00:37:35Z","abstract_excerpt":"We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the same result with an inexplicit exponent greater than $1$, drastically improving on the best previous lower bound and disproving a conjecture of Erd\\H{o}s. The method is number-theoretic, relying on constructing algebraic number fields of large degree and small discriminant with many primes of small norm via a Golod-Shafarevich criterion argument."},"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":"2605.20579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T00:37:35Z","cross_cats_sorted":["math.MG","math.NT"],"title_canon_sha256":"0c81a6598548fbfea6da6791f28ead14507e70da2a65012ee4b1c4ce7d3a40bc","abstract_canon_sha256":"4320a0ad5aae13ee3134b8e0c0b983d4a8c7b8a636b05915a1cba79f6526c3ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:43.282252Z","signature_b64":"XWbqCmCO+OjC2Bp2OvtQO9tDAakCkDv64WsvrMXn6YFw6UDVqRxGscYBHmWbGaMXlZt5SkKlA3sj9KLwQ2tjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","last_reissued_at":"2026-05-21T01:04:43.281760Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:43.281760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An explicit lower bound for the unit distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Will Sawin","submitted_at":"2026-05-20T00:37:35Z","abstract_excerpt":"We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the same result with an inexplicit exponent greater than $1$, drastically improving on the best previous lower bound and disproving a conjecture of Erd\\H{o}s. The method is number-theoretic, relying on constructing algebraic number fields of large degree and small discriminant with many primes of small norm via a Golod-Shafarevich criterion argument."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20579","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/2605.20579/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":"2605.20579","created_at":"2026-05-21T01:04:43.281826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20579v1","created_at":"2026-05-21T01:04:43.281826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20579","created_at":"2026-05-21T01:04:43.281826+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPSZDILLYMZY","created_at":"2026-05-21T01:04:43.281826+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPSZDILLYMZYU2BQ","created_at":"2026-05-21T01:04:43.281826+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPSZDILL","created_at":"2026-05-21T01:04:43.281826+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/RPSZDILLYMZYU2BQHSLOY2NQTZ","json":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ.json","graph_json":"https://pith.science/api/pith-number/RPSZDILLYMZYU2BQHSLOY2NQTZ/graph.json","events_json":"https://pith.science/api/pith-number/RPSZDILLYMZYU2BQHSLOY2NQTZ/events.json","paper":"https://pith.science/paper/RPSZDILL"},"agent_actions":{"view_html":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ","download_json":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ.json","view_paper":"https://pith.science/paper/RPSZDILL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20579&json=true","fetch_graph":"https://pith.science/api/pith-number/RPSZDILLYMZYU2BQHSLOY2NQTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RPSZDILLYMZYU2BQHSLOY2NQTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/action/storage_attestation","attest_author":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/action/author_attestation","sign_citation":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/action/citation_signature","submit_replication":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/action/replication_record"}},"created_at":"2026-05-21T01:04:43.281826+00:00","updated_at":"2026-05-21T01:04:43.281826+00:00"}