{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RD2XJY252LPDNIJC2XUDDQB5HX","short_pith_number":"pith:RD2XJY25","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"},"canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","source":{"kind":"arxiv","id":"2605.26145","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26145","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26145v1","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26145","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"RD2XJY252LPD","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"RD2XJY252LPDNIJC","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"RD2XJY25","created_at":"2026-05-27T00:04:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RD2XJY252LPDNIJC2XUDDQB5HX","target":"record","payload":{"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"},"canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","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"},"source_kind":"arxiv","source_id":"2605.26145","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T00:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98PnFRdhLOjPexpTsUKcrIyxR0mOL3/QgW8hhE8t8gbz/dN1uH+UiyYqd2kVavIsFcOuq8tBIod9B7VxUPOiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:16:50.933131Z"},"content_sha256":"a919198ab5955256979bf6469446601d4d029ecee2d2b07db13c00fde9ef8e62","schema_version":"1.0","event_id":"sha256:a919198ab5955256979bf6469446601d4d029ecee2d2b07db13c00fde9ef8e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RD2XJY252LPDNIJC2XUDDQB5HX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T00:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VOAgNP0Ib3Sei1bh/DUs4dF6rRTskHqQnf2lg5Q2KZjJPIGpYEnSaDwjxLd+YAdbS4vUhZl+lA7hfItuspHKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:16:50.933524Z"},"content_sha256":"e91ea0d0b73d75e38f23e68885d14b6a980f0e956703bf114c89c93d9a558b76","schema_version":"1.0","event_id":"sha256:e91ea0d0b73d75e38f23e68885d14b6a980f0e956703bf114c89c93d9a558b76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/bundle.json","state_url":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RD2XJY252LPDNIJC2XUDDQB5HX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T16:16:50Z","links":{"resolver":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX","bundle":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/bundle.json","state":"https://pith.science/pith/RD2XJY252LPDNIJC2XUDDQB5HX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RD2XJY252LPDNIJC2XUDDQB5HX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RD2XJY252LPDNIJC2XUDDQB5HX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7a9f05a56581f0e21db902393bb90c27aaac7796a08a605881822acb1aef6046","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-22T21:30:47Z","title_canon_sha256":"c37f45180c681d2c15444cdc6ec1aad0e965632b0f3ec52e40b2290ea4b01c66"},"schema_version":"1.0","source":{"id":"2605.26145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26145","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26145v1","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26145","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"RD2XJY252LPD","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"RD2XJY252LPDNIJC","created_at":"2026-05-27T00:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"RD2XJY25","created_at":"2026-05-27T00:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:e91ea0d0b73d75e38f23e68885d14b6a980f0e956703bf114c89c93d9a558b76","target":"graph","created_at":"2026-05-27T00:04:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Steven Senger","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-22T21:30:47Z","title":"An incomplete attack on the upper bound of the unit distance problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26145","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a919198ab5955256979bf6469446601d4d029ecee2d2b07db13c00fde9ef8e62","target":"record","created_at":"2026-05-27T00:04:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7a9f05a56581f0e21db902393bb90c27aaac7796a08a605881822acb1aef6046","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-05-22T21:30:47Z","title_canon_sha256":"c37f45180c681d2c15444cdc6ec1aad0e965632b0f3ec52e40b2290ea4b01c66"},"schema_version":"1.0","source":{"id":"2605.26145","kind":"arxiv","version":1}},"canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88f574e35dd2de36a122d5e831c03d3dfd9576d004c57272b3341248ca7ef3bc","first_computed_at":"2026-05-27T00:04:26.121354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T00:04:26.121354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f6ZnH9ggENhbKK+03J528AgeAwgUAgTsKS3mup6WFCDSnCIO5h6aal8uX3EL7ATZ/ELJVlvqHf7EV4/+d3zZCw==","signature_status":"signed_v1","signed_at":"2026-05-27T00:04:26.122175Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a919198ab5955256979bf6469446601d4d029ecee2d2b07db13c00fde9ef8e62","sha256:e91ea0d0b73d75e38f23e68885d14b6a980f0e956703bf114c89c93d9a558b76"],"state_sha256":"3e318fbff71a0d78fa0703e3e610131e83af4b081373019341fcab5a7ee23ead"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmfrP6g0iechXsYHXFVJ7RktcP2QGTZcnOsogfGqoyVRPf4JnnIYM+y4GfBq1gEaabw1HH3tv8QsIOTbCXDKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:16:50.935563Z","bundle_sha256":"1e9eaf2d16a6fd647c16e25507304c40a547d3d53b3c19fef2567f3cd77ab6a5"}}