{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZVGXI65NZYBU3J5S2KILR7P3HL","short_pith_number":"pith:ZVGXI65N","schema_version":"1.0","canonical_sha256":"cd4d747badce034da7b2d290b8fdfb3aded8dddd000826cb7df7df7f1de27f7e","source":{"kind":"arxiv","id":"2302.08714","version":1},"attestation_state":"computed","paper":{"title":"Binary Embedding-based Retrieval at Tencent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.IR","authors_text":"Chang Zhou, Quanchao Hui, Shupeng Su, Xiang Chen, Xuyuan Xu, Yexin Wang, Ying Shan, Yixiao Ge, Yukang Gan, Zhouchuan Xu","submitted_at":"2023-02-17T06:10:02Z","abstract_excerpt":"Large-scale embedding-based retrieval (EBR) is the cornerstone of search-related industrial applications. Given a user query, the system of EBR aims to identify relevant information from a large corpus of documents that may be tens or hundreds of billions in size. The storage and computation turn out to be expensive and inefficient with massive documents and high concurrent queries, making it difficult to further scale up. To tackle the challenge, we propose a binary embedding-based retrieval (BEBR) engine equipped with a recurrent binarization algorithm that enables customized bits per dimens"},"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":"2302.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2023-02-17T06:10:02Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"7bbf51555e971e406197fadc44a8e31fef14ff6a841c2a0385a0150668e9b7c7","abstract_canon_sha256":"bc75daf9fcab53edf6fa6b1de06da18ea0829b9480141199befaadd49205d0cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:42:53.934112Z","signature_b64":"eD8wUjsgMNgJJHtKPs/HuuAh/GwgA/wytZaw8/5WxvstR5X6ssINSnoYyK8gpvJ3fHSvvbnkFv26crm1SuxkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd4d747badce034da7b2d290b8fdfb3aded8dddd000826cb7df7df7f1de27f7e","last_reissued_at":"2026-07-05T05:42:53.933698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:42:53.933698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Embedding-based Retrieval at Tencent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.IR","authors_text":"Chang Zhou, Quanchao Hui, Shupeng Su, Xiang Chen, Xuyuan Xu, Yexin Wang, Ying Shan, Yixiao Ge, Yukang Gan, Zhouchuan Xu","submitted_at":"2023-02-17T06:10:02Z","abstract_excerpt":"Large-scale embedding-based retrieval (EBR) is the cornerstone of search-related industrial applications. Given a user query, the system of EBR aims to identify relevant information from a large corpus of documents that may be tens or hundreds of billions in size. The storage and computation turn out to be expensive and inefficient with massive documents and high concurrent queries, making it difficult to further scale up. To tackle the challenge, we propose a binary embedding-based retrieval (BEBR) engine equipped with a recurrent binarization algorithm that enables customized bits per dimens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.08714","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/2302.08714/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":"2302.08714","created_at":"2026-07-05T05:42:53.933757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.08714v1","created_at":"2026-07-05T05:42:53.933757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.08714","created_at":"2026-07-05T05:42:53.933757+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVGXI65NZYBU","created_at":"2026-07-05T05:42:53.933757+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVGXI65NZYBU3J5S","created_at":"2026-07-05T05:42:53.933757+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVGXI65N","created_at":"2026-07-05T05:42:53.933757+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/ZVGXI65NZYBU3J5S2KILR7P3HL","json":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL.json","graph_json":"https://pith.science/api/pith-number/ZVGXI65NZYBU3J5S2KILR7P3HL/graph.json","events_json":"https://pith.science/api/pith-number/ZVGXI65NZYBU3J5S2KILR7P3HL/events.json","paper":"https://pith.science/paper/ZVGXI65N"},"agent_actions":{"view_html":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL","download_json":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL.json","view_paper":"https://pith.science/paper/ZVGXI65N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.08714&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVGXI65NZYBU3J5S2KILR7P3HL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVGXI65NZYBU3J5S2KILR7P3HL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL/action/storage_attestation","attest_author":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL/action/author_attestation","sign_citation":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL/action/citation_signature","submit_replication":"https://pith.science/pith/ZVGXI65NZYBU3J5S2KILR7P3HL/action/replication_record"}},"created_at":"2026-07-05T05:42:53.933757+00:00","updated_at":"2026-07-05T05:42:53.933757+00:00"}