{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2","short_pith_number":"pith:ZNGWMJPU","schema_version":"1.0","canonical_sha256":"cb4d6625f4baf3c5f4708e959fdf1286822cabdeabc3bb8950e5b72c48fd8cf7","source":{"kind":"arxiv","id":"1609.01690","version":1},"attestation_state":"computed","paper":{"title":"A Unified Coding Framework for Distributed Computing with Straggling Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","submitted_at":"2016-09-06T18:37:56Z","abstract_excerpt":"We propose a unified coded framework for distributed computing with straggling servers, by introducing a tradeoff between \"latency of computation\" and \"load of communication\" for some linear computation tasks. We show that the coded scheme of [1]-[3] that repeats the intermediate computations to create coded multicasting opportunities to reduce communication load, and the coded scheme of [4], [5] that generates redundant intermediate computations to combat against straggling servers can be viewed as special instances of the proposed framework, by considering two extremes of this tradeoff: mini"},"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":"1609.01690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-06T18:37:56Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"3bb78ed6005b3fba3e8860de1dfd1f75113c14464f4c152d951aa96273031a0f","abstract_canon_sha256":"85f40efa6e7c39605afa591b2650be87550ffbe132a809d220552094b38caf93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:22.177605Z","signature_b64":"9nwSxf0uKKQrsh/VZaqU5+iTXec2b9bLcDH3OlpAQI8odCn9tHkc3wN9WnIG0feOcrJgwbaNJHFoeA7nUss6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb4d6625f4baf3c5f4708e959fdf1286822cabdeabc3bb8950e5b72c48fd8cf7","last_reissued_at":"2026-05-18T01:01:22.177123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:22.177123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Coding Framework for Distributed Computing with Straggling Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Songze Li","submitted_at":"2016-09-06T18:37:56Z","abstract_excerpt":"We propose a unified coded framework for distributed computing with straggling servers, by introducing a tradeoff between \"latency of computation\" and \"load of communication\" for some linear computation tasks. We show that the coded scheme of [1]-[3] that repeats the intermediate computations to create coded multicasting opportunities to reduce communication load, and the coded scheme of [4], [5] that generates redundant intermediate computations to combat against straggling servers can be viewed as special instances of the proposed framework, by considering two extremes of this tradeoff: mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01690","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.01690","created_at":"2026-05-18T01:01:22.177195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01690v1","created_at":"2026-05-18T01:01:22.177195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01690","created_at":"2026-05-18T01:01:22.177195+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNGWMJPUXLZ4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNGWMJPUXLZ4L5DQ","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNGWMJPU","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.10105","citing_title":"Coded Distributed Computing: Performance Limits and Code Designs","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2","json":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2.json","graph_json":"https://pith.science/api/pith-number/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/graph.json","events_json":"https://pith.science/api/pith-number/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/events.json","paper":"https://pith.science/paper/ZNGWMJPU"},"agent_actions":{"view_html":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2","download_json":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2.json","view_paper":"https://pith.science/paper/ZNGWMJPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01690&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/action/storage_attestation","attest_author":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/action/author_attestation","sign_citation":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/action/citation_signature","submit_replication":"https://pith.science/pith/ZNGWMJPUXLZ4L5DQR2KZ7XYSQ2/action/replication_record"}},"created_at":"2026-05-18T01:01:22.177195+00:00","updated_at":"2026-05-18T01:01:22.177195+00:00"}