{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F4ET7NJA3KCNHQZXDPZTV5BWKN","short_pith_number":"pith:F4ET7NJA","canonical_record":{"source":{"id":"1709.00196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:26:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d698088fad24c17098d7ab5e0a988f675a435b9f50d6d5c3944fd72f94da77cb","abstract_canon_sha256":"b76114427ab13c6d3a9f9a1523afe21ced03bfa14c2bde7590d03b874c383652"},"schema_version":"1.0"},"canonical_sha256":"2f093fb520da84d3c3371bf33af4365344407e392870be8616a96b8b93c03e7a","source":{"kind":"arxiv","id":"1709.00196","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00196","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00196v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00196","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"F4ET7NJA3KCN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4ET7NJA3KCNHQZX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4ET7NJA","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F4ET7NJA3KCNHQZXDPZTV5BWKN","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:26:41Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d698088fad24c17098d7ab5e0a988f675a435b9f50d6d5c3944fd72f94da77cb","abstract_canon_sha256":"b76114427ab13c6d3a9f9a1523afe21ced03bfa14c2bde7590d03b874c383652"},"schema_version":"1.0"},"canonical_sha256":"2f093fb520da84d3c3371bf33af4365344407e392870be8616a96b8b93c03e7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.114708Z","signature_b64":"WvHWI8X7WS5kl0dHasU0WuNaj8O+Q191qohZZNCWwFn5kDH2fhHta4u8FLgbAQeJd1sXjvH6LdyKQGbJKv3lBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f093fb520da84d3c3371bf33af4365344407e392870be8616a96b8b93c03e7a","last_reissued_at":"2026-05-18T00:36:13.113955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.113955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00196","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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSboxiPRPNBzzqet1yio5ei/9obqjmmMITZ1FpSQCCvp/hYBEbfohyV8I4IJkz9/iEBYK9HgQdfbjB4rJfcQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:32:42.575454Z"},"content_sha256":"848a156f48a833e61f03bf974e6653d6983c0c38dec1b1e47713719518227f93","schema_version":"1.0","event_id":"sha256:848a156f48a833e61f03bf974e6653d6983c0c38dec1b1e47713719518227f93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F4ET7NJA3KCNHQZXDPZTV5BWKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Heterogeneous Coded Distributed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"A. Salman Avestimehr, Chenwei Wang, Mehrdad Kiamari","submitted_at":"2017-09-01T08:26:41Z","abstract_excerpt":"We consider the recently proposed Coded Distributed Computing (CDC) framework that leverages carefully designed redundant computations to enable coding opportunities that substantially reduce the communication load of distributed computing. We generalize this framework to heterogeneous systems where different nodes in the computing cluster can have different storage (or processing) capabilities. We provide the information-theoretically optimal data set placement and coded data shuffling scheme that minimizes the communication load in a cluster with 3 nodes. For clusters with $K>3$ nodes, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00196","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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwZu/LrG14NVVhXdLcmVSJmPfcsFkjK9AUvzsSaUz7tIz+UkVrckNQWlxRbKzHW7qkVXGIygLKzDAlknxOO6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:32:42.575803Z"},"content_sha256":"41d7e7dbe5dbf67b50d99b6bcd412347afd1f35040ed9e3d4315bbed17296063","schema_version":"1.0","event_id":"sha256:41d7e7dbe5dbf67b50d99b6bcd412347afd1f35040ed9e3d4315bbed17296063"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/bundle.json","state_url":"https://pith.science/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/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-06-20T06:32:42Z","links":{"resolver":"https://pith.science/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN","bundle":"https://pith.science/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/bundle.json","state":"https://pith.science/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4ET7NJA3KCNHQZXDPZTV5BWKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F4ET7NJA3KCNHQZXDPZTV5BWKN","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":"b76114427ab13c6d3a9f9a1523afe21ced03bfa14c2bde7590d03b874c383652","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:26:41Z","title_canon_sha256":"d698088fad24c17098d7ab5e0a988f675a435b9f50d6d5c3944fd72f94da77cb"},"schema_version":"1.0","source":{"id":"1709.00196","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00196","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00196v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00196","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"F4ET7NJA3KCN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"F4ET7NJA3KCNHQZX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"F4ET7NJA","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:41d7e7dbe5dbf67b50d99b6bcd412347afd1f35040ed9e3d4315bbed17296063","target":"graph","created_at":"2026-05-18T00:36:13Z","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 recently proposed Coded Distributed Computing (CDC) framework that leverages carefully designed redundant computations to enable coding opportunities that substantially reduce the communication load of distributed computing. We generalize this framework to heterogeneous systems where different nodes in the computing cluster can have different storage (or processing) capabilities. We provide the information-theoretically optimal data set placement and coded data shuffling scheme that minimizes the communication load in a cluster with 3 nodes. For clusters with $K>3$ nodes, we pr","authors_text":"A. Salman Avestimehr, Chenwei Wang, Mehrdad Kiamari","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:26:41Z","title":"On Heterogeneous Coded Distributed Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00196","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:848a156f48a833e61f03bf974e6653d6983c0c38dec1b1e47713719518227f93","target":"record","created_at":"2026-05-18T00:36:13Z","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":"b76114427ab13c6d3a9f9a1523afe21ced03bfa14c2bde7590d03b874c383652","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-01T08:26:41Z","title_canon_sha256":"d698088fad24c17098d7ab5e0a988f675a435b9f50d6d5c3944fd72f94da77cb"},"schema_version":"1.0","source":{"id":"1709.00196","kind":"arxiv","version":1}},"canonical_sha256":"2f093fb520da84d3c3371bf33af4365344407e392870be8616a96b8b93c03e7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f093fb520da84d3c3371bf33af4365344407e392870be8616a96b8b93c03e7a","first_computed_at":"2026-05-18T00:36:13.113955Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.113955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvHWI8X7WS5kl0dHasU0WuNaj8O+Q191qohZZNCWwFn5kDH2fhHta4u8FLgbAQeJd1sXjvH6LdyKQGbJKv3lBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.114708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00196","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848a156f48a833e61f03bf974e6653d6983c0c38dec1b1e47713719518227f93","sha256:41d7e7dbe5dbf67b50d99b6bcd412347afd1f35040ed9e3d4315bbed17296063"],"state_sha256":"eca8f7d2acb823004c5c87bf4e9d6ec230813001b53fc35258534df5c6bfa4f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJTK0dcJ9+pwkySU+dGni6IjjOAYOUf7xAQ7YM2NBdV6Z5Uh0c9c1wHB2HqOg6g337lvignyuNXL13aZst3UDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:32:42.577755Z","bundle_sha256":"e346f7e8140610ca4f0e3ee6c0f4408c7b9647c468542e2bfac0d4e61ddce842"}}