{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C2LATIZ54LCUQ6IORECG4Q4KWD","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":"53de52b27dfee488f2fe800021e2221e810c46678cb81e4064b8bc1af15514bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T17:49:46Z","title_canon_sha256":"7e6782385d05f29852366240826c690684410572b02c6faa6ff47f85cdfb03e2"},"schema_version":"1.0","source":{"id":"1607.07818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07818","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07818v1","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07818","created_at":"2026-05-18T01:10:25Z"},{"alias_kind":"pith_short_12","alias_value":"C2LATIZ54LCU","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2LATIZ54LCUQ6IO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2LATIZ5","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:236867a1ec63b3e938461ec9862f1970247b776420466f4e6de6c592ebd6f564","target":"graph","created_at":"2026-05-18T01:10:25Z","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 given a directed graph $G = (V,E)$ with $n$ vertices and $m$ edges, with positive weights on the edges, and a parameter $k >0$. We show how to compute, for every vertex $v \\in V$, its $k$ nearest-neighbors. The algorithm runs in $O( k ( n \\log n + m ) )$ time, and follows by a somewhat careful modification of Dijkstra's shortest path algorithm.\n  This result is probably folklore, but we were unable to find a reference to it -- thus, this note.","authors_text":"Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T17:49:46Z","title":"Computing the k Nearest-Neighbors for all Vertices via Dijkstra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07818","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:e8aad9594a75556e8f7879118450df0e9a430eaacac1aab362d8381163ac4505","target":"record","created_at":"2026-05-18T01:10:25Z","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":"53de52b27dfee488f2fe800021e2221e810c46678cb81e4064b8bc1af15514bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-26T17:49:46Z","title_canon_sha256":"7e6782385d05f29852366240826c690684410572b02c6faa6ff47f85cdfb03e2"},"schema_version":"1.0","source":{"id":"1607.07818","kind":"arxiv","version":1}},"canonical_sha256":"169609a33de2c548790e89046e438ab0df5e15257c9807e5f1f49a1207a6ec55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"169609a33de2c548790e89046e438ab0df5e15257c9807e5f1f49a1207a6ec55","first_computed_at":"2026-05-18T01:10:25.093306Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:25.093306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XlHRaAfZHfSNZg4jjXmlRUY0eeD+zVrEke5e+KHtYuOgbxrPROluwpTEghF2zxsg64pFc461uCiStEKSZY1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:25.093810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8aad9594a75556e8f7879118450df0e9a430eaacac1aab362d8381163ac4505","sha256:236867a1ec63b3e938461ec9862f1970247b776420466f4e6de6c592ebd6f564"],"state_sha256":"0e84f3e37b7d50a77453782a24051ba2f0ad2156f84c48edba48aad98c3b40fc"}