{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:L4HTF6CGHEPKGFZRLW7PTZMSBA","short_pith_number":"pith:L4HTF6CG","schema_version":"1.0","canonical_sha256":"5f0f32f846391ea317315dbef9e5920828450ed4c5bcf87d2e036f0efe013807","source":{"kind":"arxiv","id":"1803.04325","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.04325","created_at":"2026-05-18T00:21:29.983544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04325v1","created_at":"2026-05-18T00:21:29.983544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04325","created_at":"2026-05-18T00:21:29.983544+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4HTF6CGHEPK","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4HTF6CGHEPKGFZR","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4HTF6CG","created_at":"2026-05-18T12:32:33.847187+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/L4HTF6CGHEPKGFZRLW7PTZMSBA","json":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA.json","graph_json":"https://pith.science/api/pith-number/L4HTF6CGHEPKGFZRLW7PTZMSBA/graph.json","events_json":"https://pith.science/api/pith-number/L4HTF6CGHEPKGFZRLW7PTZMSBA/events.json","paper":"https://pith.science/paper/L4HTF6CG"},"agent_actions":{"view_html":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA","download_json":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA.json","view_paper":"https://pith.science/paper/L4HTF6CG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04325&json=true","fetch_graph":"https://pith.science/api/pith-number/L4HTF6CGHEPKGFZRLW7PTZMSBA/graph.json","fetch_events":"https://pith.science/api/pith-number/L4HTF6CGHEPKGFZRLW7PTZMSBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/action/storage_attestation","attest_author":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/action/author_attestation","sign_citation":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/action/citation_signature","submit_replication":"https://pith.science/pith/L4HTF6CGHEPKGFZRLW7PTZMSBA/action/replication_record"}},"created_at":"2026-05-18T00:21:29.983544+00:00","updated_at":"2026-05-18T00:21:29.983544+00:00"}