{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LBO7E4JHWPRU7LYVA32CL4HEFC","short_pith_number":"pith:LBO7E4JH","schema_version":"1.0","canonical_sha256":"585df27127b3e34faf1506f425f0e4288ba8c5f84aeb4bca4645ae20eb1813fc","source":{"kind":"arxiv","id":"2206.10839","version":1},"attestation_state":"computed","paper":{"title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ping Li, Shulong Tan, Weijie Zhao, Zhaozhuo Xu, Zhixin Zhou","submitted_at":"2022-06-22T04:35:57Z","abstract_excerpt":"Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems. Recent studies bring proximity graph-based methods into practitioners' attention -- proximity graph-based methods outperform other solutions such as quantization, hashing, and tree-based ANN algorithm families. In current recommendation systems, data point insertions, deletions, and queries are streamed into the system in an online fashion as users and items change dynamically. As proximity graphs are constructed incrementally by inserting data points as new vertices into the"},"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":"2206.10839","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2022-06-22T04:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"9583313ac51f5b7f780091ee340cfdd23b732af96ea9bf6bbfbc744e78c287b8","abstract_canon_sha256":"f961b6d2f8f0cf9baf8fc1934c1765798ae2b434129548c7b0d3342f5d947221"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:33:56.145719Z","signature_b64":"+0NliEZSKGOzM7k/omGfgPOgeDTd1Ww6/3CkQ0DDkf6Igx7+yPfPFQPWa/Dh650LiyE/GDr2h/Aq6+SWC0/sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"585df27127b3e34faf1506f425f0e4288ba8c5f84aeb4bca4645ae20eb1813fc","last_reissued_at":"2026-07-05T04:33:56.145251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:33:56.145251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proximity Graph Maintenance for Fast Online Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ping Li, Shulong Tan, Weijie Zhao, Zhaozhuo Xu, Zhixin Zhou","submitted_at":"2022-06-22T04:35:57Z","abstract_excerpt":"Approximate Nearest Neighbor (ANN) search is a fundamental technique for (e.g.,) the deployment of recommender systems. Recent studies bring proximity graph-based methods into practitioners' attention -- proximity graph-based methods outperform other solutions such as quantization, hashing, and tree-based ANN algorithm families. In current recommendation systems, data point insertions, deletions, and queries are streamed into the system in an online fashion as users and items change dynamically. As proximity graphs are constructed incrementally by inserting data points as new vertices into the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.10839","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/2206.10839/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.10839","created_at":"2026-07-05T04:33:56.145307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.10839v1","created_at":"2026-07-05T04:33:56.145307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.10839","created_at":"2026-07-05T04:33:56.145307+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBO7E4JHWPRU","created_at":"2026-07-05T04:33:56.145307+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBO7E4JHWPRU7LYV","created_at":"2026-07-05T04:33:56.145307+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBO7E4JH","created_at":"2026-07-05T04:33:56.145307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17094","citing_title":"PathWeaver: A High-Throughput Multi-GPU System for Graph-Based Approximate Nearest Neighbor Search","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC","json":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC.json","graph_json":"https://pith.science/api/pith-number/LBO7E4JHWPRU7LYVA32CL4HEFC/graph.json","events_json":"https://pith.science/api/pith-number/LBO7E4JHWPRU7LYVA32CL4HEFC/events.json","paper":"https://pith.science/paper/LBO7E4JH"},"agent_actions":{"view_html":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC","download_json":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC.json","view_paper":"https://pith.science/paper/LBO7E4JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.10839&json=true","fetch_graph":"https://pith.science/api/pith-number/LBO7E4JHWPRU7LYVA32CL4HEFC/graph.json","fetch_events":"https://pith.science/api/pith-number/LBO7E4JHWPRU7LYVA32CL4HEFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC/action/storage_attestation","attest_author":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC/action/author_attestation","sign_citation":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC/action/citation_signature","submit_replication":"https://pith.science/pith/LBO7E4JHWPRU7LYVA32CL4HEFC/action/replication_record"}},"created_at":"2026-07-05T04:33:56.145307+00:00","updated_at":"2026-07-05T04:33:56.145307+00:00"}