{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:74FSDYJTTXZHXED5WQ4BUD5DCV","short_pith_number":"pith:74FSDYJT","schema_version":"1.0","canonical_sha256":"ff0b21e1339df27b907db4381a0fa3157fe3da7711568fff6212f4562293b377","source":{"kind":"arxiv","id":"1808.04043","version":1},"attestation_state":"computed","paper":{"title":"Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daniel D. Harabor, David Taniar, Shizhe Zhao","submitted_at":"2018-08-13T02:05:27Z","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"},"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":"1808.04043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-13T02:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"afaf0da9b7fb007108fd841a7de45f2f48e7377b67d2c8ab523fdcfda276f9db","abstract_canon_sha256":"2dce51cdc1229e8d48ef20a0de6f94037e10861e864063487e2904c4aef784cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.001391Z","signature_b64":"yoowxKP9I8T8qkNwuG8r6IqKmrTlWs5cm5jgeGHGpZJ+hgvNTx93IbCGHBHfnDuNX58SKrmHLgDiFOFEj1z8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff0b21e1339df27b907db4381a0fa3157fe3da7711568fff6212f4562293b377","last_reissued_at":"2026-05-18T00:08:19.000744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.000744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daniel D. Harabor, David Taniar, Shizhe Zhao","submitted_at":"2018-08-13T02:05:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04043","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":"1808.04043","created_at":"2026-05-18T00:08:19.000874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04043v1","created_at":"2026-05-18T00:08:19.000874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04043","created_at":"2026-05-18T00:08:19.000874+00:00"},{"alias_kind":"pith_short_12","alias_value":"74FSDYJTTXZH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"74FSDYJTTXZHXED5","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"74FSDYJT","created_at":"2026-05-18T12:32:11.075285+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/74FSDYJTTXZHXED5WQ4BUD5DCV","json":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV.json","graph_json":"https://pith.science/api/pith-number/74FSDYJTTXZHXED5WQ4BUD5DCV/graph.json","events_json":"https://pith.science/api/pith-number/74FSDYJTTXZHXED5WQ4BUD5DCV/events.json","paper":"https://pith.science/paper/74FSDYJT"},"agent_actions":{"view_html":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV","download_json":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV.json","view_paper":"https://pith.science/paper/74FSDYJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04043&json=true","fetch_graph":"https://pith.science/api/pith-number/74FSDYJTTXZHXED5WQ4BUD5DCV/graph.json","fetch_events":"https://pith.science/api/pith-number/74FSDYJTTXZHXED5WQ4BUD5DCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV/action/storage_attestation","attest_author":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV/action/author_attestation","sign_citation":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV/action/citation_signature","submit_replication":"https://pith.science/pith/74FSDYJTTXZHXED5WQ4BUD5DCV/action/replication_record"}},"created_at":"2026-05-18T00:08:19.000874+00:00","updated_at":"2026-05-18T00:08:19.000874+00:00"}