{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:BSPV7J4WHHHXMCUUXWC2VEM46U","short_pith_number":"pith:BSPV7J4W","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"},"canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","source":{"kind":"arxiv","id":"cs/0512091","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512091","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512091v3","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512091","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"BSPV7J4WHHHX","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"BSPV7J4WHHHXMCUU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"BSPV7J4W","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:BSPV7J4WHHHXMCUUXWC2VEM46U","target":"record","payload":{"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"},"canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","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"},"source_kind":"arxiv","source_id":"cs/0512091","source_version":3,"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-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lR9yAXfx9hpUMW0CJk/JpCVRCKV/E8UC38Qw9BAPHmrijPUwoq4U5OeZV4bl1PbPQFdVhk9cBVhLhRmqGguLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:53:44.081968Z"},"content_sha256":"71831eb8f4dc638714131e675aad741f6c801cc140196ad06b7a79f750e13951","schema_version":"1.0","event_id":"sha256:71831eb8f4dc638714131e675aad741f6c801cc140196ad06b7a79f750e13951"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:BSPV7J4WHHHXMCUUXWC2VEM46U","target":"graph","payload":{"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"},"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-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZzOnxV9wvmg44Dt0D2FQP6nEeFPFbnpbJc0KUgxn5UJwy/nh2xaw8ATYrLAfN1PY6hEqGQ4AkubX683fCMo/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:53:44.082629Z"},"content_sha256":"53c1f251c6c0a7a72ee1cf51848c85ea0c4aebe197e2c96eb0b11778942ab270","schema_version":"1.0","event_id":"sha256:53c1f251c6c0a7a72ee1cf51848c85ea0c4aebe197e2c96eb0b11778942ab270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/bundle.json","state_url":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/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-25T19:53:44Z","links":{"resolver":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U","bundle":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/bundle.json","state":"https://pith.science/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSPV7J4WHHHXMCUUXWC2VEM46U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:BSPV7J4WHHHXMCUUXWC2VEM46U","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":"8da4b2d1c162a10c7bd1069398b97cae755c85192af598c6edee1c8ec3a5605c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2005-12-23T04:28:12Z","title_canon_sha256":"d4337bce30d4882b9df24d1f3c9ee91384bf1a3ac6a3cb1e8815d026f7c98465"},"schema_version":"1.0","source":{"id":"cs/0512091","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0512091","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0512091v3","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512091","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"BSPV7J4WHHHX","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"BSPV7J4WHHHXMCUU","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"BSPV7J4W","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:53c1f251c6c0a7a72ee1cf51848c85ea0c4aebe197e2c96eb0b11778942ab270","target":"graph","created_at":"2026-05-18T00:32:55Z","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 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 ","authors_text":"Boris Aronov, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Michiel Smid, Prosenjit Bose, Stefan Langerman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2005-12-23T04:28:12Z","title":"Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512091","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:71831eb8f4dc638714131e675aad741f6c801cc140196ad06b7a79f750e13951","target":"record","created_at":"2026-05-18T00:32:55Z","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":"8da4b2d1c162a10c7bd1069398b97cae755c85192af598c6edee1c8ec3a5605c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2005-12-23T04:28:12Z","title_canon_sha256":"d4337bce30d4882b9df24d1f3c9ee91384bf1a3ac6a3cb1e8815d026f7c98465"},"schema_version":"1.0","source":{"id":"cs/0512091","kind":"arxiv","version":3}},"canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c9f5fa79639cf760a94bd85aa919cf51519f3c64353ddadec237215dc5b2a9f","first_computed_at":"2026-05-18T00:32:55.994294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:55.994294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8keTErCWPPZml1WcSQGdfockdpiJ/XaBjNJ9QaOOOMK9s4+hlNppS8ifse6DXzD8ROHAGz2Iggzwgk1E2LVwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:55.995034Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0512091","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71831eb8f4dc638714131e675aad741f6c801cc140196ad06b7a79f750e13951","sha256:53c1f251c6c0a7a72ee1cf51848c85ea0c4aebe197e2c96eb0b11778942ab270"],"state_sha256":"6ec85e79d4f9bc5fe6c3770bce3c61a47f9c3789e381b5814c43c99b93575f58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QL0FuNtxvQyIvBhS3nyPTIW7V8kgsmtMVrJjvciXoUj1jt/8j6xCYOmZFJDDAWCTidG1wi+aQoliSPPSFxbsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:53:44.086780Z","bundle_sha256":"0253a7be3c223ac45eec9962a7fdf20f8c84d15925d52b60bf5a35f558e1d78a"}}