{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VFCRL7R6DHKUCG3ZS7HGFFJRGW","short_pith_number":"pith:VFCRL7R6","schema_version":"1.0","canonical_sha256":"a94515fe3e19d5411b7997ce62953135a7b0ea47ee373a35d9a868630b5b59d4","source":{"kind":"arxiv","id":"2202.10226","version":2},"attestation_state":"computed","paper":{"title":"Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Liu, Bo Zheng, Buting Ma, Han Zhu, Hongbo Deng, Jun Jiang, Qi Li, Qingbo Hua, Rihan Chen, Yaoxuan Wang, Yunlong Xu","submitted_at":"2022-02-14T07:55:57Z","abstract_excerpt":"Model-based methods for recommender systems have been studied extensively for years. Modern recommender systems usually resort to 1) representation learning models which define user-item preference as the distance between their embedding representations, and 2) embedding-based Approximate Nearest Neighbor (ANN) search to tackle the efficiency problem introduced by large-scale corpus. While providing efficient retrieval, the embedding-based retrieval pattern also limits the model capacity since the form of user-item preference measure is restricted to the distance between their embedding repres"},"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":"2202.10226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2022-02-14T07:55:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"892f3c0fbd7c279b190e8320acce86cd57523a3ccbbfc17c29a2ecf5811afcd3","abstract_canon_sha256":"e62c23d7950bf68d36a2894c7b44fc05da6c9025790fa8df82ccfc29aac0e2dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:23.085014Z","signature_b64":"6H4N17LOQN0Whu8sK48ybxpvFtjZjCSfTgASdH3DRwUz61iF7hJqC8yd/PP1qsif003HBANHUj5yLAgMxaRZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94515fe3e19d5411b7997ce62953135a7b0ea47ee373a35d9a868630b5b59d4","last_reissued_at":"2026-07-05T04:00:23.084578Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:23.084578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Liu, Bo Zheng, Buting Ma, Han Zhu, Hongbo Deng, Jun Jiang, Qi Li, Qingbo Hua, Rihan Chen, Yaoxuan Wang, Yunlong Xu","submitted_at":"2022-02-14T07:55:57Z","abstract_excerpt":"Model-based methods for recommender systems have been studied extensively for years. Modern recommender systems usually resort to 1) representation learning models which define user-item preference as the distance between their embedding representations, and 2) embedding-based Approximate Nearest Neighbor (ANN) search to tackle the efficiency problem introduced by large-scale corpus. While providing efficient retrieval, the embedding-based retrieval pattern also limits the model capacity since the form of user-item preference measure is restricted to the distance between their embedding repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10226","kind":"arxiv","version":2},"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/2202.10226/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":"2202.10226","created_at":"2026-07-05T04:00:23.084647+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.10226v2","created_at":"2026-07-05T04:00:23.084647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10226","created_at":"2026-07-05T04:00:23.084647+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFCRL7R6DHKU","created_at":"2026-07-05T04:00:23.084647+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFCRL7R6DHKUCG3Z","created_at":"2026-07-05T04:00:23.084647+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFCRL7R6","created_at":"2026-07-05T04:00:23.084647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29970","citing_title":"From Extraction to Navigation: Progressive Retrieval with Indirectly Infinite Depth","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW","json":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW.json","graph_json":"https://pith.science/api/pith-number/VFCRL7R6DHKUCG3ZS7HGFFJRGW/graph.json","events_json":"https://pith.science/api/pith-number/VFCRL7R6DHKUCG3ZS7HGFFJRGW/events.json","paper":"https://pith.science/paper/VFCRL7R6"},"agent_actions":{"view_html":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW","download_json":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW.json","view_paper":"https://pith.science/paper/VFCRL7R6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.10226&json=true","fetch_graph":"https://pith.science/api/pith-number/VFCRL7R6DHKUCG3ZS7HGFFJRGW/graph.json","fetch_events":"https://pith.science/api/pith-number/VFCRL7R6DHKUCG3ZS7HGFFJRGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW/action/storage_attestation","attest_author":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW/action/author_attestation","sign_citation":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW/action/citation_signature","submit_replication":"https://pith.science/pith/VFCRL7R6DHKUCG3ZS7HGFFJRGW/action/replication_record"}},"created_at":"2026-07-05T04:00:23.084647+00:00","updated_at":"2026-07-05T04:00:23.084647+00:00"}