{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SAGBPVCKP4LJHKK2YCRI2DZOG6","short_pith_number":"pith:SAGBPVCK","canonical_record":{"source":{"id":"1410.5602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-21T10:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"7f456878f45d49d0449da187768dd882838fb95e376e35292ddcb7469f62905e","abstract_canon_sha256":"0ec62f0321dffd0baba8df939ac38871abf1438ec807e4acd08617f3d8e54f64"},"schema_version":"1.0"},"canonical_sha256":"900c17d44a7f1693a95ac0a28d0f2e37bd02e2445203ee7c1da2c05320ba06f2","source":{"kind":"arxiv","id":"1410.5602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5602","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5602v1","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5602","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"SAGBPVCKP4LJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SAGBPVCKP4LJHKK2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SAGBPVCK","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SAGBPVCKP4LJHKK2YCRI2DZOG6","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-21T10:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"7f456878f45d49d0449da187768dd882838fb95e376e35292ddcb7469f62905e","abstract_canon_sha256":"0ec62f0321dffd0baba8df939ac38871abf1438ec807e4acd08617f3d8e54f64"},"schema_version":"1.0"},"canonical_sha256":"900c17d44a7f1693a95ac0a28d0f2e37bd02e2445203ee7c1da2c05320ba06f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:39.478515Z","signature_b64":"82nhA+4qNHqx+hmXfxPcQOKiCq1oQKlyX8b86lRPamI4SAgNtlzyMBnpETV5asT8Dk4ZJmcZ80zpimG5B7kYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"900c17d44a7f1693a95ac0a28d0f2e37bd02e2445203ee7c1da2c05320ba06f2","last_reissued_at":"2026-05-18T02:39:39.478082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:39.478082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5602","source_version":1,"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-18T02:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwPgd1Zw7QlDS6mJfuE/SySDUyGIwg16iXNtZ1A1vPsF0JFDwQMH6erJBVZ7Wm39PdbO2IUb2BxNwr0j7rrkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:58.999305Z"},"content_sha256":"8e679ac23678c40e8297d65a7288140685f3446f5a5e63f5bc3086b7b7825c9c","schema_version":"1.0","event_id":"sha256:8e679ac23678c40e8297d65a7288140685f3446f5a5e63f5bc3086b7b7825c9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SAGBPVCKP4LJHKK2YCRI2DZOG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal randomized incremental construction for guaranteed logarithmic planar point location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Michael Hemmer, Michal Kleinbort","submitted_at":"2014-10-21T10:10:14Z","abstract_excerpt":"Given a planar map of $n$ segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the well-known trapezoidal-map search-structure that only requires expected $O(n \\log n)$ preprocessing time while deterministically guaranteeing worst-case linear storage space and worst-case logarithmic query time. This settles a long standing open problem; the best previously known construction time of such a structure, which is based on a directed acyclic graph, so-called the history DAG, and with the above worst-case space and query-time guarantees,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5602","kind":"arxiv","version":1},"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-18T02:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"he4v4x9InifIT+5G9QkEb16AcgwQdS5KMO8/0uIPpGzk3dgH/pAKOslUPfXJGarSWu/jKommW+dxegDTqAFGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:49:58.999955Z"},"content_sha256":"eb05216e2bf5a279b9cb659d0fb7b50888722819ed60e5251e5a2ac6a079b8af","schema_version":"1.0","event_id":"sha256:eb05216e2bf5a279b9cb659d0fb7b50888722819ed60e5251e5a2ac6a079b8af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/bundle.json","state_url":"https://pith.science/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/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-26T11:49:59Z","links":{"resolver":"https://pith.science/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6","bundle":"https://pith.science/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/bundle.json","state":"https://pith.science/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAGBPVCKP4LJHKK2YCRI2DZOG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SAGBPVCKP4LJHKK2YCRI2DZOG6","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":"0ec62f0321dffd0baba8df939ac38871abf1438ec807e4acd08617f3d8e54f64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-21T10:10:14Z","title_canon_sha256":"7f456878f45d49d0449da187768dd882838fb95e376e35292ddcb7469f62905e"},"schema_version":"1.0","source":{"id":"1410.5602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5602","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5602v1","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5602","created_at":"2026-05-18T02:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"SAGBPVCKP4LJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SAGBPVCKP4LJHKK2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SAGBPVCK","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:eb05216e2bf5a279b9cb659d0fb7b50888722819ed60e5251e5a2ac6a079b8af","target":"graph","created_at":"2026-05-18T02:39:39Z","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":"Given a planar map of $n$ segments in which we wish to efficiently locate points, we present the first randomized incremental construction of the well-known trapezoidal-map search-structure that only requires expected $O(n \\log n)$ preprocessing time while deterministically guaranteeing worst-case linear storage space and worst-case logarithmic query time. This settles a long standing open problem; the best previously known construction time of such a structure, which is based on a directed acyclic graph, so-called the history DAG, and with the above worst-case space and query-time guarantees,","authors_text":"Dan Halperin, Michael Hemmer, Michal Kleinbort","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-21T10:10:14Z","title":"Optimal randomized incremental construction for guaranteed logarithmic planar point location"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5602","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:8e679ac23678c40e8297d65a7288140685f3446f5a5e63f5bc3086b7b7825c9c","target":"record","created_at":"2026-05-18T02:39:39Z","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":"0ec62f0321dffd0baba8df939ac38871abf1438ec807e4acd08617f3d8e54f64","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-10-21T10:10:14Z","title_canon_sha256":"7f456878f45d49d0449da187768dd882838fb95e376e35292ddcb7469f62905e"},"schema_version":"1.0","source":{"id":"1410.5602","kind":"arxiv","version":1}},"canonical_sha256":"900c17d44a7f1693a95ac0a28d0f2e37bd02e2445203ee7c1da2c05320ba06f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"900c17d44a7f1693a95ac0a28d0f2e37bd02e2445203ee7c1da2c05320ba06f2","first_computed_at":"2026-05-18T02:39:39.478082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:39.478082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82nhA+4qNHqx+hmXfxPcQOKiCq1oQKlyX8b86lRPamI4SAgNtlzyMBnpETV5asT8Dk4ZJmcZ80zpimG5B7kYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:39.478515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e679ac23678c40e8297d65a7288140685f3446f5a5e63f5bc3086b7b7825c9c","sha256:eb05216e2bf5a279b9cb659d0fb7b50888722819ed60e5251e5a2ac6a079b8af"],"state_sha256":"6be46879ed19b48018e7c67a744bcc5226898a9cb0998167e20ea564dee2c7b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9dg4gU1PZkY/dSEpJZ7huKJ+6lberkp8WBEp5iRlnz4T0yYpgmji1RsShPKrOypDKlBUAJimVI2XQmn8xXaCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:49:59.003530Z","bundle_sha256":"ed3683a975d12a195433a77ca61c87dce4879ea3aeeca3a356e09285d3e7c429"}}