{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:57DRKZ7TY3Y5XD4M5NWMKU5UDA","short_pith_number":"pith:57DRKZ7T","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"},"canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","source":{"kind":"arxiv","id":"1803.05765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05765","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05765v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05765","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"57DRKZ7TY3Y5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57DRKZ7TY3Y5XD4M","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57DRKZ7T","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:57DRKZ7TY3Y5XD4M5NWMKU5UDA","target":"record","payload":{"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"},"canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","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"},"source_kind":"arxiv","source_id":"1803.05765","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-18T00:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jgUGKy40nH1AavciTUOBPk122lyKBSKHVFlR5LMpq4G/SsXIurRBmjCHTh1f9DUmL8Qi5InQ/T3dk25uceLVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:37.068716Z"},"content_sha256":"bee15944cd7706e7d5aa18e7c169cd159a5f6ce72a86f9a7b785d51aeaaa9ad9","schema_version":"1.0","event_id":"sha256:bee15944cd7706e7d5aa18e7c169cd159a5f6ce72a86f9a7b785d51aeaaa9ad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:57DRKZ7TY3Y5XD4M5NWMKU5UDA","target":"graph","payload":{"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"},"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-18T00:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+S9ECRMNIs+GOxPpKvgLrwxahVTxbSzfEFhTegcKOZSlZ5sSrdcnTrkT0ntz5ChmTEutFaEfjyJ4yG/JLPODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:27:37.069173Z"},"content_sha256":"20906372dad6edcb2914cc7931526f3d2933b3ca878261a300bca99c1e9aad7d","schema_version":"1.0","event_id":"sha256:20906372dad6edcb2914cc7931526f3d2933b3ca878261a300bca99c1e9aad7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/bundle.json","state_url":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/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-04T20:27:37Z","links":{"resolver":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA","bundle":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/bundle.json","state":"https://pith.science/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57DRKZ7TY3Y5XD4M5NWMKU5UDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:57DRKZ7TY3Y5XD4M5NWMKU5UDA","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":"15afaf734bca7f4a431aa33102659d5f5b15774ed976fb2ce11d34ade474267b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T14:15:06Z","title_canon_sha256":"035ac6d3c22afbfcd8ba9876f9a4599a36d2b09910426e912264a29fffec76c2"},"schema_version":"1.0","source":{"id":"1803.05765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05765","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05765v1","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05765","created_at":"2026-05-18T00:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"57DRKZ7TY3Y5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57DRKZ7TY3Y5XD4M","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57DRKZ7T","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:20906372dad6edcb2914cc7931526f3d2933b3ca878261a300bca99c1e9aad7d","target":"graph","created_at":"2026-05-18T00:20: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":"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 $","authors_text":"Frank Staals, Lars Arge, Pankaj K. Agarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T14:15:06Z","title":"Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05765","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:bee15944cd7706e7d5aa18e7c169cd159a5f6ce72a86f9a7b785d51aeaaa9ad9","target":"record","created_at":"2026-05-18T00:20: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":"15afaf734bca7f4a431aa33102659d5f5b15774ed976fb2ce11d34ade474267b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-15T14:15:06Z","title_canon_sha256":"035ac6d3c22afbfcd8ba9876f9a4599a36d2b09910426e912264a29fffec76c2"},"schema_version":"1.0","source":{"id":"1803.05765","kind":"arxiv","version":1}},"canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efc71567f3c6f1db8f8ceb6cc553b4183c758a9d3f3d40eda9d4d320c496bc35","first_computed_at":"2026-05-18T00:20:54.360489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:54.360489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5YfkzyidKrH4SIa7U2ZafR+85KZbkPt1iSBM35ro4vrjeoKHfMrNUcx2kvT1P0eubvqxDO6Y6VMNVjbBaSggAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:54.361043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee15944cd7706e7d5aa18e7c169cd159a5f6ce72a86f9a7b785d51aeaaa9ad9","sha256:20906372dad6edcb2914cc7931526f3d2933b3ca878261a300bca99c1e9aad7d"],"state_sha256":"a0e1c2796d7f29a8c26cc51f809ff839f82b430e8fbe96495dce7bdd74c06cab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFtgl7bx8itOPdd2UwfydDuMsYhkWhvA1Xr7XCF75ip2sg/xZzIebbDuPREqv0D5gMx4kw2DyojCvmeZd72jCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:27:37.071939Z","bundle_sha256":"606fef9de2bbba25c1581583d19a64475b917207e743e8ba5d22b50af0a1837d"}}