{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:54A23C4DFUP7LCE6BHRS2YCN7D","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":"d64f6500b5653e11db930893aed29b370d8a79a7588b0718970f8440261b8971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-10-28T09:52:34Z","title_canon_sha256":"c0c581d73f890ea6e28e7d9e7b8047defd6e5414c865527596a15d2fc2c9d709"},"schema_version":"1.0","source":{"id":"1010.5908","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5908","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5908v3","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5908","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"54A23C4DFUP7","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"54A23C4DFUP7LCE6","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"54A23C4D","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:d22392396c6fea72a65b56babad6f8c2503aa3a81f85fa1755f7d3b94d12bc89","target":"graph","created_at":"2026-05-18T02:23:38Z","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"},"paper":{"abstract_excerpt":"We present an engineered version of the divide-and-conquer algorithm for finding the closest pair of points, within a given set of points in the XY-plane. For this version of the algorithm we show that only two pairwise comparisons are required in the combine step, for each point that lies in the 2 delta-wide vertical slab. The correctness of the algorithm is shown for all Minkowski distances with p>=1. We also show empirically that, although the time complexity of the algorithm is still O(n lg n), the reduction in the total number of comparisons leads to a significant reduction in the total e","authors_text":"Fernando G. Lobo, Jos\\'e C. Pereira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-10-28T09:52:34Z","title":"An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5908","kind":"arxiv","version":3},"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:4d53a444b970e27cf07d0e48c6d4b20e1e6ee309eb2e2c433af85b2632bdadd0","target":"record","created_at":"2026-05-18T02:23:38Z","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":"d64f6500b5653e11db930893aed29b370d8a79a7588b0718970f8440261b8971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-10-28T09:52:34Z","title_canon_sha256":"c0c581d73f890ea6e28e7d9e7b8047defd6e5414c865527596a15d2fc2c9d709"},"schema_version":"1.0","source":{"id":"1010.5908","kind":"arxiv","version":3}},"canonical_sha256":"ef01ad8b832d1ff5889e09e32d604df8d0d36651e23347730fe1a1730c908c1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef01ad8b832d1ff5889e09e32d604df8d0d36651e23347730fe1a1730c908c1a","first_computed_at":"2026-05-18T02:23:38.407686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:38.407686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l5tquQmtGtqbyxpiellCiXhozifAf2KJc8te2NoRBuxKssLqHXpWLNaBrBv+4VGNejQKVmUv9QWxPW9LPZ81Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:38.408331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5908","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d53a444b970e27cf07d0e48c6d4b20e1e6ee309eb2e2c433af85b2632bdadd0","sha256:d22392396c6fea72a65b56babad6f8c2503aa3a81f85fa1755f7d3b94d12bc89"],"state_sha256":"721a129e2121bbbf800a78d73da1041e4d5e415f36c27393aef76b9e43cdff90"}