{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YM77A5P3DLLJQUKDTY4O4YLKNI","short_pith_number":"pith:YM77A5P3","schema_version":"1.0","canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","source":{"kind":"arxiv","id":"1906.10105","version":1},"attestation_state":"computed","paper":{"title":"Coded Distributed Computing: Performance Limits and Code Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mahdi Soleymani, Mohammad Vahid Jamali","submitted_at":"2019-06-24T17:45:14Z","abstract_excerpt":"We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed nodes. The goal is to reduce the average execution time of the computational job. We provide a connection between the problem of characterizing the average execution time of a coded distributed computing system and the problem of analyzing the error probability of codes of length $n$ used over erasure channels. Accordingly, we present closed-form expressions for"},"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":"1906.10105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-24T17:45:14Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"0e632dc4e5cb14d1d9619aed09c162492eeaa822996e7abf9bbe228860f1bebb","abstract_canon_sha256":"729452a9cbd09c6d753545395f373b3a7e656196b820c50b5e9b5ab2789e5d26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:35.430123Z","signature_b64":"ivWB8DLKhAg3LoHl0sZrWP9AeAmixps3M5FNgueK3AMesIX2Z9qmB/vGb3IHw8Hj+qzeFFlMOxDI/ikwKWSxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","last_reissued_at":"2026-05-17T23:42:35.429488Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:35.429488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded Distributed Computing: Performance Limits and Code Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Hessam Mahdavifar, Mahdi Soleymani, Mohammad Vahid Jamali","submitted_at":"2019-06-24T17:45:14Z","abstract_excerpt":"We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed nodes. The goal is to reduce the average execution time of the computational job. We provide a connection between the problem of characterizing the average execution time of a coded distributed computing system and the problem of analyzing the error probability of codes of length $n$ used over erasure channels. Accordingly, we present closed-form expressions for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10105","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":"1906.10105","created_at":"2026-05-17T23:42:35.429591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10105v1","created_at":"2026-05-17T23:42:35.429591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10105","created_at":"2026-05-17T23:42:35.429591+00:00"},{"alias_kind":"pith_short_12","alias_value":"YM77A5P3DLLJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"YM77A5P3DLLJQUKD","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"YM77A5P3","created_at":"2026-05-18T12:33:33.725879+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/YM77A5P3DLLJQUKDTY4O4YLKNI","json":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI.json","graph_json":"https://pith.science/api/pith-number/YM77A5P3DLLJQUKDTY4O4YLKNI/graph.json","events_json":"https://pith.science/api/pith-number/YM77A5P3DLLJQUKDTY4O4YLKNI/events.json","paper":"https://pith.science/paper/YM77A5P3"},"agent_actions":{"view_html":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI","download_json":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI.json","view_paper":"https://pith.science/paper/YM77A5P3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10105&json=true","fetch_graph":"https://pith.science/api/pith-number/YM77A5P3DLLJQUKDTY4O4YLKNI/graph.json","fetch_events":"https://pith.science/api/pith-number/YM77A5P3DLLJQUKDTY4O4YLKNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/action/storage_attestation","attest_author":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/action/author_attestation","sign_citation":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/action/citation_signature","submit_replication":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/action/replication_record"}},"created_at":"2026-05-17T23:42:35.429591+00:00","updated_at":"2026-05-17T23:42:35.429591+00:00"}