{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RD2XJY252LPDNIJC2XUDDQB5HX","short_pith_number":"pith:RD2XJY25","schema_version":"1.0","canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","source":{"kind":"arxiv","id":"2605.26145","version":1},"attestation_state":"computed","paper":{"title":"An incomplete attack on the upper bound of the unit distance problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Steven Senger","submitted_at":"2026-05-22T21:30:47Z","abstract_excerpt":"This is an incomplete attempt to show that the upper bound of $\\lesssim n^\\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$ points and $n$ lines that attain the sharp bound of the Szemer\\'edi-Trotter point-line incidence bound."},"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.26145","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-22T21:30:47Z","cross_cats_sorted":[],"title_canon_sha256":"c37f45180c681d2c15444cdc6ec1aad0e965632b0f3ec52e40b2290ea4b01c66","abstract_canon_sha256":"7a9f05a56581f0e21db902393bb90c27aaac7796a08a605881822acb1aef6046"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T00:04:26.122175Z","signature_b64":"f6ZnH9ggENhbKK+03J528AgeAwgUAgTsKS3mup6WFCDSnCIO5h6aal8uX3EL7ATZ/ELJVlvqHf7EV4/+d3zZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","last_reissued_at":"2026-05-27T00:04:26.121354Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T00:04:26.121354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An incomplete attack on the upper bound of the unit distance problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Steven Senger","submitted_at":"2026-05-22T21:30:47Z","abstract_excerpt":"This is an incomplete attempt to show that the upper bound of $\\lesssim n^\\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$ points and $n$ lines that attain the sharp bound of the Szemer\\'edi-Trotter point-line incidence bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26145","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.26145/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.26145","created_at":"2026-05-27T00:04:26.121482+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26145v1","created_at":"2026-05-27T00:04:26.121482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26145","created_at":"2026-05-27T00:04:26.121482+00:00"},{"alias_kind":"pith_short_12","alias_value":"RD2XJY252LPD","created_at":"2026-05-27T00:04:26.121482+00:00"},{"alias_kind":"pith_short_16","alias_value":"RD2XJY252LPDNIJC","created_at":"2026-05-27T00:04:26.121482+00:00"},{"alias_kind":"pith_short_8","alias_value":"RD2XJY25","created_at":"2026-05-27T00:04:26.121482+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/RD2XJY252LPDNIJC2XUDDQB5HX","json":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX.json","graph_json":"https://pith.science/api/pith-number/RD2XJY252LPDNIJC2XUDDQB5HX/graph.json","events_json":"https://pith.science/api/pith-number/RD2XJY252LPDNIJC2XUDDQB5HX/events.json","paper":"https://pith.science/paper/RD2XJY25"},"agent_actions":{"view_html":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX","download_json":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX.json","view_paper":"https://pith.science/paper/RD2XJY25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26145&json=true","fetch_graph":"https://pith.science/api/pith-number/RD2XJY252LPDNIJC2XUDDQB5HX/graph.json","fetch_events":"https://pith.science/api/pith-number/RD2XJY252LPDNIJC2XUDDQB5HX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/action/storage_attestation","attest_author":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/action/author_attestation","sign_citation":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/action/citation_signature","submit_replication":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/action/replication_record"}},"created_at":"2026-05-27T00:04:26.121482+00:00","updated_at":"2026-05-27T00:04:26.121482+00:00"}