{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RPSZDILLYMZYU2BQHSLOY2NQTZ","short_pith_number":"pith:RPSZDILL","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"},"canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","source":{"kind":"arxiv","id":"2605.20579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20579","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20579v1","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20579","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"RPSZDILLYMZY","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"RPSZDILLYMZYU2BQ","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"RPSZDILL","created_at":"2026-05-21T01:04:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RPSZDILLYMZYU2BQHSLOY2NQTZ","target":"record","payload":{"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"},"canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","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"},"source_kind":"arxiv","source_id":"2605.20579","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-21T01:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK5c7BvDd98nUjbrrgC7TqPFDnLShX5PX1cc6MF7j/04a7HfeGb5Du0TZAdJsAcLuJuHP1m6woE5J/0wN643AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:47.083768Z"},"content_sha256":"acaf630dab6eca0694e4fb8d87d93f9acdca71fe82a88fe2ff10ac3b9331f3ae","schema_version":"1.0","event_id":"sha256:acaf630dab6eca0694e4fb8d87d93f9acdca71fe82a88fe2ff10ac3b9331f3ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RPSZDILLYMZYU2BQHSLOY2NQTZ","target":"graph","payload":{"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"},"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-21T01:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fX3KGVQX+oCi/vxuW/HsWzpzrbm6JIbzbuoWKbJN358C+Ak5kK6/zFHbLUGQGqaMZiaCWFWUqir2Fe7ff/lpAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:47.084501Z"},"content_sha256":"a24bad2d13f4840471308a07f915c7cb204dfd69e0717ad591097514100376e0","schema_version":"1.0","event_id":"sha256:a24bad2d13f4840471308a07f915c7cb204dfd69e0717ad591097514100376e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/bundle.json","state_url":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/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-05-25T07:37:47Z","links":{"resolver":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ","bundle":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/bundle.json","state":"https://pith.science/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPSZDILLYMZYU2BQHSLOY2NQTZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RPSZDILLYMZYU2BQHSLOY2NQTZ","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":"4320a0ad5aae13ee3134b8e0c0b983d4a8c7b8a636b05915a1cba79f6526c3ae","cross_cats_sorted":["math.MG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T00:37:35Z","title_canon_sha256":"0c81a6598548fbfea6da6791f28ead14507e70da2a65012ee4b1c4ce7d3a40bc"},"schema_version":"1.0","source":{"id":"2605.20579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20579","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20579v1","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20579","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"RPSZDILLYMZY","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"RPSZDILLYMZYU2BQ","created_at":"2026-05-21T01:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"RPSZDILL","created_at":"2026-05-21T01:04:43Z"}],"graph_snapshots":[{"event_id":"sha256:a24bad2d13f4840471308a07f915c7cb204dfd69e0717ad591097514100376e0","target":"graph","created_at":"2026-05-21T01:04:43Z","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.20579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Will Sawin","cross_cats":["math.MG","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T00:37:35Z","title":"An explicit lower bound for the unit distance problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20579","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:acaf630dab6eca0694e4fb8d87d93f9acdca71fe82a88fe2ff10ac3b9331f3ae","target":"record","created_at":"2026-05-21T01:04:43Z","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":"4320a0ad5aae13ee3134b8e0c0b983d4a8c7b8a636b05915a1cba79f6526c3ae","cross_cats_sorted":["math.MG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T00:37:35Z","title_canon_sha256":"0c81a6598548fbfea6da6791f28ead14507e70da2a65012ee4b1c4ce7d3a40bc"},"schema_version":"1.0","source":{"id":"2605.20579","kind":"arxiv","version":1}},"canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8be591a16bc3338a68303c96ec69b09e7eaaab097fc19d4c334560ee7c41a4e9","first_computed_at":"2026-05-21T01:04:43.281760Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:43.281760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XWbqCmCO+OjC2Bp2OvtQO9tDAakCkDv64WsvrMXn6YFw6UDVqRxGscYBHmWbGaMXlZt5SkKlA3sj9KLwQ2tjBw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:43.282252Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acaf630dab6eca0694e4fb8d87d93f9acdca71fe82a88fe2ff10ac3b9331f3ae","sha256:a24bad2d13f4840471308a07f915c7cb204dfd69e0717ad591097514100376e0"],"state_sha256":"d625914f0438df94c433bce1a4f445b131253850bdd9b80e7b5b708909de246e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0erNJbAetSsxEM/lV2FeEv0LgpOwqNsPVAF15shq31L+MZqrU8L5W+GvbKBALgQ2aSAAy33lO7iItpqK5n2PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:37:47.088214Z","bundle_sha256":"af504b39b2b63b1c63499aa257738a7d40665b3a0921275ccf1f98cebe319231"}}