{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NGMF6MIVVC7RWYUSKUOXEECSW2","short_pith_number":"pith:NGMF6MIV","schema_version":"1.0","canonical_sha256":"69985f3115a8bf1b6292551d721052b697177f176fe30f28eeef6e3519654af8","source":{"kind":"arxiv","id":"1602.00767","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.00767","created_at":"2026-05-18T01:16:54.493802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00767v1","created_at":"2026-05-18T01:16:54.493802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00767","created_at":"2026-05-18T01:16:54.493802+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGMF6MIVVC7R","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGMF6MIVVC7RWYUS","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGMF6MIV","created_at":"2026-05-18T12:30:32.724797+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/NGMF6MIVVC7RWYUSKUOXEECSW2","json":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2.json","graph_json":"https://pith.science/api/pith-number/NGMF6MIVVC7RWYUSKUOXEECSW2/graph.json","events_json":"https://pith.science/api/pith-number/NGMF6MIVVC7RWYUSKUOXEECSW2/events.json","paper":"https://pith.science/paper/NGMF6MIV"},"agent_actions":{"view_html":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2","download_json":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2.json","view_paper":"https://pith.science/paper/NGMF6MIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00767&json=true","fetch_graph":"https://pith.science/api/pith-number/NGMF6MIVVC7RWYUSKUOXEECSW2/graph.json","fetch_events":"https://pith.science/api/pith-number/NGMF6MIVVC7RWYUSKUOXEECSW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/action/storage_attestation","attest_author":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/action/author_attestation","sign_citation":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/action/citation_signature","submit_replication":"https://pith.science/pith/NGMF6MIVVC7RWYUSKUOXEECSW2/action/replication_record"}},"created_at":"2026-05-18T01:16:54.493802+00:00","updated_at":"2026-05-18T01:16:54.493802+00:00"}