{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EGWJEHWMBI4VJLNVKZYLDOEQQ6","short_pith_number":"pith:EGWJEHWM","canonical_record":{"source":{"id":"1902.10738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-27T19:17:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3b25328360bc0aec9cfe2cfa1eff0947de5934d4432d911cc140b1574ba01f5","abstract_canon_sha256":"4fe23b4c1e84ad28688c28258c122eed4c18cd623137e9e64c0408d3eb34faf2"},"schema_version":"1.0"},"canonical_sha256":"21ac921ecc0a3954adb55670b1b89087814d4273bce2213801204a62126d1cb6","source":{"kind":"arxiv","id":"1902.10738","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10738","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10738v2","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10738","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"EGWJEHWMBI4V","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EGWJEHWMBI4VJLNV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EGWJEHWM","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EGWJEHWMBI4VJLNVKZYLDOEQQ6","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-27T19:17:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f3b25328360bc0aec9cfe2cfa1eff0947de5934d4432d911cc140b1574ba01f5","abstract_canon_sha256":"4fe23b4c1e84ad28688c28258c122eed4c18cd623137e9e64c0408d3eb34faf2"},"schema_version":"1.0"},"canonical_sha256":"21ac921ecc0a3954adb55670b1b89087814d4273bce2213801204a62126d1cb6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:21.271740Z","signature_b64":"MKcdq8FXJyDDm3O3c/0Gdfmf2uK5L1Hvjx2M+jt1gOggG5RHiLPOz+ND/Qurki1lVd6+QMtJwGetImXS1744Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21ac921ecc0a3954adb55670b1b89087814d4273bce2213801204a62126d1cb6","last_reissued_at":"2026-05-17T23:52:21.271077Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:21.271077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10738","source_version":2,"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:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+rm9jQDmw5B9YQJkMGAvPJ4le66qCkVQLEnjuQOz9RKflioeG9x8vk8z/xqMCjT3OEyTMk9Xq0WdKiAzIVCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:38:41.993026Z"},"content_sha256":"6607e3b816f81a4490fff318773f0be69a4007e933408ebbe92b80feca2d1007","schema_version":"1.0","event_id":"sha256:6607e3b816f81a4490fff318773f0be69a4007e933408ebbe92b80feca2d1007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EGWJEHWMBI4VJLNVKZYLDOEQQ6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Distributed Computing with Heterogeneous Function Assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mingyue Ji, Nicholas Woolsey, Rong-Rong Chen","submitted_at":"2019-02-27T19:17:34Z","abstract_excerpt":"Coded distributed computing (CDC) introduced by Li et. al. is an effective technique to trade computation load for communication load in a MapReduce framework. CDC achieves an optimal trade-off by duplicating map computations at $r$ computing nodes to yield multicasting opportunities such that $r$ nodes are served simultaneously in the Shuffle phase. However, in general, the state-of-the-art CDC scheme is mainly designed only for homogeneous networks, where the computing nodes are assumed to have the same storage, computation and communication capabilities. In this work, we explore two novel a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10738","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":""},"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:52:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdQt0IuWDZr3nPLmZxSX5ZRQyo9WyjWFeTh8nf+JUM4R9mnoVxMeQo60Lzl3BWTboCPKtBclHllPBDdRLNoACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:38:41.993778Z"},"content_sha256":"127f01427777703478f71be8b09bbee7e40419680ab8b574fea749b8451845fc","schema_version":"1.0","event_id":"sha256:127f01427777703478f71be8b09bbee7e40419680ab8b574fea749b8451845fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/bundle.json","state_url":"https://pith.science/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/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-07T17:38:41Z","links":{"resolver":"https://pith.science/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6","bundle":"https://pith.science/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/bundle.json","state":"https://pith.science/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EGWJEHWMBI4VJLNVKZYLDOEQQ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EGWJEHWMBI4VJLNVKZYLDOEQQ6","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":"4fe23b4c1e84ad28688c28258c122eed4c18cd623137e9e64c0408d3eb34faf2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-27T19:17:34Z","title_canon_sha256":"f3b25328360bc0aec9cfe2cfa1eff0947de5934d4432d911cc140b1574ba01f5"},"schema_version":"1.0","source":{"id":"1902.10738","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10738","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10738v2","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10738","created_at":"2026-05-17T23:52:21Z"},{"alias_kind":"pith_short_12","alias_value":"EGWJEHWMBI4V","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EGWJEHWMBI4VJLNV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EGWJEHWM","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:127f01427777703478f71be8b09bbee7e40419680ab8b574fea749b8451845fc","target":"graph","created_at":"2026-05-17T23:52:21Z","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":"Coded distributed computing (CDC) introduced by Li et. al. is an effective technique to trade computation load for communication load in a MapReduce framework. CDC achieves an optimal trade-off by duplicating map computations at $r$ computing nodes to yield multicasting opportunities such that $r$ nodes are served simultaneously in the Shuffle phase. However, in general, the state-of-the-art CDC scheme is mainly designed only for homogeneous networks, where the computing nodes are assumed to have the same storage, computation and communication capabilities. In this work, we explore two novel a","authors_text":"Mingyue Ji, Nicholas Woolsey, Rong-Rong Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-27T19:17:34Z","title":"Coded Distributed Computing with Heterogeneous Function Assignments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10738","kind":"arxiv","version":2},"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:6607e3b816f81a4490fff318773f0be69a4007e933408ebbe92b80feca2d1007","target":"record","created_at":"2026-05-17T23:52:21Z","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":"4fe23b4c1e84ad28688c28258c122eed4c18cd623137e9e64c0408d3eb34faf2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-02-27T19:17:34Z","title_canon_sha256":"f3b25328360bc0aec9cfe2cfa1eff0947de5934d4432d911cc140b1574ba01f5"},"schema_version":"1.0","source":{"id":"1902.10738","kind":"arxiv","version":2}},"canonical_sha256":"21ac921ecc0a3954adb55670b1b89087814d4273bce2213801204a62126d1cb6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21ac921ecc0a3954adb55670b1b89087814d4273bce2213801204a62126d1cb6","first_computed_at":"2026-05-17T23:52:21.271077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:21.271077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKcdq8FXJyDDm3O3c/0Gdfmf2uK5L1Hvjx2M+jt1gOggG5RHiLPOz+ND/Qurki1lVd6+QMtJwGetImXS1744Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:21.271740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10738","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6607e3b816f81a4490fff318773f0be69a4007e933408ebbe92b80feca2d1007","sha256:127f01427777703478f71be8b09bbee7e40419680ab8b574fea749b8451845fc"],"state_sha256":"b2ec6acf626f0a8bbaf8ddc112aa36fa1a3331f833d457105ef7ad40b02e872a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cp2Yo+Kz4gtwOvffeGCnYh8d8npSBzv6SsRvbzwT24kLubzJFeRieC6/gsVeM9Avpasy1nGRmTydkGB+Z9PwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:38:41.997883Z","bundle_sha256":"78473b562303a0af9dabc15af7383512892cf3e86bbe6192d63ca298b08560ad"}}