{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NGMF6MIVVC7RWYUSKUOXEECSW2","short_pith_number":"pith:NGMF6MIV","canonical_record":{"source":{"id":"1602.00767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-02T02:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"865c23cf5325900040b2d60b68fa15e1cbac7f4fc4bfa8e896cf135f85f21979","abstract_canon_sha256":"4e169feee084f2d860939fba65e36ca079ccbce655bced87fb7b3a0ee9719de9"},"schema_version":"1.0"},"canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","source":{"kind":"arxiv","id":"1602.00767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00767","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00767v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00767","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"NGMF6MIVVC7R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NGMF6MIVVC7RWYUS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NGMF6MIV","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NGMF6MIVVC7RWYUSKUOXEECSW2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-02T02:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"865c23cf5325900040b2d60b68fa15e1cbac7f4fc4bfa8e896cf135f85f21979","abstract_canon_sha256":"4e169feee084f2d860939fba65e36ca079ccbce655bced87fb7b3a0ee9719de9"},"schema_version":"1.0"},"canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:54.494373Z","signature_b64":"Tz9o2MTzs5W78J2UOz8JtFu6h9stMQ4IOyhwjj57+SSW2oY2clvGF7wDjLYzT3L+WrZs58vagMSFgrs/zRBSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","last_reissued_at":"2026-05-18T01:16:54.493704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:54.493704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00767","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2zQcP1NQh4qrPzb+ucYHQX5tRhM+32TmbHv3AcciQiEN3ZjPxtwhI9CvwOsJXjQiq4jNbbofJ5lZCaoEEYtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:58:53.374094Z"},"content_sha256":"ffa737b245b1052a7c59bf371a2f17f430fe4f3057a4243c7a8f8b130be13318","schema_version":"1.0","event_id":"sha256:ffa737b245b1052a7c59bf371a2f17f430fe4f3057a4243c7a8f8b130be13318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NGMF6MIVVC7RWYUSKUOXEECSW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-Sensitive Planar Point Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Bettina Speckmann, Boris Aronov, David Eppstein, Marcel Roeloffzen, Mark de Berg","submitted_at":"2016-02-02T02:23:55Z","abstract_excerpt":"Let $\\mathcal{S}$ be a connected planar polygonal subdivision with $n$ edges that we want to preprocess for point-location queries, and where we are given the probability $\\gamma_i$ that the query point lies in a polygon $P_i$ of $\\mathcal{S}$. We show how to preprocess $\\mathcal{S}$ such that the query time for a point~$p\\in P_i$ depends on~$\\gamma_i$ and, in addition, on the distance from $p$ to the boundary of~$P_i$---the further away from the boundary, the faster the query. More precisely, we show that a point-location query can be answered in time $O\\left(\\min \\left(\\log n, 1 + \\log \\frac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00767","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-18T01:16:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1C6eiK6L8N51vVJwc0VH39Oi8CzptFGszC7zRP6kyjV/b2jlllhGnKrZqAeIIXf5pvv8/54w9SDwPljOxVwDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:58:53.374462Z"},"content_sha256":"52440d73c5b91915c23af9dc9160ad0bed14e5a5fe32e53bea8564983f2e24fc","schema_version":"1.0","event_id":"sha256:52440d73c5b91915c23af9dc9160ad0bed14e5a5fe32e53bea8564983f2e24fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/bundle.json","state_url":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/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-02T01:58:53Z","links":{"resolver":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2","bundle":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/bundle.json","state":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NGMF6MIVVC7RWYUSKUOXEECSW2","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":"4e169feee084f2d860939fba65e36ca079ccbce655bced87fb7b3a0ee9719de9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-02T02:23:55Z","title_canon_sha256":"865c23cf5325900040b2d60b68fa15e1cbac7f4fc4bfa8e896cf135f85f21979"},"schema_version":"1.0","source":{"id":"1602.00767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00767","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00767v1","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00767","created_at":"2026-05-18T01:16:54Z"},{"alias_kind":"pith_short_12","alias_value":"NGMF6MIVVC7R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NGMF6MIVVC7RWYUS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NGMF6MIV","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:52440d73c5b91915c23af9dc9160ad0bed14e5a5fe32e53bea8564983f2e24fc","target":"graph","created_at":"2026-05-18T01:16:54Z","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":"Let $\\mathcal{S}$ be a connected planar polygonal subdivision with $n$ edges that we want to preprocess for point-location queries, and where we are given the probability $\\gamma_i$ that the query point lies in a polygon $P_i$ of $\\mathcal{S}$. We show how to preprocess $\\mathcal{S}$ such that the query time for a point~$p\\in P_i$ depends on~$\\gamma_i$ and, in addition, on the distance from $p$ to the boundary of~$P_i$---the further away from the boundary, the faster the query. More precisely, we show that a point-location query can be answered in time $O\\left(\\min \\left(\\log n, 1 + \\log \\frac","authors_text":"Bettina Speckmann, Boris Aronov, David Eppstein, Marcel Roeloffzen, Mark de Berg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-02T02:23:55Z","title":"Distance-Sensitive Planar Point Location"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00767","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:ffa737b245b1052a7c59bf371a2f17f430fe4f3057a4243c7a8f8b130be13318","target":"record","created_at":"2026-05-18T01:16:54Z","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":"4e169feee084f2d860939fba65e36ca079ccbce655bced87fb7b3a0ee9719de9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-02-02T02:23:55Z","title_canon_sha256":"865c23cf5325900040b2d60b68fa15e1cbac7f4fc4bfa8e896cf135f85f21979"},"schema_version":"1.0","source":{"id":"1602.00767","kind":"arxiv","version":1}},"canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","first_computed_at":"2026-05-18T01:16:54.493704Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:54.493704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tz9o2MTzs5W78J2UOz8JtFu6h9stMQ4IOyhwjj57+SSW2oY2clvGF7wDjLYzT3L+WrZs58vagMSFgrs/zRBSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:54.494373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffa737b245b1052a7c59bf371a2f17f430fe4f3057a4243c7a8f8b130be13318","sha256:52440d73c5b91915c23af9dc9160ad0bed14e5a5fe32e53bea8564983f2e24fc"],"state_sha256":"1fb4de77d097136dfcaff1fbdf729a36cf4297ffaf47c062a904702ebaeef723"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gioBmuVbSxrZsp0xlu+YlyIK4StMNJ6hGblokrqLD7CKtOi1Fn1LpzXyX/Go9ZnH0Ng5QqoI2P+0RFlaLjXGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:58:53.376375Z","bundle_sha256":"29251c59a6e63dc6170ddbfcef5fbf477528a5384c4a4dfe42af6acc902bcb5a"}}