{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N642AJSOG64HFTXZ5RMVWYXR6K","short_pith_number":"pith:N642AJSO","canonical_record":{"source":{"id":"1809.10495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T12:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"282a79d6635f2312cda02f185247eeb83d4d8ff115f42f91836d3d030da792db","abstract_canon_sha256":"0af58ff4617c53cf4854548f1fec17ab780e59ae47918eb795ca0e3543749796"},"schema_version":"1.0"},"canonical_sha256":"6fb9a0264e37b872cef9ec595b62f1f2937a73dcad84773a942af02cfca5eecf","source":{"kind":"arxiv","id":"1809.10495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10495","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10495v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10495","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"N642AJSOG64H","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N642AJSOG64HFTXZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N642AJSO","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N642AJSOG64HFTXZ5RMVWYXR6K","target":"record","payload":{"canonical_record":{"source":{"id":"1809.10495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T12:47:28Z","cross_cats_sorted":[],"title_canon_sha256":"282a79d6635f2312cda02f185247eeb83d4d8ff115f42f91836d3d030da792db","abstract_canon_sha256":"0af58ff4617c53cf4854548f1fec17ab780e59ae47918eb795ca0e3543749796"},"schema_version":"1.0"},"canonical_sha256":"6fb9a0264e37b872cef9ec595b62f1f2937a73dcad84773a942af02cfca5eecf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.243493Z","signature_b64":"dxGbOSGyc+B9CB1YnedEh5GlLBLPx11zupYENZJg2VYvWgGjteeRH3OUg5hFjXq5nfGxURVQyCcrA3TD4rpECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fb9a0264e37b872cef9ec595b62f1f2937a73dcad84773a942af02cfca5eecf","last_reissued_at":"2026-05-18T00:04:38.243045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.243045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.10495","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlGfuCNvefKN1WauCTnxabfColi/3lexZEqano8+ORhGbwwtGma4Gef47JbWKgvY6yqTZVo3Q5kaJ0OdRlVOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:16:58.363650Z"},"content_sha256":"4f37a9fcffae6ca87b0d0c3b48fa2ede4cfe8017b8ef3ec4d007bcf6e7e4ca65","schema_version":"1.0","event_id":"sha256:4f37a9fcffae6ca87b0d0c3b48fa2ede4cfe8017b8ef3ec4d007bcf6e7e4ca65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N642AJSOG64HFTXZ5RMVWYXR6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point Location in Incremental Planar Subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh","submitted_at":"2018-09-27T12:47:28Z","abstract_excerpt":"We study the point location problem in incremental (possibly disconnected) planar subdivisions, that is, dynamic subdivisions allowing insertions of edges and vertices only. Specifically, we present an $O(n\\log n)$-space data structure for this problem that supports queries in $O(\\log^2 n)$ time and updates in $O(\\log n\\log\\log n)$ amortized time. This is the first result that achieves polylogarithmic query and update times simultaneously in incremental (possibly disconnected) planar subdivisions. Its update time is significantly faster than the update time of the best known data structure for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10495","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-18T00:04:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZhzHKmBX1NND+4YWkpjZBQYI7lFaAlDjGXz1bq9uKw71MuqnX8Ko/P5y1UwRxV75yfvYMiesEDz54AIGVLvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:16:58.364330Z"},"content_sha256":"2fe1621d570f00e13b60fd4430932d7c3c2096c0e8e5965b969fbadaf17c6c22","schema_version":"1.0","event_id":"sha256:2fe1621d570f00e13b60fd4430932d7c3c2096c0e8e5965b969fbadaf17c6c22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N642AJSOG64HFTXZ5RMVWYXR6K/bundle.json","state_url":"https://pith.science/pith/N642AJSOG64HFTXZ5RMVWYXR6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N642AJSOG64HFTXZ5RMVWYXR6K/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-06-07T10:16:58Z","links":{"resolver":"https://pith.science/pith/N642AJSOG64HFTXZ5RMVWYXR6K","bundle":"https://pith.science/pith/N642AJSOG64HFTXZ5RMVWYXR6K/bundle.json","state":"https://pith.science/pith/N642AJSOG64HFTXZ5RMVWYXR6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N642AJSOG64HFTXZ5RMVWYXR6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N642AJSOG64HFTXZ5RMVWYXR6K","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":"0af58ff4617c53cf4854548f1fec17ab780e59ae47918eb795ca0e3543749796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T12:47:28Z","title_canon_sha256":"282a79d6635f2312cda02f185247eeb83d4d8ff115f42f91836d3d030da792db"},"schema_version":"1.0","source":{"id":"1809.10495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10495","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10495v1","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10495","created_at":"2026-05-18T00:04:38Z"},{"alias_kind":"pith_short_12","alias_value":"N642AJSOG64H","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N642AJSOG64HFTXZ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N642AJSO","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2fe1621d570f00e13b60fd4430932d7c3c2096c0e8e5965b969fbadaf17c6c22","target":"graph","created_at":"2026-05-18T00:04: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 study the point location problem in incremental (possibly disconnected) planar subdivisions, that is, dynamic subdivisions allowing insertions of edges and vertices only. Specifically, we present an $O(n\\log n)$-space data structure for this problem that supports queries in $O(\\log^2 n)$ time and updates in $O(\\log n\\log\\log n)$ amortized time. This is the first result that achieves polylogarithmic query and update times simultaneously in incremental (possibly disconnected) planar subdivisions. Its update time is significantly faster than the update time of the best known data structure for","authors_text":"Eunjin Oh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T12:47:28Z","title":"Point Location in Incremental Planar Subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10495","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:4f37a9fcffae6ca87b0d0c3b48fa2ede4cfe8017b8ef3ec4d007bcf6e7e4ca65","target":"record","created_at":"2026-05-18T00:04: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":"0af58ff4617c53cf4854548f1fec17ab780e59ae47918eb795ca0e3543749796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T12:47:28Z","title_canon_sha256":"282a79d6635f2312cda02f185247eeb83d4d8ff115f42f91836d3d030da792db"},"schema_version":"1.0","source":{"id":"1809.10495","kind":"arxiv","version":1}},"canonical_sha256":"6fb9a0264e37b872cef9ec595b62f1f2937a73dcad84773a942af02cfca5eecf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fb9a0264e37b872cef9ec595b62f1f2937a73dcad84773a942af02cfca5eecf","first_computed_at":"2026-05-18T00:04:38.243045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:38.243045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dxGbOSGyc+B9CB1YnedEh5GlLBLPx11zupYENZJg2VYvWgGjteeRH3OUg5hFjXq5nfGxURVQyCcrA3TD4rpECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:38.243493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f37a9fcffae6ca87b0d0c3b48fa2ede4cfe8017b8ef3ec4d007bcf6e7e4ca65","sha256:2fe1621d570f00e13b60fd4430932d7c3c2096c0e8e5965b969fbadaf17c6c22"],"state_sha256":"13b511ae66a70492e8858635f8d438d3f67c78edec5b319e26af9e3941b67b14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxs93F7Mb5KujxMf9PjQM/6vijJfEZHjV/ie6jbR9K0I8dewb6OSUbW1JDxINdbaDW+RozjpO/mNz44LXFwnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:16:58.367691Z","bundle_sha256":"24b1a5fcc0f125b5236eb6ca88ceec2acdab5eed612ae9b2df28ead17f56499d"}}