{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PELDTRCWLZSFFGJ6FPBQ3PVVXU","short_pith_number":"pith:PELDTRCW","canonical_record":{"source":{"id":"1908.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T11:55:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc7357b666694c08d86b95755e38e966fbfa6edee2f1861afbe20e1dd1c9e413","abstract_canon_sha256":"add2591cb34b73b06850d305138e3a76b2bbac423bf635444ee19406f9589215"},"schema_version":"1.0"},"canonical_sha256":"791639c4565e6452993e2bc30dbeb5bd3ef3a0c4e7faf076c0ccfb05d1ed21a3","source":{"kind":"arxiv","id":"1908.06715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06715","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06715v1","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06715","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"PELDTRCWLZSF","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"PELDTRCWLZSFFGJ6","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"PELDTRCW","created_at":"2026-07-04T23:58:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PELDTRCWLZSFFGJ6FPBQ3PVVXU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T11:55:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bc7357b666694c08d86b95755e38e966fbfa6edee2f1861afbe20e1dd1c9e413","abstract_canon_sha256":"add2591cb34b73b06850d305138e3a76b2bbac423bf635444ee19406f9589215"},"schema_version":"1.0"},"canonical_sha256":"791639c4565e6452993e2bc30dbeb5bd3ef3a0c4e7faf076c0ccfb05d1ed21a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:18.780781Z","signature_b64":"W1lCPdL2ZygIwlGa/ZnTC1juI6MTqOk2Ggb6mz8bXETrXAZARa+oXicVHVySac7xQChnkUzyakclLXh+nBuZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"791639c4565e6452993e2bc30dbeb5bd3ef3a0c4e7faf076c0ccfb05d1ed21a3","last_reissued_at":"2026-07-04T23:58:18.780400Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:18.780400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06715","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-07-04T23:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6jahqqAZNvJzyBa2uDAOWJSQK48i1EZdSw7D844ed/eortbQeXwVEwniKQDBftAci4C/KcvP3o+r0QMrxj3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:37:20.743387Z"},"content_sha256":"ac1f206026023e806eeb8551cbe5e06d291c3117417449b3dfae2621698270f1","schema_version":"1.0","event_id":"sha256:ac1f206026023e806eeb8551cbe5e06d291c3117417449b3dfae2621698270f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PELDTRCWLZSFFGJ6FPBQ3PVVXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heterogeneous Coded Distributed Computing: Joint Design of File Allocation and Function Assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Xu, Meixia Tao","submitted_at":"2019-08-19T11:55:00Z","abstract_excerpt":"This paper studies the computation-communication tradeoff in a heterogeneous MapReduce computing system where each distributed node is equipped with different computation capability. We first obtain an achievable communication load for any given computation load and any given function assignment at each node. The proposed file allocation strategy has two steps: first, the input files are partitioned into disjoint batches, each with possibly different size and computed by a distinct node; then, each node computes additional files from its non-computed files according to its redundant computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06715/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T23:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wUu9DxQO0H3ci1qwNpveovzN28KcinKQZxypwpnuLHbARUrYrDwhVCpBwcJgL+a0qF4nM06Fn7BIedQDTJ+pCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T09:37:20.743900Z"},"content_sha256":"014f7b0041589584f9ca67ddfc9fff25eaf55eb7154424e6c021ce1eac6455fc","schema_version":"1.0","event_id":"sha256:014f7b0041589584f9ca67ddfc9fff25eaf55eb7154424e6c021ce1eac6455fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/bundle.json","state_url":"https://pith.science/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/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-08-16T09:37:20Z","links":{"resolver":"https://pith.science/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU","bundle":"https://pith.science/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/bundle.json","state":"https://pith.science/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PELDTRCWLZSFFGJ6FPBQ3PVVXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PELDTRCWLZSFFGJ6FPBQ3PVVXU","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":"add2591cb34b73b06850d305138e3a76b2bbac423bf635444ee19406f9589215","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T11:55:00Z","title_canon_sha256":"bc7357b666694c08d86b95755e38e966fbfa6edee2f1861afbe20e1dd1c9e413"},"schema_version":"1.0","source":{"id":"1908.06715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06715","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06715v1","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06715","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"PELDTRCWLZSF","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"PELDTRCWLZSFFGJ6","created_at":"2026-07-04T23:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"PELDTRCW","created_at":"2026-07-04T23:58:18Z"}],"graph_snapshots":[{"event_id":"sha256:014f7b0041589584f9ca67ddfc9fff25eaf55eb7154424e6c021ce1eac6455fc","target":"graph","created_at":"2026-07-04T23:58:18Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.06715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies the computation-communication tradeoff in a heterogeneous MapReduce computing system where each distributed node is equipped with different computation capability. We first obtain an achievable communication load for any given computation load and any given function assignment at each node. The proposed file allocation strategy has two steps: first, the input files are partitioned into disjoint batches, each with possibly different size and computed by a distinct node; then, each node computes additional files from its non-computed files according to its redundant computatio","authors_text":"Fan Xu, Meixia Tao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T11:55:00Z","title":"Heterogeneous Coded Distributed Computing: Joint Design of File Allocation and Function Assignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06715","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:ac1f206026023e806eeb8551cbe5e06d291c3117417449b3dfae2621698270f1","target":"record","created_at":"2026-07-04T23:58:18Z","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":"add2591cb34b73b06850d305138e3a76b2bbac423bf635444ee19406f9589215","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-19T11:55:00Z","title_canon_sha256":"bc7357b666694c08d86b95755e38e966fbfa6edee2f1861afbe20e1dd1c9e413"},"schema_version":"1.0","source":{"id":"1908.06715","kind":"arxiv","version":1}},"canonical_sha256":"791639c4565e6452993e2bc30dbeb5bd3ef3a0c4e7faf076c0ccfb05d1ed21a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"791639c4565e6452993e2bc30dbeb5bd3ef3a0c4e7faf076c0ccfb05d1ed21a3","first_computed_at":"2026-07-04T23:58:18.780400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:18.780400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W1lCPdL2ZygIwlGa/ZnTC1juI6MTqOk2Ggb6mz8bXETrXAZARa+oXicVHVySac7xQChnkUzyakclLXh+nBuZAw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:18.780781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac1f206026023e806eeb8551cbe5e06d291c3117417449b3dfae2621698270f1","sha256:014f7b0041589584f9ca67ddfc9fff25eaf55eb7154424e6c021ce1eac6455fc"],"state_sha256":"38d7c86117522eba59fec10eec7ea6d8dfce73263db5db3644ea7320210ddbb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qTtCaxdcd1+TpY8y/1HhPltzNs35WEHyJkK3yY3wXX6z026VcF0+dagEWUQVMm5oCdy9CG/wcZKnTl8ih67BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T09:37:20.747808Z","bundle_sha256":"ebe81eea6412af76fe181d822a4cd117720af7f3649a79683ad9caf986d043c2"}}