{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MB3VADY7AY26ZWHCF4MTMGYWLM","short_pith_number":"pith:MB3VADY7","schema_version":"1.0","canonical_sha256":"6077500f1f0635ecd8e22f19361b165b1488c8c95f638f778a4023a6573af723","source":{"kind":"arxiv","id":"2301.02959","version":1},"attestation_state":"computed","paper":{"title":"FlexShard: Flexible Sharding for Industry-Scale Sequence Recommendation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IR","cs.PF"],"primary_cat":"cs.LG","authors_text":"Carole-Jean Wu, Christos Kozyrakis, Dhruv Choudhary, Geet Sethi, Pallab Bhattacharya","submitted_at":"2023-01-08T01:46:26Z","abstract_excerpt":"Sequence-based deep learning recommendation models (DLRMs) are an emerging class of DLRMs showing great improvements over their prior sum-pooling based counterparts at capturing users' long term interests. These improvements come at immense system cost however, with sequence-based DLRMs requiring substantial amounts of data to be dynamically materialized and communicated by each accelerator during a single iteration. To address this rapidly growing bottleneck, we present FlexShard, a new tiered sequence embedding table sharding algorithm which operates at a per-row granularity by exploiting th"},"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":"2301.02959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-08T01:46:26Z","cross_cats_sorted":["cs.DC","cs.IR","cs.PF"],"title_canon_sha256":"2574cffdaeb376a4f7ecb7d56faa68e5e96e879415e418c19df894791bdfa5c1","abstract_canon_sha256":"ba3b0d9c7b4fe23e663b219b5d44dd3a6cae3dc806a157a4b48a85c21ddb83c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:24.022892Z","signature_b64":"dzHHvk/VPOEGdzj5NlGfx43LtCKziEx09yDtdSYMciQOFiDvAznBrW8+aRIy7V+zPQAMpir+4vRV+nm0uAgvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6077500f1f0635ecd8e22f19361b165b1488c8c95f638f778a4023a6573af723","last_reissued_at":"2026-07-05T05:31:24.022522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:24.022522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FlexShard: Flexible Sharding for Industry-Scale Sequence Recommendation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IR","cs.PF"],"primary_cat":"cs.LG","authors_text":"Carole-Jean Wu, Christos Kozyrakis, Dhruv Choudhary, Geet Sethi, Pallab Bhattacharya","submitted_at":"2023-01-08T01:46:26Z","abstract_excerpt":"Sequence-based deep learning recommendation models (DLRMs) are an emerging class of DLRMs showing great improvements over their prior sum-pooling based counterparts at capturing users' long term interests. These improvements come at immense system cost however, with sequence-based DLRMs requiring substantial amounts of data to be dynamically materialized and communicated by each accelerator during a single iteration. To address this rapidly growing bottleneck, we present FlexShard, a new tiered sequence embedding table sharding algorithm which operates at a per-row granularity by exploiting th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.02959","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/2301.02959/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":"2301.02959","created_at":"2026-07-05T05:31:24.022574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.02959v1","created_at":"2026-07-05T05:31:24.022574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.02959","created_at":"2026-07-05T05:31:24.022574+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB3VADY7AY26","created_at":"2026-07-05T05:31:24.022574+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB3VADY7AY26ZWHC","created_at":"2026-07-05T05:31:24.022574+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB3VADY7","created_at":"2026-07-05T05:31:24.022574+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/MB3VADY7AY26ZWHCF4MTMGYWLM","json":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM.json","graph_json":"https://pith.science/api/pith-number/MB3VADY7AY26ZWHCF4MTMGYWLM/graph.json","events_json":"https://pith.science/api/pith-number/MB3VADY7AY26ZWHCF4MTMGYWLM/events.json","paper":"https://pith.science/paper/MB3VADY7"},"agent_actions":{"view_html":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM","download_json":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM.json","view_paper":"https://pith.science/paper/MB3VADY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.02959&json=true","fetch_graph":"https://pith.science/api/pith-number/MB3VADY7AY26ZWHCF4MTMGYWLM/graph.json","fetch_events":"https://pith.science/api/pith-number/MB3VADY7AY26ZWHCF4MTMGYWLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM/action/storage_attestation","attest_author":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM/action/author_attestation","sign_citation":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM/action/citation_signature","submit_replication":"https://pith.science/pith/MB3VADY7AY26ZWHCF4MTMGYWLM/action/replication_record"}},"created_at":"2026-07-05T05:31:24.022574+00:00","updated_at":"2026-07-05T05:31:24.022574+00:00"}