{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:74FSDYJTTXZHXED5WQ4BUD5DCV","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":"2dce51cdc1229e8d48ef20a0de6f94037e10861e864063487e2904c4aef784cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-13T02:05:27Z","title_canon_sha256":"afaf0da9b7fb007108fd841a7de45f2f48e7377b67d2c8ab523fdcfda276f9db"},"schema_version":"1.0","source":{"id":"1808.04043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04043","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04043v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04043","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"74FSDYJTTXZH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"74FSDYJTTXZHXED5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"74FSDYJT","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:fe73eaefed759300043ccdfb266f242de51d6ec6abbc4a24fe138d8e5f869093","target":"graph","created_at":"2026-05-18T00:08:19Z","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 are interested in the problem of finding $k$ nearest neighbours in the plane and in the presence of polygonal obstacles ($\\textit{OkNN}$). Widely used algorithms for OkNN are based on incremental visibility graphs, which means they require costly and online visibility checking and have worst-case quadratic running time. Recently $\\mathbf{Polyanya}$, a fast point-to-point pathfinding algorithm was proposed which avoids the disadvantages of visibility graphs by searching over an alternative data structure known as a navigation mesh. Previously, we adapted $\\mathbf{Polyanya}$ to multi-target s","authors_text":"Daniel D. Harabor, David Taniar, Shizhe Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-13T02:05:27Z","title":"Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04043","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:6c8d2bfbad7a26314c5bd816d4722fcf6ef95f37b45e35bf948e39075ed1e927","target":"record","created_at":"2026-05-18T00:08:19Z","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":"2dce51cdc1229e8d48ef20a0de6f94037e10861e864063487e2904c4aef784cb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-13T02:05:27Z","title_canon_sha256":"afaf0da9b7fb007108fd841a7de45f2f48e7377b67d2c8ab523fdcfda276f9db"},"schema_version":"1.0","source":{"id":"1808.04043","kind":"arxiv","version":1}},"canonical_sha256":"ff0b21e1339df27b907db4381a0fa3157fe3da7711568fff6212f4562293b377","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff0b21e1339df27b907db4381a0fa3157fe3da7711568fff6212f4562293b377","first_computed_at":"2026-05-18T00:08:19.000744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.000744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yoowxKP9I8T8qkNwuG8r6IqKmrTlWs5cm5jgeGHGpZJ+hgvNTx93IbCGHBHfnDuNX58SKrmHLgDiFOFEj1z8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.001391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c8d2bfbad7a26314c5bd816d4722fcf6ef95f37b45e35bf948e39075ed1e927","sha256:fe73eaefed759300043ccdfb266f242de51d6ec6abbc4a24fe138d8e5f869093"],"state_sha256":"8cd6e184a23582459e7729488a3006410c70bece6a56d9887471f2d03e43a1a6"}