{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YM77A5P3DLLJQUKDTY4O4YLKNI","short_pith_number":"pith:YM77A5P3","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"},"canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","source":{"kind":"arxiv","id":"1906.10105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10105","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10105v1","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10105","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"YM77A5P3DLLJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YM77A5P3DLLJQUKD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YM77A5P3","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YM77A5P3DLLJQUKDTY4O4YLKNI","target":"record","payload":{"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"},"canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","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"},"source_kind":"arxiv","source_id":"1906.10105","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-05-17T23:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbuFgwnoMb4ugaJfNYedsQBn+ZMkOSmHlHTbyr1hwqQ5OG20bEyoUIoK8pLX+JocEgNjOOhyHv/dQUCMB0vZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:00.454620Z"},"content_sha256":"ac9c69833baa4b6210ce7f10941f7c73a851584f445e76dade56d0eab7acf1a1","schema_version":"1.0","event_id":"sha256:ac9c69833baa4b6210ce7f10941f7c73a851584f445e76dade56d0eab7acf1a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YM77A5P3DLLJQUKDTY4O4YLKNI","target":"graph","payload":{"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"},"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-05-17T23:42:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itPlZ+UJfKAniK4KKHPINH1RBaiu3GmDIUWYeoPVEIvzdZT6gm4d2rrpdUvxIYD+xqMiNIqZqLT8nRbnK4/cCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:32:00.454965Z"},"content_sha256":"f8ead3c6e50d58e92cdabeab4fb290494a356e9379f3f36e22114334c0cb409c","schema_version":"1.0","event_id":"sha256:f8ead3c6e50d58e92cdabeab4fb290494a356e9379f3f36e22114334c0cb409c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/bundle.json","state_url":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/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-05-28T02:32:00Z","links":{"resolver":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI","bundle":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/bundle.json","state":"https://pith.science/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YM77A5P3DLLJQUKDTY4O4YLKNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YM77A5P3DLLJQUKDTY4O4YLKNI","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":"729452a9cbd09c6d753545395f373b3a7e656196b820c50b5e9b5ab2789e5d26","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-24T17:45:14Z","title_canon_sha256":"0e632dc4e5cb14d1d9619aed09c162492eeaa822996e7abf9bbe228860f1bebb"},"schema_version":"1.0","source":{"id":"1906.10105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10105","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10105v1","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10105","created_at":"2026-05-17T23:42:35Z"},{"alias_kind":"pith_short_12","alias_value":"YM77A5P3DLLJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YM77A5P3DLLJQUKD","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YM77A5P3","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:f8ead3c6e50d58e92cdabeab4fb290494a356e9379f3f36e22114334c0cb409c","target":"graph","created_at":"2026-05-17T23:42:35Z","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"},"paper":{"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","authors_text":"Hessam Mahdavifar, Mahdi Soleymani, Mohammad Vahid Jamali","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-24T17:45:14Z","title":"Coded Distributed Computing: Performance Limits and Code Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10105","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:ac9c69833baa4b6210ce7f10941f7c73a851584f445e76dade56d0eab7acf1a1","target":"record","created_at":"2026-05-17T23:42:35Z","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":"729452a9cbd09c6d753545395f373b3a7e656196b820c50b5e9b5ab2789e5d26","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-24T17:45:14Z","title_canon_sha256":"0e632dc4e5cb14d1d9619aed09c162492eeaa822996e7abf9bbe228860f1bebb"},"schema_version":"1.0","source":{"id":"1906.10105","kind":"arxiv","version":1}},"canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c33ff075fb1ad69851439e38ee616a6a3aaed68fbfd1ceed0865c5bd89b7d6f9","first_computed_at":"2026-05-17T23:42:35.429488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:35.429488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivWB8DLKhAg3LoHl0sZrWP9AeAmixps3M5FNgueK3AMesIX2Z9qmB/vGb3IHw8Hj+qzeFFlMOxDI/ikwKWSxAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:35.430123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac9c69833baa4b6210ce7f10941f7c73a851584f445e76dade56d0eab7acf1a1","sha256:f8ead3c6e50d58e92cdabeab4fb290494a356e9379f3f36e22114334c0cb409c"],"state_sha256":"118eb53c5954fc74ed322a294f9d49b0b42fd781bc052a6aeee2b3140f464746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXgSCbnCz3jJ4c5VkbUFjJa2SuD+3xBtJ12te5MDF0S789PVxQl368GXLyqGppS4GatIgfTW/ULMFkMTmjaDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:32:00.457048Z","bundle_sha256":"19b760d95da6d715acaa4c19effa43b584555d64c6362133509ff6980331a0bd"}}