{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QDNYLW3VNR6BV4MQWA5H6FNEJR","short_pith_number":"pith:QDNYLW3V","canonical_record":{"source":{"id":"1802.03870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-12T03:23:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a2e85410f9c6e988a03f89dced5c3e05fd3a6981a7c9266e9e607db81d5e92c0","abstract_canon_sha256":"47437362afa220052196eb6f555cc30371c8047f24d503f04827bab4684eee1a"},"schema_version":"1.0"},"canonical_sha256":"80db85db756c7c1af190b03a7f15a44c60d6375aba87874ce3417734c115f90d","source":{"kind":"arxiv","id":"1802.03870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03870","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03870v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03870","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"QDNYLW3VNR6B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDNYLW3VNR6BV4MQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDNYLW3V","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QDNYLW3VNR6BV4MQWA5H6FNEJR","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-12T03:23:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"a2e85410f9c6e988a03f89dced5c3e05fd3a6981a7c9266e9e607db81d5e92c0","abstract_canon_sha256":"47437362afa220052196eb6f555cc30371c8047f24d503f04827bab4684eee1a"},"schema_version":"1.0"},"canonical_sha256":"80db85db756c7c1af190b03a7f15a44c60d6375aba87874ce3417734c115f90d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:50.175031Z","signature_b64":"PafAYdkOFh0ZfbCXkguMcjtE5YSfSM0dRS6R8YivSGex1gpe1PUDyiatFiTjZM4HhcBW2o+CYh2WH+MGTvl/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80db85db756c7c1af190b03a7f15a44c60d6375aba87874ce3417734c115f90d","last_reissued_at":"2026-05-18T00:23:50.174440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:50.174440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03870","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:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"teEUpbcYFqw5cmneFaULvuthBZ+KEynn8XjCPyi2OFXjKsyP/rcg0M2/8+kTQVlEtElR+Lusc9pE24ieNV3cDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:19:42.056737Z"},"content_sha256":"2d6e5c41fac560b8b86cc21a44cb10a9c6cd0a26b44cc8f58a87cfc41aa335c8","schema_version":"1.0","event_id":"sha256:2d6e5c41fac560b8b86cc21a44cb10a9c6cd0a26b44cc8f58a87cfc41aa335c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QDNYLW3VNR6BV4MQWA5H6FNEJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Combinatorial Design of 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":"Mingyue Ji, Nicholas Woolsey, Rong-Rong Chen","submitted_at":"2018-02-12T03:23:51Z","abstract_excerpt":"Coded distributed computing introduced by Li et al. in 2015 is an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. In particular, Li et al. show that increasing the computation load in the Map phase by a factor of $r$ can create coded multicasting opportunities to reduce the communication load in the Reduce phase by the same factor. However, there are two major limitations in practice. First, it requires an exponentially large number of input files (data batches) when the number of computing nodes gets l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03870","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:23:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WUJLtNI7yzdQHb7R1lThynNE46FywkA3vTvI7/nIdN+0km2cj0MEWc27HnwzwOb9p/kfShD5jPIxFs6HizORCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:19:42.057297Z"},"content_sha256":"1666abd366901f74d5288c2400439a3f76fe9cd0467bc83d8860eb4c5b3d9a73","schema_version":"1.0","event_id":"sha256:1666abd366901f74d5288c2400439a3f76fe9cd0467bc83d8860eb4c5b3d9a73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/bundle.json","state_url":"https://pith.science/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/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-08T03:19:42Z","links":{"resolver":"https://pith.science/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR","bundle":"https://pith.science/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/bundle.json","state":"https://pith.science/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDNYLW3VNR6BV4MQWA5H6FNEJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QDNYLW3VNR6BV4MQWA5H6FNEJR","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":"47437362afa220052196eb6f555cc30371c8047f24d503f04827bab4684eee1a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-12T03:23:51Z","title_canon_sha256":"a2e85410f9c6e988a03f89dced5c3e05fd3a6981a7c9266e9e607db81d5e92c0"},"schema_version":"1.0","source":{"id":"1802.03870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03870","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03870v1","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03870","created_at":"2026-05-18T00:23:50Z"},{"alias_kind":"pith_short_12","alias_value":"QDNYLW3VNR6B","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QDNYLW3VNR6BV4MQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QDNYLW3V","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:1666abd366901f74d5288c2400439a3f76fe9cd0467bc83d8860eb4c5b3d9a73","target":"graph","created_at":"2026-05-18T00:23:50Z","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 introduced by Li et al. in 2015 is an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. In particular, Li et al. show that increasing the computation load in the Map phase by a factor of $r$ can create coded multicasting opportunities to reduce the communication load in the Reduce phase by the same factor. However, there are two major limitations in practice. First, it requires an exponentially large number of input files (data batches) when the number of computing nodes gets l","authors_text":"Mingyue Ji, Nicholas Woolsey, Rong-Rong Chen","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-12T03:23:51Z","title":"A New Combinatorial Design of Coded Distributed Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03870","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:2d6e5c41fac560b8b86cc21a44cb10a9c6cd0a26b44cc8f58a87cfc41aa335c8","target":"record","created_at":"2026-05-18T00:23:50Z","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":"47437362afa220052196eb6f555cc30371c8047f24d503f04827bab4684eee1a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-12T03:23:51Z","title_canon_sha256":"a2e85410f9c6e988a03f89dced5c3e05fd3a6981a7c9266e9e607db81d5e92c0"},"schema_version":"1.0","source":{"id":"1802.03870","kind":"arxiv","version":1}},"canonical_sha256":"80db85db756c7c1af190b03a7f15a44c60d6375aba87874ce3417734c115f90d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80db85db756c7c1af190b03a7f15a44c60d6375aba87874ce3417734c115f90d","first_computed_at":"2026-05-18T00:23:50.174440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:50.174440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PafAYdkOFh0ZfbCXkguMcjtE5YSfSM0dRS6R8YivSGex1gpe1PUDyiatFiTjZM4HhcBW2o+CYh2WH+MGTvl/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:50.175031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d6e5c41fac560b8b86cc21a44cb10a9c6cd0a26b44cc8f58a87cfc41aa335c8","sha256:1666abd366901f74d5288c2400439a3f76fe9cd0467bc83d8860eb4c5b3d9a73"],"state_sha256":"67b0480c76768fc7276782cef3ce3be1d7bc64c31312db372daae4cb48ecef52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oF9cds+PDfUUwMQ4AV3/AdoYnMui+DdZzX9GZMkb0s2qzHx1N2KJ12cKpAAbS+TzM8BJh8f0Lpmk39q+nrY2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:19:42.060333Z","bundle_sha256":"68ce49159f5ba5ed352b78105819f7b0d348f8bbe7fae3465a6473cdc38a5a48"}}