{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ITJHZY72W7WVWNROXSKNDADOAA","short_pith_number":"pith:ITJHZY72","schema_version":"1.0","canonical_sha256":"44d27ce3fab7ed5b362ebc94d1806e002f2ff74bb577e0a9a8643579d35f64b8","source":{"kind":"arxiv","id":"2011.06223","version":2},"attestation_state":"computed","paper":{"title":"Coded Computing for Low-Latency Federated Learning over Wireless Edge Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Mustafa Akdeniz, Nageen Himayat, Sagar Dhakal, Salman Avestimehr, Saurav Prakash, Shilpa Talwar, Yair Yona","submitted_at":"2020-11-12T06:21:59Z","abstract_excerpt":"Federated learning enables training a global model from data located at the client nodes, without data sharing and moving client data to a centralized server. Performance of federated learning in a multi-access edge computing (MEC) network suffers from slow convergence due to heterogeneity and stochastic fluctuations in compute power and communication link qualities across clients. We propose a novel coded computing framework, CodedFedL, that injects structured coding redundancy into federated learning for mitigating stragglers and speeding up the training procedure. CodedFedL enables coded co"},"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":"2011.06223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-11-12T06:21:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9a920b430fcb0e1db91bb677f1f3a1e1a9df886bc41d3e2b83f01e53b8323eed","abstract_canon_sha256":"883bb93dc33463c481cd5d763421f274d834a3ba99934eb47d0494c563cd5a27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:31.260098Z","signature_b64":"SxFeCWxMWehciAOAArP4g/0HKxZTHAZYFyWU4v3LAbDs2DauOXInbwcMyVSKnEyM09GBVtN0y69N/my4oNIZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44d27ce3fab7ed5b362ebc94d1806e002f2ff74bb577e0a9a8643579d35f64b8","last_reissued_at":"2026-07-05T02:38:31.259675Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:31.259675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Computing for Low-Latency Federated Learning over Wireless Edge Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DC","authors_text":"Mustafa Akdeniz, Nageen Himayat, Sagar Dhakal, Salman Avestimehr, Saurav Prakash, Shilpa Talwar, Yair Yona","submitted_at":"2020-11-12T06:21:59Z","abstract_excerpt":"Federated learning enables training a global model from data located at the client nodes, without data sharing and moving client data to a centralized server. Performance of federated learning in a multi-access edge computing (MEC) network suffers from slow convergence due to heterogeneity and stochastic fluctuations in compute power and communication link qualities across clients. We propose a novel coded computing framework, CodedFedL, that injects structured coding redundancy into federated learning for mitigating stragglers and speeding up the training procedure. CodedFedL enables coded co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06223","kind":"arxiv","version":2},"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/2011.06223/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":"2011.06223","created_at":"2026-07-05T02:38:31.259756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06223v2","created_at":"2026-07-05T02:38:31.259756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06223","created_at":"2026-07-05T02:38:31.259756+00:00"},{"alias_kind":"pith_short_12","alias_value":"ITJHZY72W7WV","created_at":"2026-07-05T02:38:31.259756+00:00"},{"alias_kind":"pith_short_16","alias_value":"ITJHZY72W7WVWNRO","created_at":"2026-07-05T02:38:31.259756+00:00"},{"alias_kind":"pith_short_8","alias_value":"ITJHZY72","created_at":"2026-07-05T02:38:31.259756+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/ITJHZY72W7WVWNROXSKNDADOAA","json":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA.json","graph_json":"https://pith.science/api/pith-number/ITJHZY72W7WVWNROXSKNDADOAA/graph.json","events_json":"https://pith.science/api/pith-number/ITJHZY72W7WVWNROXSKNDADOAA/events.json","paper":"https://pith.science/paper/ITJHZY72"},"agent_actions":{"view_html":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA","download_json":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA.json","view_paper":"https://pith.science/paper/ITJHZY72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06223&json=true","fetch_graph":"https://pith.science/api/pith-number/ITJHZY72W7WVWNROXSKNDADOAA/graph.json","fetch_events":"https://pith.science/api/pith-number/ITJHZY72W7WVWNROXSKNDADOAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA/action/storage_attestation","attest_author":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA/action/author_attestation","sign_citation":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA/action/citation_signature","submit_replication":"https://pith.science/pith/ITJHZY72W7WVWNROXSKNDADOAA/action/replication_record"}},"created_at":"2026-07-05T02:38:31.259756+00:00","updated_at":"2026-07-05T02:38:31.259756+00:00"}