{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:54A23C4DFUP7LCE6BHRS2YCN7D","short_pith_number":"pith:54A23C4D","schema_version":"1.0","canonical_sha256":"ef01ad8b832d1ff5889e09e32d604df8d0d36651e23347730fe1a1730c908c1a","source":{"kind":"arxiv","id":"1010.5908","version":3},"attestation_state":"computed","paper":{"title":"An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fernando G. Lobo, Jos\\'e C. Pereira","submitted_at":"2010-10-28T09:52:34Z","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"},"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":"1010.5908","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-10-28T09:52:34Z","cross_cats_sorted":[],"title_canon_sha256":"c0c581d73f890ea6e28e7d9e7b8047defd6e5414c865527596a15d2fc2c9d709","abstract_canon_sha256":"d64f6500b5653e11db930893aed29b370d8a79a7588b0718970f8440261b8971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.408331Z","signature_b64":"l5tquQmtGtqbyxpiellCiXhozifAf2KJc8te2NoRBuxKssLqHXpWLNaBrBv+4VGNejQKVmUv9QWxPW9LPZ81Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef01ad8b832d1ff5889e09e32d604df8d0d36651e23347730fe1a1730c908c1a","last_reissued_at":"2026-05-18T02:23:38.407686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.407686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fernando G. Lobo, Jos\\'e C. Pereira","submitted_at":"2010-10-28T09:52:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5908","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1010.5908","created_at":"2026-05-18T02:23:38.407779+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5908v3","created_at":"2026-05-18T02:23:38.407779+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5908","created_at":"2026-05-18T02:23:38.407779+00:00"},{"alias_kind":"pith_short_12","alias_value":"54A23C4DFUP7","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"54A23C4DFUP7LCE6","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"54A23C4D","created_at":"2026-05-18T12:26:04.259169+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/54A23C4DFUP7LCE6BHRS2YCN7D","json":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D.json","graph_json":"https://pith.science/api/pith-number/54A23C4DFUP7LCE6BHRS2YCN7D/graph.json","events_json":"https://pith.science/api/pith-number/54A23C4DFUP7LCE6BHRS2YCN7D/events.json","paper":"https://pith.science/paper/54A23C4D"},"agent_actions":{"view_html":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D","download_json":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D.json","view_paper":"https://pith.science/paper/54A23C4D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5908&json=true","fetch_graph":"https://pith.science/api/pith-number/54A23C4DFUP7LCE6BHRS2YCN7D/graph.json","fetch_events":"https://pith.science/api/pith-number/54A23C4DFUP7LCE6BHRS2YCN7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D/action/storage_attestation","attest_author":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D/action/author_attestation","sign_citation":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D/action/citation_signature","submit_replication":"https://pith.science/pith/54A23C4DFUP7LCE6BHRS2YCN7D/action/replication_record"}},"created_at":"2026-05-18T02:23:38.407779+00:00","updated_at":"2026-05-18T02:23:38.407779+00:00"}