{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TAYV3IEBO2NODKGJD6FIH6N7HE","short_pith_number":"pith:TAYV3IEB","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"},"canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","source":{"kind":"arxiv","id":"1903.06601","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06601","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06601v1","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06601","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"TAYV3IEBO2NO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAYV3IEBO2NODKGJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAYV3IEB","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TAYV3IEBO2NODKGJD6FIH6N7HE","target":"record","payload":{"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"},"canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","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"},"source_kind":"arxiv","source_id":"1903.06601","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-17T23:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGWytl/ZVstdldiN0Bleoo60JyBSKLbAfAzsqFFP1g23bGG2H3Q2qeueN4OTslkDxrMhDUlWS9cW+dEj8F6/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:34:36.870746Z"},"content_sha256":"2e1fe42090b3cdd1abab4d411a364d2400e7a742c2ef3e2076b09cee0ce85468","schema_version":"1.0","event_id":"sha256:2e1fe42090b3cdd1abab4d411a364d2400e7a742c2ef3e2076b09cee0ce85468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TAYV3IEBO2NODKGJD6FIH6N7HE","target":"graph","payload":{"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"},"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-17T23:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5km/rkM6X5Beajvg6PT0/nDCn1MKeTm88djUM0VHaZF++2DIBmXDFMKBGNhdQWNX6KoOcqBpLqy/KfmydCTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:34:36.871436Z"},"content_sha256":"aa1bbddf8bd4c2ef2d2be2013e90406a41236289ca18903b33e363efa9cd9a79","schema_version":"1.0","event_id":"sha256:aa1bbddf8bd4c2ef2d2be2013e90406a41236289ca18903b33e363efa9cd9a79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/bundle.json","state_url":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/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-27T17:34:36Z","links":{"resolver":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE","bundle":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/bundle.json","state":"https://pith.science/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAYV3IEBO2NODKGJD6FIH6N7HE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TAYV3IEBO2NODKGJD6FIH6N7HE","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":"83a8a6ec4a1880b3352a041aab8707ce409ec02878887f32515353ac267ef38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-15T15:31:47Z","title_canon_sha256":"22f814c71cdbcddd58cb5a6294cbdf2924d59ab190d1f6e54307225a6b01de87"},"schema_version":"1.0","source":{"id":"1903.06601","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.06601","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"1903.06601v1","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06601","created_at":"2026-05-17T23:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"TAYV3IEBO2NO","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAYV3IEBO2NODKGJ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAYV3IEB","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:aa1bbddf8bd4c2ef2d2be2013e90406a41236289ca18903b33e363efa9cd9a79","target":"graph","created_at":"2026-05-17T23:51:10Z","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":"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","authors_text":"J. Ian Munro, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-15T15:31:47Z","title":"Dynamic Planar Point Location in External Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06601","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:2e1fe42090b3cdd1abab4d411a364d2400e7a742c2ef3e2076b09cee0ce85468","target":"record","created_at":"2026-05-17T23:51:10Z","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":"83a8a6ec4a1880b3352a041aab8707ce409ec02878887f32515353ac267ef38d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-15T15:31:47Z","title_canon_sha256":"22f814c71cdbcddd58cb5a6294cbdf2924d59ab190d1f6e54307225a6b01de87"},"schema_version":"1.0","source":{"id":"1903.06601","kind":"arxiv","version":1}},"canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98315da081769ae1a8c91f8a83f9bf391939f3daddc30d8570d2499f57c3f191","first_computed_at":"2026-05-17T23:51:10.386520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:10.386520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y4HIJtQkx5KpE5xRAwMzc3oQGrNsKLkTWf4WIJ4d1kE7/Py8hfQfq9xMhNReTeHrmFRIQUeak4KFtuOgHRjQCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:10.387023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.06601","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e1fe42090b3cdd1abab4d411a364d2400e7a742c2ef3e2076b09cee0ce85468","sha256:aa1bbddf8bd4c2ef2d2be2013e90406a41236289ca18903b33e363efa9cd9a79"],"state_sha256":"da935d0f62b4b3f59471d1910494f8bdae98d51a21bf3578c35b8e6dc2140d92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"idJNqsb/CmgfxCPJ9aTxonFA5OxYkMQqoRPfNyuDotuGj3UkZJBct26s0a0WIzAL4keC49OnQs4o/0U+hxNODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:34:36.875150Z","bundle_sha256":"c3f3b01e3f750db8d4405803c370f0e948c3fc9cf224b2fe0eb77d1bf07778d1"}}