{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:EQARTLSL6PHCQNT56AOOVSI3KC","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":"17d1f94efd76943e6cad4c5900683f14cc93a6c4c909e9f6588afbbcebdd47d2","cross_cats_sorted":["cs.AI","cs.CG","cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T10:05:23Z","title_canon_sha256":"25b0ddf38aefb655fe26c2c0fd76c16be8ee00bf3a57634441bd9f2ed7191621"},"schema_version":"1.0","source":{"id":"2606.03419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03419","created_at":"2026-06-03T01:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03419v1","created_at":"2026-06-03T01:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03419","created_at":"2026-06-03T01:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"EQARTLSL6PHC","created_at":"2026-06-03T01:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"EQARTLSL6PHCQNT5","created_at":"2026-06-03T01:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"EQARTLSL","created_at":"2026-06-03T01:05:57Z"}],"graph_snapshots":[{"event_id":"sha256:2984a430e2cafbeaafa0b61dfa8cd45f99e14ee5e0acf97756d556c1746c41a1","target":"graph","created_at":"2026-06-03T01:05:57Z","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/2606.03419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The 2026 disproof of Erd\\H{o}s's unit-distance conjecture and Sawin's subsequent explicit quantitative refinement show that the maximum number $u(n)$ of unit distances among $n$ planar points can exceed $n^{1+\\varepsilon}$ for a fixed positive $\\varepsilon$. Sawin's explicit bound gives more than $n^{1.014}$ unit distances for arbitrarily large $n$ and exposes finite parameters whose choice is not fully optimized. This report formulates the finite parameter-selection task as a variant of a nonlinear integer programming problem and proposes an open-source Python verification pipeline, first val","authors_text":"Michael T.M. Emmerich","cross_cats":["cs.AI","cs.CG","cs.NE","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T10:05:23Z","title":"Optimizing Explicit Unit-Distance Lower-Bound Certificates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03419","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:cd9ddb0cd53ee75ff158568a4da1d26f4d6bcfec06f91760fc0f5d51f75eb46c","target":"record","created_at":"2026-06-03T01:05:57Z","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":"17d1f94efd76943e6cad4c5900683f14cc93a6c4c909e9f6588afbbcebdd47d2","cross_cats_sorted":["cs.AI","cs.CG","cs.NE","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T10:05:23Z","title_canon_sha256":"25b0ddf38aefb655fe26c2c0fd76c16be8ee00bf3a57634441bd9f2ed7191621"},"schema_version":"1.0","source":{"id":"2606.03419","kind":"arxiv","version":1}},"canonical_sha256":"240119ae4bf3ce28367df01ceac91b50a6c60cc01b163a671145a5e6febfd270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"240119ae4bf3ce28367df01ceac91b50a6c60cc01b163a671145a5e6febfd270","first_computed_at":"2026-06-03T01:05:57.337906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:57.337906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u+dNOR+udjhH+XMEUrF6CvVJcTV0fWunuEKrkdep5wilK8IPEbJ3BGMSSYUmN0lEcfK8jn58uHstz94cgHrkCA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:57.338578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd9ddb0cd53ee75ff158568a4da1d26f4d6bcfec06f91760fc0f5d51f75eb46c","sha256:2984a430e2cafbeaafa0b61dfa8cd45f99e14ee5e0acf97756d556c1746c41a1"],"state_sha256":"826260b2cc9409e18509f1f791e7212d39eb2bda4baecffe545cb0a8ad9f9e2c"}