{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7DC5TAOUARFR3DE5GQFM5W2RRX","short_pith_number":"pith:7DC5TAOU","schema_version":"1.0","canonical_sha256":"f8c5d981d4044b1d8c9d340acedb518df5bdafa39de4c19193c1e45190e5fd11","source":{"kind":"arxiv","id":"2112.01944","version":1},"attestation_state":"computed","paper":{"title":"Towards Low-loss 1-bit Quantization of User-item Representations for Top-K Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Huifeng Guo, Irwin King, Jingjie Li, Ruiming Tang, Xiuqiang He, Yankai Chen, Yifei Zhang, Yingxue Zhang","submitted_at":"2021-12-03T14:43:55Z","abstract_excerpt":"Due to the promising advantages in space compression and inference acceleration, quantized representation learning for recommender systems has become an emerging research direction recently. As the target is to embed latent features in the discrete embedding space, developing quantization for user-item representations with a few low-precision integers confronts the challenge of high information loss, thus leading to unsatisfactory performance in Top-K recommendation.\n  In this work, we study the problem of representation learning for recommendation with 1-bit quantization. We propose a model n"},"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":"2112.01944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-03T14:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"e4b48c58ca60c50ea83223bfc6e9c6612d0902a7460c08b4a4b6e9a408e5980b","abstract_canon_sha256":"1634bbbc9232db25e0e3ccd6b9c4062ec850133f33900e744687a5e072df1a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:34.325421Z","signature_b64":"vqGK5Fp3QQKww2jPU2uOwoWj3+hwvZVr4PCAlW43dpUjEJPCUSpz7F98LhmY76ycqu/Y1jJa9Isjtk6b+prpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c5d981d4044b1d8c9d340acedb518df5bdafa39de4c19193c1e45190e5fd11","last_reissued_at":"2026-07-05T03:37:34.323525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:34.323525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Low-loss 1-bit Quantization of User-item Representations for Top-K Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Huifeng Guo, Irwin King, Jingjie Li, Ruiming Tang, Xiuqiang He, Yankai Chen, Yifei Zhang, Yingxue Zhang","submitted_at":"2021-12-03T14:43:55Z","abstract_excerpt":"Due to the promising advantages in space compression and inference acceleration, quantized representation learning for recommender systems has become an emerging research direction recently. As the target is to embed latent features in the discrete embedding space, developing quantization for user-item representations with a few low-precision integers confronts the challenge of high information loss, thus leading to unsatisfactory performance in Top-K recommendation.\n  In this work, we study the problem of representation learning for recommendation with 1-bit quantization. We propose a model n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01944","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/2112.01944/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":"2112.01944","created_at":"2026-07-05T03:37:34.324375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.01944v1","created_at":"2026-07-05T03:37:34.324375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01944","created_at":"2026-07-05T03:37:34.324375+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DC5TAOUARFR","created_at":"2026-07-05T03:37:34.324375+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DC5TAOUARFR3DE5","created_at":"2026-07-05T03:37:34.324375+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DC5TAOU","created_at":"2026-07-05T03:37:34.324375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19993","citing_title":"CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX","json":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX.json","graph_json":"https://pith.science/api/pith-number/7DC5TAOUARFR3DE5GQFM5W2RRX/graph.json","events_json":"https://pith.science/api/pith-number/7DC5TAOUARFR3DE5GQFM5W2RRX/events.json","paper":"https://pith.science/paper/7DC5TAOU"},"agent_actions":{"view_html":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX","download_json":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX.json","view_paper":"https://pith.science/paper/7DC5TAOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.01944&json=true","fetch_graph":"https://pith.science/api/pith-number/7DC5TAOUARFR3DE5GQFM5W2RRX/graph.json","fetch_events":"https://pith.science/api/pith-number/7DC5TAOUARFR3DE5GQFM5W2RRX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX/action/storage_attestation","attest_author":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX/action/author_attestation","sign_citation":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX/action/citation_signature","submit_replication":"https://pith.science/pith/7DC5TAOUARFR3DE5GQFM5W2RRX/action/replication_record"}},"created_at":"2026-07-05T03:37:34.324375+00:00","updated_at":"2026-07-05T03:37:34.324375+00:00"}