{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:PDZQMCUSJ6ZQUIR4SCSRNHIIQ3","short_pith_number":"pith:PDZQMCUS","canonical_record":{"source":{"id":"2101.11714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T23:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9c9c75a6329ef08177f5b9ffec4abc97cc5eb0fbd14b34ae25f7a843206b52c","abstract_canon_sha256":"835d9e5560f4229a3312d731382012c15360cfd96a3fe7dc53992b0b842d7e8c"},"schema_version":"1.0"},"canonical_sha256":"78f3060a924fb30a223c90a5169d0886cf90f25847eb3cbbcef5a433ca5a2f8a","source":{"kind":"arxiv","id":"2101.11714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11714","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11714v1","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11714","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_12","alias_value":"PDZQMCUSJ6ZQ","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_16","alias_value":"PDZQMCUSJ6ZQUIR4","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_8","alias_value":"PDZQMCUS","created_at":"2026-07-05T02:10:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:PDZQMCUSJ6ZQUIR4SCSRNHIIQ3","target":"record","payload":{"canonical_record":{"source":{"id":"2101.11714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T23:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"d9c9c75a6329ef08177f5b9ffec4abc97cc5eb0fbd14b34ae25f7a843206b52c","abstract_canon_sha256":"835d9e5560f4229a3312d731382012c15360cfd96a3fe7dc53992b0b842d7e8c"},"schema_version":"1.0"},"canonical_sha256":"78f3060a924fb30a223c90a5169d0886cf90f25847eb3cbbcef5a433ca5a2f8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:10:29.623159Z","signature_b64":"gDJCksSnUJEwMG1rgDI6sbMMce91D2f2Uf7DIIrKJ0f2WM6vIrG4X3c9G4QUGUcgOPsbyE8Gm6sPsDwN7uHqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78f3060a924fb30a223c90a5169d0886cf90f25847eb3cbbcef5a433ca5a2f8a","last_reissued_at":"2026-07-05T02:10:29.622734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:10:29.622734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.11714","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-07-05T02:10:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWcJhhz8NWQtTnEPrYGO3eR4TRDIOMj63sekwRjuaqoAJXBHD3bz82CKKWpyuOmhTjDxBLgg3L6BRukUPj88AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:18:28.009121Z"},"content_sha256":"edcd32c0f0c7cce69ed7f37727045d970d5413469936d48e6c9d7afb807e4211","schema_version":"1.0","event_id":"sha256:edcd32c0f0c7cce69ed7f37727045d970d5413469936d48e6c9d7afb807e4211"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:PDZQMCUSJ6ZQUIR4SCSRNHIIQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TT-Rec: Tensor Train Compression for Deep Learning Recommendation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bilge Acun, Carole-Jean Wu, Chunxing Yin, Xing Liu","submitted_at":"2021-01-25T23:19:03Z","abstract_excerpt":"The memory capacity of embedding tables in deep learning recommendation models (DLRMs) is increasing dramatically from tens of GBs to TBs across the industry. Given the fast growth in DLRMs, novel solutions are urgently needed, in order to enable fast and efficient DLRM innovations. At the same time, this must be done without having to exponentially increase infrastructure capacity demands. In this paper, we demonstrate the promising potential of Tensor Train decomposition for DLRMs (TT-Rec), an important yet under-investigated context. We design and implement optimized kernels (TT-EmbeddingBa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11714","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/2101.11714/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"},"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-07-05T02:10:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAW896Y9wbCf/1IZ7XLqSLWGsop42XfFrkdYgcqP6te9uzTGnWdanm6U1HfULHL0kMeopEvTOoReRC+ek53yAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T16:18:28.009520Z"},"content_sha256":"f251a4fb43cc44956e622d7f3933a51218c6452f30a40511e598f77b1ad46d2e","schema_version":"1.0","event_id":"sha256:f251a4fb43cc44956e622d7f3933a51218c6452f30a40511e598f77b1ad46d2e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/bundle.json","state_url":"https://pith.science/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/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-07-06T16:18:28Z","links":{"resolver":"https://pith.science/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3","bundle":"https://pith.science/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/bundle.json","state":"https://pith.science/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDZQMCUSJ6ZQUIR4SCSRNHIIQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:PDZQMCUSJ6ZQUIR4SCSRNHIIQ3","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":"835d9e5560f4229a3312d731382012c15360cfd96a3fe7dc53992b0b842d7e8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T23:19:03Z","title_canon_sha256":"d9c9c75a6329ef08177f5b9ffec4abc97cc5eb0fbd14b34ae25f7a843206b52c"},"schema_version":"1.0","source":{"id":"2101.11714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.11714","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"arxiv_version","alias_value":"2101.11714v1","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.11714","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_12","alias_value":"PDZQMCUSJ6ZQ","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_16","alias_value":"PDZQMCUSJ6ZQUIR4","created_at":"2026-07-05T02:10:29Z"},{"alias_kind":"pith_short_8","alias_value":"PDZQMCUS","created_at":"2026-07-05T02:10:29Z"}],"graph_snapshots":[{"event_id":"sha256:f251a4fb43cc44956e622d7f3933a51218c6452f30a40511e598f77b1ad46d2e","target":"graph","created_at":"2026-07-05T02:10:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.11714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The memory capacity of embedding tables in deep learning recommendation models (DLRMs) is increasing dramatically from tens of GBs to TBs across the industry. Given the fast growth in DLRMs, novel solutions are urgently needed, in order to enable fast and efficient DLRM innovations. At the same time, this must be done without having to exponentially increase infrastructure capacity demands. In this paper, we demonstrate the promising potential of Tensor Train decomposition for DLRMs (TT-Rec), an important yet under-investigated context. We design and implement optimized kernels (TT-EmbeddingBa","authors_text":"Bilge Acun, Carole-Jean Wu, Chunxing Yin, Xing Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T23:19:03Z","title":"TT-Rec: Tensor Train Compression for Deep Learning Recommendation Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.11714","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:edcd32c0f0c7cce69ed7f37727045d970d5413469936d48e6c9d7afb807e4211","target":"record","created_at":"2026-07-05T02:10:29Z","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":"835d9e5560f4229a3312d731382012c15360cfd96a3fe7dc53992b0b842d7e8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-01-25T23:19:03Z","title_canon_sha256":"d9c9c75a6329ef08177f5b9ffec4abc97cc5eb0fbd14b34ae25f7a843206b52c"},"schema_version":"1.0","source":{"id":"2101.11714","kind":"arxiv","version":1}},"canonical_sha256":"78f3060a924fb30a223c90a5169d0886cf90f25847eb3cbbcef5a433ca5a2f8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78f3060a924fb30a223c90a5169d0886cf90f25847eb3cbbcef5a433ca5a2f8a","first_computed_at":"2026-07-05T02:10:29.622734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:29.622734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gDJCksSnUJEwMG1rgDI6sbMMce91D2f2Uf7DIIrKJ0f2WM6vIrG4X3c9G4QUGUcgOPsbyE8Gm6sPsDwN7uHqDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:29.623159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.11714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edcd32c0f0c7cce69ed7f37727045d970d5413469936d48e6c9d7afb807e4211","sha256:f251a4fb43cc44956e622d7f3933a51218c6452f30a40511e598f77b1ad46d2e"],"state_sha256":"f9b24c138a3f8c08509dc2629efa2d15f9ba60875f7ca8b454fd87ba918da8de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mc68HvGODA55SebGizZWWory68+oGnlV4OiJgWLJ8nsjHQAnEJ4/EP0Ojjy1TAtjfajo6ym8gG7eMtPzZIWbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T16:18:28.011506Z","bundle_sha256":"2d95d5b8f786b504fc0f39e2a2e3d2111a5ef5e92826b0649fc5fe9ebe600156"}}