{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:L4HTF6CGHEPKGFZRLW7PTZMSBA","short_pith_number":"pith:L4HTF6CG","canonical_record":{"source":{"id":"1803.04325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-12T15:54:09Z","cross_cats_sorted":[],"title_canon_sha256":"25920fa8e9a554bec7fd96de752dbdf1636606fa918a5600b90ea75b0a07ed1f","abstract_canon_sha256":"ec6c99f6c3b317c352f11558730ca969531b9c9f5f4e8557d89a9fada1ff8e3e"},"schema_version":"1.0"},"canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","source":{"kind":"arxiv","id":"1803.04325","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04325","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04325v1","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04325","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"L4HTF6CGHEPK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L4HTF6CGHEPKGFZR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L4HTF6CG","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:L4HTF6CGHEPKGFZRLW7PTZMSBA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04325","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-12T15:54:09Z","cross_cats_sorted":[],"title_canon_sha256":"25920fa8e9a554bec7fd96de752dbdf1636606fa918a5600b90ea75b0a07ed1f","abstract_canon_sha256":"ec6c99f6c3b317c352f11558730ca969531b9c9f5f4e8557d89a9fada1ff8e3e"},"schema_version":"1.0"},"canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:29.983994Z","signature_b64":"Jfq5nN/c4tYVr6fpj56qaMqWUT/Bg+2VUWBFmdcjPmaEGFknr6/ntNRtVoEesYVrCyZ3pxRjpYVGux97LkGWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","last_reissued_at":"2026-05-18T00:21:29.983424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:29.983424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04325","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:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6U/oiBrxSZKvgWZz++CinxUSCK8HpX9Cdb9X14u4jiF0/wNyMQ8t/MxBinmh3dyaAKrZdKamZnz80bQp7hvvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:38:34.443149Z"},"content_sha256":"aed79c6aeb32d3349e04df0f251a702823efec1b2095154fe45f15c96fd824cc","schema_version":"1.0","event_id":"sha256:aed79c6aeb32d3349e04df0f251a702823efec1b2095154fe45f15c96fd824cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:L4HTF6CGHEPKGFZRLW7PTZMSBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point Location in Dynamic Planar Subdivisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-03-12T15:54:09Z","abstract_excerpt":"We study the point location problem on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is $O(\\sqrt{n}\\log n(\\log\\log n)^{3/2})$ and the query time is $O(\\log n(\\log\\log n)^2)$, where $n$ is the number of edges in the subdivision. This answers a question posed by Snoeyink in the Handbook of Computationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04325","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:21:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYvtAN4oiIQz/YyaHECF+MWMUMbhPT0ALjksf2UtqRpZ9IX1m9e7ns/EqDNXQ49nKRMzATgMkVN5MbCdi6UMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:38:34.443763Z"},"content_sha256":"7857134388b3f95775c3cfe48321273141ca7c0cbe5802ae064d00fd9e973a6e","schema_version":"1.0","event_id":"sha256:7857134388b3f95775c3cfe48321273141ca7c0cbe5802ae064d00fd9e973a6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/bundle.json","state_url":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/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-07T12:38:34Z","links":{"resolver":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA","bundle":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/bundle.json","state":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L4HTF6CGHEPKGFZRLW7PTZMSBA","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":"ec6c99f6c3b317c352f11558730ca969531b9c9f5f4e8557d89a9fada1ff8e3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-12T15:54:09Z","title_canon_sha256":"25920fa8e9a554bec7fd96de752dbdf1636606fa918a5600b90ea75b0a07ed1f"},"schema_version":"1.0","source":{"id":"1803.04325","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04325","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04325v1","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04325","created_at":"2026-05-18T00:21:29Z"},{"alias_kind":"pith_short_12","alias_value":"L4HTF6CGHEPK","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L4HTF6CGHEPKGFZR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L4HTF6CG","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:7857134388b3f95775c3cfe48321273141ca7c0cbe5802ae064d00fd9e973a6e","target":"graph","created_at":"2026-05-18T00:21:29Z","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 on dynamic planar subdivisions that allows insertions and deletions of edges. In our problem, the underlying graph of a subdivision is not necessarily connected. We present a data structure of linear size for such a dynamic planar subdivision that supports sublinear-time update and polylogarithmic-time query. Precisely, the amortized update time is $O(\\sqrt{n}\\log n(\\log\\log n)^{3/2})$ and the query time is $O(\\log n(\\log\\log n)^2)$, where $n$ is the number of edges in the subdivision. This answers a question posed by Snoeyink in the Handbook of Computationa","authors_text":"Eunjin Oh, Hee-Kap Ahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-12T15:54:09Z","title":"Point Location in Dynamic Planar Subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04325","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:aed79c6aeb32d3349e04df0f251a702823efec1b2095154fe45f15c96fd824cc","target":"record","created_at":"2026-05-18T00:21:29Z","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":"ec6c99f6c3b317c352f11558730ca969531b9c9f5f4e8557d89a9fada1ff8e3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-12T15:54:09Z","title_canon_sha256":"25920fa8e9a554bec7fd96de752dbdf1636606fa918a5600b90ea75b0a07ed1f"},"schema_version":"1.0","source":{"id":"1803.04325","kind":"arxiv","version":1}},"canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","first_computed_at":"2026-05-18T00:21:29.983424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:29.983424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jfq5nN/c4tYVr6fpj56qaMqWUT/Bg+2VUWBFmdcjPmaEGFknr6/ntNRtVoEesYVrCyZ3pxRjpYVGux97LkGWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:29.983994Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04325","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aed79c6aeb32d3349e04df0f251a702823efec1b2095154fe45f15c96fd824cc","sha256:7857134388b3f95775c3cfe48321273141ca7c0cbe5802ae064d00fd9e973a6e"],"state_sha256":"0e53f7706e474f9f660488262a2565f84317534cfa05392fd77adb4b500aacb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xS+9yDkMWMo9e8GLeVhhLI09qe+00g56c4GbK39lBGhSmjrEahgfv17f/T6qB6H6v5eVQkaEbmsIdmeYG4rjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:38:34.447436Z","bundle_sha256":"a762a23c1c67018a1e0ff8690042407e47eaabf66e0aec3fe24b56b092de0dc6"}}