{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ASEFE3C7LFR477ILC6WNKD5T3G","short_pith_number":"pith:ASEFE3C7","schema_version":"1.0","canonical_sha256":"0488526c5f5963cffd0b17acd50fb3d9abcf28c5f63d80620983d608174b0389","source":{"kind":"arxiv","id":"2607.20422","version":1},"attestation_state":"computed","paper":{"title":"The sharp exponent for the minimal distance problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Cosmin Pohoata","submitted_at":"2026-07-22T17:58:33Z","abstract_excerpt":"We show that for every fixed $\\varepsilon>0$, there exist arbitrarily large families of point-line pairs $(x_1,\\ell_1),\\ldots,(x_n,\\ell_n)$ in $[0,1]^2$, with $x_i \\in \\ell_i$ for all $i$, and such that $\\operatorname{dist}(x_i,\\ell_j)\\ge n^{-2/3-\\varepsilon}$ for all $i \\neq j$. Combined with a previous result of Cohen, the author, and Zakharov, this solves the minimal distance problem."},"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":"2607.20422","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-22T17:58:33Z","cross_cats_sorted":["math.MG","math.NT"],"title_canon_sha256":"614f7417ff7a550b5f0808a66f536f2a5a8c3605b212a6674974ff2cec1032ea","abstract_canon_sha256":"16a5ad83a957dd7b41c0dbac45f9ebcea942518b75a772c8b1b6c1cffe36322f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:25:20.078325Z","signature_b64":"PBkLGlEJTv3NJsjEbmJIa5x+SZcM7jQOSSKDiSvjAUJ/9hZtS4GkzLULy3GYOgxANZE3aUtsqNOC5WUkjGlQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0488526c5f5963cffd0b17acd50fb3d9abcf28c5f63d80620983d608174b0389","last_reissued_at":"2026-07-23T01:25:20.077349Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:25:20.077349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sharp exponent for the minimal distance problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.CO","authors_text":"Cosmin Pohoata","submitted_at":"2026-07-22T17:58:33Z","abstract_excerpt":"We show that for every fixed $\\varepsilon>0$, there exist arbitrarily large families of point-line pairs $(x_1,\\ell_1),\\ldots,(x_n,\\ell_n)$ in $[0,1]^2$, with $x_i \\in \\ell_i$ for all $i$, and such that $\\operatorname{dist}(x_i,\\ell_j)\\ge n^{-2/3-\\varepsilon}$ for all $i \\neq j$. Combined with a previous result of Cohen, the author, and Zakharov, this solves the minimal distance problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.20422","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/2607.20422/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":"2607.20422","created_at":"2026-07-23T01:25:20.077855+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.20422v1","created_at":"2026-07-23T01:25:20.077855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.20422","created_at":"2026-07-23T01:25:20.077855+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASEFE3C7LFR4","created_at":"2026-07-23T01:25:20.077855+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASEFE3C7LFR477IL","created_at":"2026-07-23T01:25:20.077855+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASEFE3C7","created_at":"2026-07-23T01:25:20.077855+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/ASEFE3C7LFR477ILC6WNKD5T3G","json":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G.json","graph_json":"https://pith.science/api/pith-number/ASEFE3C7LFR477ILC6WNKD5T3G/graph.json","events_json":"https://pith.science/api/pith-number/ASEFE3C7LFR477ILC6WNKD5T3G/events.json","paper":"https://pith.science/paper/ASEFE3C7"},"agent_actions":{"view_html":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G","download_json":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G.json","view_paper":"https://pith.science/paper/ASEFE3C7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.20422&json=true","fetch_graph":"https://pith.science/api/pith-number/ASEFE3C7LFR477ILC6WNKD5T3G/graph.json","fetch_events":"https://pith.science/api/pith-number/ASEFE3C7LFR477ILC6WNKD5T3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G/action/storage_attestation","attest_author":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G/action/author_attestation","sign_citation":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G/action/citation_signature","submit_replication":"https://pith.science/pith/ASEFE3C7LFR477ILC6WNKD5T3G/action/replication_record"}},"created_at":"2026-07-23T01:25:20.077855+00:00","updated_at":"2026-07-23T01:25:20.077855+00:00"}