{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XWQJPYMUBU37QLCVLPX6K5IG3P","short_pith_number":"pith:XWQJPYMU","canonical_record":{"source":{"id":"2010.09426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-19T12:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"02a8bcd3b5f8d372f803b4fc0883650bd2b5d54dca5e90073a8ac3fbbc0a3db7","abstract_canon_sha256":"218b2db8b3eea12ed1ac2278eff6724d96af8cffbd3583ec77ab6e565b906e13"},"schema_version":"1.0"},"canonical_sha256":"bda097e1940d37f82c555befe57506dbff1656cda002686559b42a50e056bf19","source":{"kind":"arxiv","id":"2010.09426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09426","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09426v1","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09426","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"XWQJPYMUBU37","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_16","alias_value":"XWQJPYMUBU37QLCV","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_8","alias_value":"XWQJPYMU","created_at":"2026-07-05T01:44:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XWQJPYMUBU37QLCVLPX6K5IG3P","target":"record","payload":{"canonical_record":{"source":{"id":"2010.09426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-19T12:36:50Z","cross_cats_sorted":[],"title_canon_sha256":"02a8bcd3b5f8d372f803b4fc0883650bd2b5d54dca5e90073a8ac3fbbc0a3db7","abstract_canon_sha256":"218b2db8b3eea12ed1ac2278eff6724d96af8cffbd3583ec77ab6e565b906e13"},"schema_version":"1.0"},"canonical_sha256":"bda097e1940d37f82c555befe57506dbff1656cda002686559b42a50e056bf19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:03.973497Z","signature_b64":"OCbwl0yVw/HFNDCjTwT0/J5OOxphlXYzhCs3gAoLWqEBpDmyN8OKzASOKS256KAw+5MmgURIJin6Xz/L/8OUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bda097e1940d37f82c555befe57506dbff1656cda002686559b42a50e056bf19","last_reissued_at":"2026-07-05T01:44:03.972949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:03.972949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.09426","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-07-05T01:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCu1iTLtgY2WGAloXQgirWis/hMcWjTBRd7lkOzBEvuxi0uJ7rNxUxfgsbzkwIUVzz4kp/f7viZgmt2DixNiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:59:17.287939Z"},"content_sha256":"0db033a31440dea372532be7d563bf8f9423d06f6fa94db1ec4cc09261557e42","schema_version":"1.0","event_id":"sha256:0db033a31440dea372532be7d563bf8f9423d06f6fa94db1ec4cc09261557e42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XWQJPYMUBU37QLCVLPX6K5IG3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ashish Bhutani, Dhritiman Das, Ishita Doshi, Niranjan Balasubramanian, Rajeev Kumar, Rushi Bhatt","submitted_at":"2020-10-19T12:36:50Z","abstract_excerpt":"Nearest neighbor search (NNS) has a wide range of applications in information retrieval, computer vision, machine learning, databases, and other areas. Existing state-of-the-art algorithm for nearest neighbor search, Hierarchical Navigable Small World Networks(HNSW), is unable to scale to large datasets of 100M records in high dimensions. In this paper, we propose LANNS, an end-to-end platform for Approximate Nearest Neighbor Search, which scales for web-scale datasets. Library for Large Scale Approximate Nearest Neighbor Search (LANNS) is deployed in multiple production systems for identifyin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09426","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.09426/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:44:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KGVaWSnxupn87z90PE4WLZ8LBQKpjesxKWTd8e28Xk0V1pJK2bJsURgZn3ZiyioRRG89ZtRaXLyoaxHe9ZtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T14:59:17.288442Z"},"content_sha256":"1eeae05c2f89ae7155d002c233573174d6af216016337ed885b0129f1d35d095","schema_version":"1.0","event_id":"sha256:1eeae05c2f89ae7155d002c233573174d6af216016337ed885b0129f1d35d095"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/bundle.json","state_url":"https://pith.science/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/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-08-08T14:59:17Z","links":{"resolver":"https://pith.science/pith/XWQJPYMUBU37QLCVLPX6K5IG3P","bundle":"https://pith.science/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/bundle.json","state":"https://pith.science/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWQJPYMUBU37QLCVLPX6K5IG3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XWQJPYMUBU37QLCVLPX6K5IG3P","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":"218b2db8b3eea12ed1ac2278eff6724d96af8cffbd3583ec77ab6e565b906e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-19T12:36:50Z","title_canon_sha256":"02a8bcd3b5f8d372f803b4fc0883650bd2b5d54dca5e90073a8ac3fbbc0a3db7"},"schema_version":"1.0","source":{"id":"2010.09426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09426","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09426v1","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09426","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_12","alias_value":"XWQJPYMUBU37","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_16","alias_value":"XWQJPYMUBU37QLCV","created_at":"2026-07-05T01:44:03Z"},{"alias_kind":"pith_short_8","alias_value":"XWQJPYMU","created_at":"2026-07-05T01:44:03Z"}],"graph_snapshots":[{"event_id":"sha256:1eeae05c2f89ae7155d002c233573174d6af216016337ed885b0129f1d35d095","target":"graph","created_at":"2026-07-05T01:44:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.09426/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Nearest neighbor search (NNS) has a wide range of applications in information retrieval, computer vision, machine learning, databases, and other areas. Existing state-of-the-art algorithm for nearest neighbor search, Hierarchical Navigable Small World Networks(HNSW), is unable to scale to large datasets of 100M records in high dimensions. In this paper, we propose LANNS, an end-to-end platform for Approximate Nearest Neighbor Search, which scales for web-scale datasets. Library for Large Scale Approximate Nearest Neighbor Search (LANNS) is deployed in multiple production systems for identifyin","authors_text":"Ashish Bhutani, Dhritiman Das, Ishita Doshi, Niranjan Balasubramanian, Rajeev Kumar, Rushi Bhatt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-19T12:36:50Z","title":"LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09426","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:0db033a31440dea372532be7d563bf8f9423d06f6fa94db1ec4cc09261557e42","target":"record","created_at":"2026-07-05T01:44:03Z","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":"218b2db8b3eea12ed1ac2278eff6724d96af8cffbd3583ec77ab6e565b906e13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2020-10-19T12:36:50Z","title_canon_sha256":"02a8bcd3b5f8d372f803b4fc0883650bd2b5d54dca5e90073a8ac3fbbc0a3db7"},"schema_version":"1.0","source":{"id":"2010.09426","kind":"arxiv","version":1}},"canonical_sha256":"bda097e1940d37f82c555befe57506dbff1656cda002686559b42a50e056bf19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bda097e1940d37f82c555befe57506dbff1656cda002686559b42a50e056bf19","first_computed_at":"2026-07-05T01:44:03.972949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:03.972949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OCbwl0yVw/HFNDCjTwT0/J5OOxphlXYzhCs3gAoLWqEBpDmyN8OKzASOKS256KAw+5MmgURIJin6Xz/L/8OUBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:03.973497Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.09426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0db033a31440dea372532be7d563bf8f9423d06f6fa94db1ec4cc09261557e42","sha256:1eeae05c2f89ae7155d002c233573174d6af216016337ed885b0129f1d35d095"],"state_sha256":"96c4d8e03fc4f19f098171b4e2c69aac391010c67cc6d1f9250bf2b4c7db1bf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWe3vdAfiKa+B8aoq6FYXi/FxukhgCIe1oA2+m2MN3NEmMPoavG+DI8pvdUxoECYPTviDY3zYpqGA+xPm8sOAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T14:59:17.293933Z","bundle_sha256":"c987c6cf8ce2f84fa3bc64d21ae504decc387b2d356ebbee05aa56506aba237f"}}