{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EGTTLWM6GUHI2QZJUCDTBNEV5K","short_pith_number":"pith:EGTTLWM6","schema_version":"1.0","canonical_sha256":"21a735d99e350e8d4329a08730b495eaa8ed5459358c58b6d10cd45ad0184cc1","source":{"kind":"arxiv","id":"2009.12450","version":2},"attestation_state":"computed","paper":{"title":"Tinkering with Lattices: A New Take on the Erd\\H{o}s Distance Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Elena Kim, Elzbieta Boldyriew, Eyvindur Palsson, Fernando Trejos Su\\'arez, Jason Zhao, Sean Sovine, Steven J. Miller","submitted_at":"2020-09-25T22:04:09Z","abstract_excerpt":"The Erd\\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \\textit{near-optimal}, as it spans $\\Theta(N/\\sqrt{\\log(N)})$ distinct distances, the lower bound for a set of $N$ points (Erd\\H{o}s, 1946). The only previous non-asymptotic work related to the Erd\\H{o}s distance problem that has been done was for $N \\leq 13$. We take a new non-asymptotic approach to this problem in a model case, studying the distance distribution, or in other words, the plot of frequencies of each dis"},"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":"2009.12450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2020-09-25T22:04:09Z","cross_cats_sorted":[],"title_canon_sha256":"056f8f5b030ab03ab931eecdffccdd98f55869920ed4d9a7dec4124cdece42d4","abstract_canon_sha256":"ab9175f2184f3ef183ad96dc54cc5b748094e0c7c2d04da231c305026b763449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:11:05.528525Z","signature_b64":"hs1ADqZZTNLBzv/Dm378XNYsxBU+6MWp+iwHiHad1dwTXZIjitSYYNWuXdumQKPn8qcBwTw8LtvJ7KLMH575Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a735d99e350e8d4329a08730b495eaa8ed5459358c58b6d10cd45ad0184cc1","last_reissued_at":"2026-07-05T02:11:05.528035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:11:05.528035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tinkering with Lattices: A New Take on the Erd\\H{o}s Distance Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Elena Kim, Elzbieta Boldyriew, Eyvindur Palsson, Fernando Trejos Su\\'arez, Jason Zhao, Sean Sovine, Steven J. Miller","submitted_at":"2020-09-25T22:04:09Z","abstract_excerpt":"The Erd\\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \\textit{near-optimal}, as it spans $\\Theta(N/\\sqrt{\\log(N)})$ distinct distances, the lower bound for a set of $N$ points (Erd\\H{o}s, 1946). The only previous non-asymptotic work related to the Erd\\H{o}s distance problem that has been done was for $N \\leq 13$. We take a new non-asymptotic approach to this problem in a model case, studying the distance distribution, or in other words, the plot of frequencies of each dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.12450","kind":"arxiv","version":2},"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/2009.12450/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":"2009.12450","created_at":"2026-07-05T02:11:05.528091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.12450v2","created_at":"2026-07-05T02:11:05.528091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.12450","created_at":"2026-07-05T02:11:05.528091+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGTTLWM6GUHI","created_at":"2026-07-05T02:11:05.528091+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGTTLWM6GUHI2QZJ","created_at":"2026-07-05T02:11:05.528091+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGTTLWM6","created_at":"2026-07-05T02:11:05.528091+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/EGTTLWM6GUHI2QZJUCDTBNEV5K","json":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K.json","graph_json":"https://pith.science/api/pith-number/EGTTLWM6GUHI2QZJUCDTBNEV5K/graph.json","events_json":"https://pith.science/api/pith-number/EGTTLWM6GUHI2QZJUCDTBNEV5K/events.json","paper":"https://pith.science/paper/EGTTLWM6"},"agent_actions":{"view_html":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K","download_json":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K.json","view_paper":"https://pith.science/paper/EGTTLWM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.12450&json=true","fetch_graph":"https://pith.science/api/pith-number/EGTTLWM6GUHI2QZJUCDTBNEV5K/graph.json","fetch_events":"https://pith.science/api/pith-number/EGTTLWM6GUHI2QZJUCDTBNEV5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K/action/storage_attestation","attest_author":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K/action/author_attestation","sign_citation":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K/action/citation_signature","submit_replication":"https://pith.science/pith/EGTTLWM6GUHI2QZJUCDTBNEV5K/action/replication_record"}},"created_at":"2026-07-05T02:11:05.528091+00:00","updated_at":"2026-07-05T02:11:05.528091+00:00"}