{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:57DRKZ7TY3Y5XD4M5NWMKU5UDA","short_pith_number":"pith:57DRKZ7T","schema_version":"1.0","canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","source":{"kind":"arxiv","id":"1803.05765","version":1},"attestation_state":"computed","paper":{"title":"Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Lars Arge, Pankaj K. Agarwal","submitted_at":"2018-03-15T14:15:06Z","abstract_excerpt":"We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set $S$ of point sites in a static simple polygon $P$. Our data structure allows us to insert a new site in $S$, delete a site from $S$, and ask for the site in $S$ closest to an arbitrary query point $q \\in P$. All distances are measured using the geodesic distance, that is, the length of the shortest path that is completely contained in $P$. Our data structure achieves polylogarithmic update and query times, and uses $O(n\\log^3n\\log m + m)$ space, where $n$ is the number of sites in $S$ and $"},"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.05765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T14:15:06Z","cross_cats_sorted":[],"title_canon_sha256":"035ac6d3c22afbfcd8ba9876f9a4599a36d2b09910426e912264a29fffec76c2","abstract_canon_sha256":"15afaf734bca7f4a431aa33102659d5f5b15774ed976fb2ce11d34ade474267b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.361043Z","signature_b64":"5YfkzyidKrH4SIa7U2ZafR+85KZbkPt1iSBM35ro4vrjeoKHfMrNUcx2kvT1P0eubvqxDO6Y6VMNVjbBaSggAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","last_reissued_at":"2026-05-18T00:20:54.360489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.360489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Staals, Lars Arge, Pankaj K. Agarwal","submitted_at":"2018-03-15T14:15:06Z","abstract_excerpt":"We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set $S$ of point sites in a static simple polygon $P$. Our data structure allows us to insert a new site in $S$, delete a site from $S$, and ask for the site in $S$ closest to an arbitrary query point $q \\in P$. All distances are measured using the geodesic distance, that is, the length of the shortest path that is completely contained in $P$. Our data structure achieves polylogarithmic update and query times, and uses $O(n\\log^3n\\log m + m)$ space, where $n$ is the number of sites in $S$ and $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05765","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.05765","created_at":"2026-05-18T00:20:54.360571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05765v1","created_at":"2026-05-18T00:20:54.360571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05765","created_at":"2026-05-18T00:20:54.360571+00:00"},{"alias_kind":"pith_short_12","alias_value":"57DRKZ7TY3Y5","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"57DRKZ7TY3Y5XD4M","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"57DRKZ7T","created_at":"2026-05-18T12:32:08.215937+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/57DRKZ7TY3Y5XD4M5NWMKU5UDA","json":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA.json","graph_json":"https://pith.science/api/pith-number/57DRKZ7TY3Y5XD4M5NWMKU5UDA/graph.json","events_json":"https://pith.science/api/pith-number/57DRKZ7TY3Y5XD4M5NWMKU5UDA/events.json","paper":"https://pith.science/paper/57DRKZ7T"},"agent_actions":{"view_html":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA","download_json":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA.json","view_paper":"https://pith.science/paper/57DRKZ7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05765&json=true","fetch_graph":"https://pith.science/api/pith-number/57DRKZ7TY3Y5XD4M5NWMKU5UDA/graph.json","fetch_events":"https://pith.science/api/pith-number/57DRKZ7TY3Y5XD4M5NWMKU5UDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/action/storage_attestation","attest_author":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/action/author_attestation","sign_citation":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/action/citation_signature","submit_replication":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/action/replication_record"}},"created_at":"2026-05-18T00:20:54.360571+00:00","updated_at":"2026-05-18T00:20:54.360571+00:00"}