{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7WTF3F63MDV2JPXXUOV4DYW72A","short_pith_number":"pith:7WTF3F63","schema_version":"1.0","canonical_sha256":"fda65d97db60eba4bef7a3abc1e2dfd037716d009a3c228d96440af37ccb9092","source":{"kind":"arxiv","id":"1902.05638","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.05638","created_at":"2026-05-17T23:53:56.695406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05638v1","created_at":"2026-05-17T23:53:56.695406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05638","created_at":"2026-05-17T23:53:56.695406+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WTF3F63MDV2","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WTF3F63MDV2JPXX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WTF3F63","created_at":"2026-05-18T12:33:12.712433+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/7WTF3F63MDV2JPXXUOV4DYW72A","json":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A.json","graph_json":"https://pith.science/api/pith-number/7WTF3F63MDV2JPXXUOV4DYW72A/graph.json","events_json":"https://pith.science/api/pith-number/7WTF3F63MDV2JPXXUOV4DYW72A/events.json","paper":"https://pith.science/paper/7WTF3F63"},"agent_actions":{"view_html":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A","download_json":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A.json","view_paper":"https://pith.science/paper/7WTF3F63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05638&json=true","fetch_graph":"https://pith.science/api/pith-number/7WTF3F63MDV2JPXXUOV4DYW72A/graph.json","fetch_events":"https://pith.science/api/pith-number/7WTF3F63MDV2JPXXUOV4DYW72A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/action/storage_attestation","attest_author":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/action/author_attestation","sign_citation":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/action/citation_signature","submit_replication":"https://pith.science/pith/7WTF3F63MDV2JPXXUOV4DYW72A/action/replication_record"}},"created_at":"2026-05-17T23:53:56.695406+00:00","updated_at":"2026-05-17T23:53:56.695406+00:00"}