{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:BSPV7J4WHHHXMCUUXWC2VEM46U","short_pith_number":"pith:BSPV7J4W","schema_version":"1.0","canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","source":{"kind":"arxiv","id":"cs/0512091","version":3},"attestation_state":"computed","paper":{"title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Michiel Smid, Prosenjit Bose, Stefan Langerman","submitted_at":"2005-12-23T04:28:12Z","abstract_excerpt":"We consider preprocessing a set $S$ of $n$ points in convex position in the plane into a data structure supporting queries of the following form: given a point $q$ and a directed line $\\ell$ in the plane, report the point of $S$ that is farthest from (or, alternatively, nearest to) the point $q$ among all points to the left of line $\\ell$. We present two data structures for this problem. The first data structure uses $O(n^{1+\\varepsilon})$ space and preprocessing time, and answers queries in $O(2^{1/\\varepsilon} \\log n)$ time, for any $0 < \\varepsilon < 1$. The second data structure uses $O(n "},"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":"cs/0512091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2005-12-23T04:28:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d4337bce30d4882b9df24d1f3c9ee91384bf1a3ac6a3cb1e8815d026f7c98465","abstract_canon_sha256":"8da4b2d1c162a10c7bd1069398b97cae755c85192af598c6edee1c8ec3a5605c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.995034Z","signature_b64":"8keTErCWPPZml1WcSQGdfockdpiJ/XaBjNJ9QaOOOMK9s4+hlNppS8ifse6DXzD8ROHAGz2Iggzwgk1E2LVwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","last_reissued_at":"2026-05-18T00:32:55.994294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.994294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Michiel Smid, Prosenjit Bose, Stefan Langerman","submitted_at":"2005-12-23T04:28:12Z","abstract_excerpt":"We consider preprocessing a set $S$ of $n$ points in convex position in the plane into a data structure supporting queries of the following form: given a point $q$ and a directed line $\\ell$ in the plane, report the point of $S$ that is farthest from (or, alternatively, nearest to) the point $q$ among all points to the left of line $\\ell$. We present two data structures for this problem. The first data structure uses $O(n^{1+\\varepsilon})$ space and preprocessing time, and answers queries in $O(2^{1/\\varepsilon} \\log n)$ time, for any $0 < \\varepsilon < 1$. The second data structure uses $O(n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512091","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":"cs/0512091","created_at":"2026-05-18T00:32:55.994442+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512091v3","created_at":"2026-05-18T00:32:55.994442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512091","created_at":"2026-05-18T00:32:55.994442+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSPV7J4WHHHX","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSPV7J4WHHHXMCUU","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSPV7J4W","created_at":"2026-05-18T12:25:53.335082+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/BSPV7J4WHHHXMCUUXWC2VEM46U","json":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U.json","graph_json":"https://pith.science/api/pith-number/BSPV7J4WHHHXMCUUXWC2VEM46U/graph.json","events_json":"https://pith.science/api/pith-number/BSPV7J4WHHHXMCUUXWC2VEM46U/events.json","paper":"https://pith.science/paper/BSPV7J4W"},"agent_actions":{"view_html":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U","download_json":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U.json","view_paper":"https://pith.science/paper/BSPV7J4W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512091&json=true","fetch_graph":"https://pith.science/api/pith-number/BSPV7J4WHHHXMCUUXWC2VEM46U/graph.json","fetch_events":"https://pith.science/api/pith-number/BSPV7J4WHHHXMCUUXWC2VEM46U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/action/storage_attestation","attest_author":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/action/author_attestation","sign_citation":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/action/citation_signature","submit_replication":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/action/replication_record"}},"created_at":"2026-05-18T00:32:55.994442+00:00","updated_at":"2026-05-18T00:32:55.994442+00:00"}