{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7WTF3F63MDV2JPXXUOV4DYW72A","short_pith_number":"pith:7WTF3F63","canonical_record":{"source":{"id":"1902.05638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-14T22:51:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e8d030b8755ec35b9bbd3d23bbca2fd6caa78b58af223a1b556c80e35b846c0e","abstract_canon_sha256":"91f4813c85e606d3f4f465b69008a95bd348865114f32c431cc83f6c389f9fa1"},"schema_version":"1.0"},"canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","source":{"kind":"arxiv","id":"1902.05638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05638","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05638v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05638","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"7WTF3F63MDV2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7WTF3F63MDV2JPXX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7WTF3F63","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7WTF3F63MDV2JPXXUOV4DYW72A","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-14T22:51:48Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e8d030b8755ec35b9bbd3d23bbca2fd6caa78b58af223a1b556c80e35b846c0e","abstract_canon_sha256":"91f4813c85e606d3f4f465b69008a95bd348865114f32c431cc83f6c389f9fa1"},"schema_version":"1.0"},"canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.695888Z","signature_b64":"fUscOxDre8OePTbICk0EB6HlgftK7XmymWDnWtMAVCr9XWM1o7n1Y30sUygQWDN5N0H5ZzLYOoCKXcCZ/ivYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","last_reissued_at":"2026-05-17T23:53:56.695286Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.695286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05638","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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tK4kLtQKhCc4peBIOQt7H1QMhYbl8Yq2dw7uBS4e1btRBOi5j9YeHG3HyL8I3lkYwMUJ5RL134z5TdytcSdvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:47:24.588506Z"},"content_sha256":"0502d987c936a6a8bed0099fbcb3fe1cdc562cfea616c71fb6a80c140761c3ff","schema_version":"1.0","event_id":"sha256:0502d987c936a6a8bed0099fbcb3fe1cdc562cfea616c71fb6a80c140761c3ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7WTF3F63MDV2JPXXUOV4DYW72A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Nearest Neighbors in graphs locally","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Abhinav Mishra","submitted_at":"2019-02-14T22:51:48Z","abstract_excerpt":"Many distributed learning techniques have been motivated by the increasing size of datasets and their inability to fit into main memory on a single machine. We propose an algorithm that finds the nearest neighbor in a graph locally without the need of visiting the whole graph. Our algorithm is distributed which further encourage scalability. We prove the convergence of the algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05638","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-17T23:53:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvqnfsjRivW8vfjeshyumB+drHGH0qhz8PehEpfMDfMjCGOEEldUgod8cBHlGE6y7c/afcfT/ZvIwgmdmEFCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:47:24.588845Z"},"content_sha256":"568301acfa23c07fabf57f6633fde5c5c6d2b8e268e8b907c921ca1b247b889b","schema_version":"1.0","event_id":"sha256:568301acfa23c07fabf57f6633fde5c5c6d2b8e268e8b907c921ca1b247b889b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/bundle.json","state_url":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WTF3F63MDV2JPXXUOV4DYW72A/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-29T22:47:24Z","links":{"resolver":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A","bundle":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/bundle.json","state":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WTF3F63MDV2JPXXUOV4DYW72A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7WTF3F63MDV2JPXXUOV4DYW72A","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":"91f4813c85e606d3f4f465b69008a95bd348865114f32c431cc83f6c389f9fa1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-14T22:51:48Z","title_canon_sha256":"e8d030b8755ec35b9bbd3d23bbca2fd6caa78b58af223a1b556c80e35b846c0e"},"schema_version":"1.0","source":{"id":"1902.05638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05638","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05638v1","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05638","created_at":"2026-05-17T23:53:56Z"},{"alias_kind":"pith_short_12","alias_value":"7WTF3F63MDV2","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7WTF3F63MDV2JPXX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7WTF3F63","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:568301acfa23c07fabf57f6633fde5c5c6d2b8e268e8b907c921ca1b247b889b","target":"graph","created_at":"2026-05-17T23:53:56Z","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":"Many distributed learning techniques have been motivated by the increasing size of datasets and their inability to fit into main memory on a single machine. We propose an algorithm that finds the nearest neighbor in a graph locally without the need of visiting the whole graph. Our algorithm is distributed which further encourage scalability. We prove the convergence of the algorithm","authors_text":"Abhinav Mishra","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-14T22:51:48Z","title":"Finding Nearest Neighbors in graphs locally"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05638","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:0502d987c936a6a8bed0099fbcb3fe1cdc562cfea616c71fb6a80c140761c3ff","target":"record","created_at":"2026-05-17T23:53:56Z","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":"91f4813c85e606d3f4f465b69008a95bd348865114f32c431cc83f6c389f9fa1","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-14T22:51:48Z","title_canon_sha256":"e8d030b8755ec35b9bbd3d23bbca2fd6caa78b58af223a1b556c80e35b846c0e"},"schema_version":"1.0","source":{"id":"1902.05638","kind":"arxiv","version":1}},"canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","first_computed_at":"2026-05-17T23:53:56.695286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:56.695286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fUscOxDre8OePTbICk0EB6HlgftK7XmymWDnWtMAVCr9XWM1o7n1Y30sUygQWDN5N0H5ZzLYOoCKXcCZ/ivYAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:56.695888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0502d987c936a6a8bed0099fbcb3fe1cdc562cfea616c71fb6a80c140761c3ff","sha256:568301acfa23c07fabf57f6633fde5c5c6d2b8e268e8b907c921ca1b247b889b"],"state_sha256":"0c834a879d9bb84f849334136688dc34c99782aff52f6de34b8e777aec9a5073"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OPdai2GCeIiP8nlQnOhZoag9ZlIbQzrXb6Dt5uqV9jcgT9OJsWU4kTIlblD7dfrz+aYxwSfgJI3jzFIcq7fkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:47:24.590713Z","bundle_sha256":"6671ad2459cb8a87e5d39c359899279ebc9814f5e35e862a1e34fb0c7c91c1c9"}}