{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TAYV3IEBO2NODKGJD6FIH6N7HE","short_pith_number":"pith:TAYV3IEB","schema_version":"1.0","canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","source":{"kind":"arxiv","id":"1903.06601","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Planar Point Location in External Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Yakov Nekrich","submitted_at":"2019-03-15T15:31:47Z","abstract_excerpt":"In this paper we describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in $O(\\log_B n(\\log\\log_B n)^3))$ I/Os and updates in $O(\\log_B n(\\log\\log_B n)^2))$ amortized I/Os, where $n$ is the number of segments in the subdivision and $B$ is the block size. This is the first dynamic data structure with almost-optimal query cost. For comparison all previously known results for this problem require $O(\\log_B^2 n)$ I/Os to answer queries. Our result almost matches the best known upper bound in the internal-memor"},"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":"1903.06601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-15T15:31:47Z","cross_cats_sorted":[],"title_canon_sha256":"22f814c71cdbcddd58cb5a6294cbdf2924d59ab190d1f6e54307225a6b01de87","abstract_canon_sha256":"83a8a6ec4a1880b3352a041aab8707ce409ec02878887f32515353ac267ef38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:10.387023Z","signature_b64":"Y4HIJtQkx5KpE5xRAwMzc3oQGrNsKLkTWf4WIJ4d1kE7/Py8hfQfq9xMhNReTeHrmFRIQUeak4KFtuOgHRjQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","last_reissued_at":"2026-05-17T23:51:10.386520Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:10.386520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Planar Point Location in External Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Yakov Nekrich","submitted_at":"2019-03-15T15:31:47Z","abstract_excerpt":"In this paper we describe a fully-dynamic data structure for the planar point location problem in the external memory model. Our data structure supports queries in $O(\\log_B n(\\log\\log_B n)^3))$ I/Os and updates in $O(\\log_B n(\\log\\log_B n)^2))$ amortized I/Os, where $n$ is the number of segments in the subdivision and $B$ is the block size. This is the first dynamic data structure with almost-optimal query cost. For comparison all previously known results for this problem require $O(\\log_B^2 n)$ I/Os to answer queries. Our result almost matches the best known upper bound in the internal-memor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06601","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":"1903.06601","created_at":"2026-05-17T23:51:10.386599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06601v1","created_at":"2026-05-17T23:51:10.386599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06601","created_at":"2026-05-17T23:51:10.386599+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAYV3IEBO2NO","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAYV3IEBO2NODKGJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAYV3IEB","created_at":"2026-05-18T12:33:27.125529+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/TAYV3IEBO2NODKGJD6FIH6N7HE","json":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE.json","graph_json":"https://pith.science/api/pith-number/TAYV3IEBO2NODKGJD6FIH6N7HE/graph.json","events_json":"https://pith.science/api/pith-number/TAYV3IEBO2NODKGJD6FIH6N7HE/events.json","paper":"https://pith.science/paper/TAYV3IEB"},"agent_actions":{"view_html":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE","download_json":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE.json","view_paper":"https://pith.science/paper/TAYV3IEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06601&json=true","fetch_graph":"https://pith.science/api/pith-number/TAYV3IEBO2NODKGJD6FIH6N7HE/graph.json","fetch_events":"https://pith.science/api/pith-number/TAYV3IEBO2NODKGJD6FIH6N7HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/action/storage_attestation","attest_author":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/action/author_attestation","sign_citation":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/action/citation_signature","submit_replication":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/action/replication_record"}},"created_at":"2026-05-17T23:51:10.386599+00:00","updated_at":"2026-05-17T23:51:10.386599+00:00"}