{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NNN3XNM3JB2NR6XRGUOV6DTXTL","short_pith_number":"pith:NNN3XNM3","canonical_record":{"source":{"id":"1903.00103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-26T05:00:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7e3a74173e2ff52252a8f6a8b1fbca52c7f458d52dcd090c2193f7a1511464f6","abstract_canon_sha256":"c14a9ee3523e96a1035424de6f6758c9a232b3d6ba157bf002db4a22c530d11d"},"schema_version":"1.0"},"canonical_sha256":"6b5bbbb59b4874d8faf1351d5f0e779ae4485de2029c18425e885fe2e5b9a985","source":{"kind":"arxiv","id":"1903.00103","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00103","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00103v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00103","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"NNN3XNM3JB2N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NNN3XNM3JB2NR6XR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NNN3XNM3","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NNN3XNM3JB2NR6XRGUOV6DTXTL","target":"record","payload":{"canonical_record":{"source":{"id":"1903.00103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-26T05:00:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7e3a74173e2ff52252a8f6a8b1fbca52c7f458d52dcd090c2193f7a1511464f6","abstract_canon_sha256":"c14a9ee3523e96a1035424de6f6758c9a232b3d6ba157bf002db4a22c530d11d"},"schema_version":"1.0"},"canonical_sha256":"6b5bbbb59b4874d8faf1351d5f0e779ae4485de2029c18425e885fe2e5b9a985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:20.913802Z","signature_b64":"4nsLPIXN1KpO8XhqfhSzx0sePKPdLgZnXeFaheoo5uIlcheGT6hgOdqsPTMi6CCebCKq+qR/ev7kIfEOQPyLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5bbbb59b4874d8faf1351d5f0e779ae4485de2029c18425e885fe2e5b9a985","last_reissued_at":"2026-05-17T23:52:20.912966Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:20.912966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.00103","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-05-17T23:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qupDoeoY9oTs7LmtDT0lTYSskUbx4XSPKbfOmqesbZE0Ze3iqaXu4R0JTwssWG/nQAxCfY4wbcKm9vgNQaLMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:14:18.482591Z"},"content_sha256":"43f5b8e061ba3babae7988e824b9a4c1c5c0a7379b0cd6eae946b8a3432d975b","schema_version":"1.0","event_id":"sha256:43f5b8e061ba3babae7988e824b9a4c1c5c0a7379b0cd6eae946b8a3432d975b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NNN3XNM3JB2NR6XRGUOV6DTXTL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saec: Similarity-Aware Embedding Compression in Recommendation Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.IR","authors_text":"Honglin Zhang, Hong Xu, Huaming Chen, Jian Wang, Xiaorui Wu","submitted_at":"2019-02-26T05:00:22Z","abstract_excerpt":"Production recommendation systems rely on embedding methods to represent various features. An impeding challenge in practice is that the large embedding matrix incurs substantial memory footprint in serving as the number of features grows over time. We propose a similarity-aware embedding matrix compression method called Saec to address this challenge. Saec clusters similar features within a field to reduce the embedding matrix size. Saec also adopts a fast clustering optimization based on feature frequency to drastically improve clustering time. We implement and evaluate Saec on Numerous, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00103","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":""},"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-05-17T23:52:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+8jHFEdKpV0W7NxXOU21iyAo5cYkxltX+Dbr6xw0oWkxrt0oFPWNADfKC9o7PfaNpu24cxr0mDdEdE3AP2/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:14:18.483284Z"},"content_sha256":"16aa1e63bed0ad66578c53261cee635662f6b6d9c6aacc707187f59111e8eddd","schema_version":"1.0","event_id":"sha256:16aa1e63bed0ad66578c53261cee635662f6b6d9c6aacc707187f59111e8eddd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/bundle.json","state_url":"https://pith.science/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/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-05-25T22:14:18Z","links":{"resolver":"https://pith.science/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL","bundle":"https://pith.science/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/bundle.json","state":"https://pith.science/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNN3XNM3JB2NR6XRGUOV6DTXTL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NNN3XNM3JB2NR6XRGUOV6DTXTL","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":"c14a9ee3523e96a1035424de6f6758c9a232b3d6ba157bf002db4a22c530d11d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-26T05:00:22Z","title_canon_sha256":"7e3a74173e2ff52252a8f6a8b1fbca52c7f458d52dcd090c2193f7a1511464f6"},"schema_version":"1.0","source":{"id":"1903.00103","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.00103","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"arxiv_version","alias_value":"1903.00103v1","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00103","created_at":"2026-05-17T23:52:20Z"},{"alias_kind":"pith_short_12","alias_value":"NNN3XNM3JB2N","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NNN3XNM3JB2NR6XR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NNN3XNM3","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:16aa1e63bed0ad66578c53261cee635662f6b6d9c6aacc707187f59111e8eddd","target":"graph","created_at":"2026-05-17T23:52:20Z","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"},"paper":{"abstract_excerpt":"Production recommendation systems rely on embedding methods to represent various features. An impeding challenge in practice is that the large embedding matrix incurs substantial memory footprint in serving as the number of features grows over time. We propose a similarity-aware embedding matrix compression method called Saec to address this challenge. Saec clusters similar features within a field to reduce the embedding matrix size. Saec also adopts a fast clustering optimization based on feature frequency to drastically improve clustering time. We implement and evaluate Saec on Numerous, the","authors_text":"Honglin Zhang, Hong Xu, Huaming Chen, Jian Wang, Xiaorui Wu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-26T05:00:22Z","title":"Saec: Similarity-Aware Embedding Compression in Recommendation Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00103","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:43f5b8e061ba3babae7988e824b9a4c1c5c0a7379b0cd6eae946b8a3432d975b","target":"record","created_at":"2026-05-17T23:52:20Z","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":"c14a9ee3523e96a1035424de6f6758c9a232b3d6ba157bf002db4a22c530d11d","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-02-26T05:00:22Z","title_canon_sha256":"7e3a74173e2ff52252a8f6a8b1fbca52c7f458d52dcd090c2193f7a1511464f6"},"schema_version":"1.0","source":{"id":"1903.00103","kind":"arxiv","version":1}},"canonical_sha256":"6b5bbbb59b4874d8faf1351d5f0e779ae4485de2029c18425e885fe2e5b9a985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5bbbb59b4874d8faf1351d5f0e779ae4485de2029c18425e885fe2e5b9a985","first_computed_at":"2026-05-17T23:52:20.912966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:20.912966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4nsLPIXN1KpO8XhqfhSzx0sePKPdLgZnXeFaheoo5uIlcheGT6hgOdqsPTMi6CCebCKq+qR/ev7kIfEOQPyLBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:20.913802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.00103","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43f5b8e061ba3babae7988e824b9a4c1c5c0a7379b0cd6eae946b8a3432d975b","sha256:16aa1e63bed0ad66578c53261cee635662f6b6d9c6aacc707187f59111e8eddd"],"state_sha256":"dc58f38212d8b1d617ff2ee124211f92c8d7d9218a4785227f8f407fc641b151"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PcYLyRL7M3T8JBPYd9C+0OrO0sakNKe6OhRZmGwGtCdJ1O8KgLgudUPXJtbSWgqev3td7hrysL/FeUa8z4bADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:14:18.487034Z","bundle_sha256":"fd148a0ba1781e4758764222e15268817cf5ecd0f6d1bf74786753df95a31029"}}