{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XCVEB6KMARA223HJ536UEFR6IC","short_pith_number":"pith:XCVEB6KM","canonical_record":{"source":{"id":"1901.07670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T00:58:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"556e3ccf7c20fc662e77477684c2f358c0547ce8a694512e6b90bbfa8d5f66f6","abstract_canon_sha256":"b4932eff820e67573e276cd950aae3fe6703a0329a5eff38e2353f3875c82596"},"schema_version":"1.0"},"canonical_sha256":"b8aa40f94c0441ad6ce9eefd42163e40aa20aa1e367cfacd837b2e654f322a01","source":{"kind":"arxiv","id":"1901.07670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07670","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07670v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07670","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"XCVEB6KMARA2","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCVEB6KMARA223HJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCVEB6KM","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XCVEB6KMARA223HJ536UEFR6IC","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T00:58:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"556e3ccf7c20fc662e77477684c2f358c0547ce8a694512e6b90bbfa8d5f66f6","abstract_canon_sha256":"b4932eff820e67573e276cd950aae3fe6703a0329a5eff38e2353f3875c82596"},"schema_version":"1.0"},"canonical_sha256":"b8aa40f94c0441ad6ce9eefd42163e40aa20aa1e367cfacd837b2e654f322a01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:41.883952Z","signature_b64":"5JttI4/3c3CnjCqndvmMVM6Ftv7KnHXsKpPpSsQduqXgQMfUZoBGwIQ5P0FNVzLupIgG9umxGN6VJBHICl23Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8aa40f94c0441ad6ce9eefd42163e40aa20aa1e367cfacd837b2e654f322a01","last_reissued_at":"2026-05-17T23:55:41.883523Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:41.883523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07670","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:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhHOxfXVWIDNlo9DjgdgY+SwyUAn9QvxWC/9xWKGcL/jkcQU5X705znCoy+8EKChBa7Cdr2foUOo/XwqmQ70AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:42:24.510818Z"},"content_sha256":"4efdecfbd6bf74677e6113eabd41979a63e4eb9c5ccea48abfb2e6c12a5571b5","schema_version":"1.0","event_id":"sha256:4efdecfbd6bf74677e6113eabd41979a63e4eb9c5ccea48abfb2e6c12a5571b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XCVEB6KMARA223HJ536UEFR6IC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cascaded Coded Distributed Computing on Heterogeneous Networks","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-01-23T00:58:02Z","abstract_excerpt":"Coded distributed computing (CDC) introduced by Li et al. in 2015 offers an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. For the more general cascaded CDC, Map computations are repeated at $r$ nodes to significantly reduce the communication load among nodes tasked with computing $Q$ Reduce functions $s$ times. While an achievable cascaded CDC scheme was proposed, it only operates on homogeneous networks, where the storage, computation load and communication load of each computing node is the same. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07670","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:55:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyzZ4CYLUuP13aKWdgG922jBqVcJD0eKaGoGtQ+Yau8XQrE/PcYU899CNe9LZUxnZ0K2zNIA8cGje+qwEPgNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:42:24.511536Z"},"content_sha256":"78fb1033a86f83f0f849b2b827cf0a92855b7a69202b316d2921984611ba55b5","schema_version":"1.0","event_id":"sha256:78fb1033a86f83f0f849b2b827cf0a92855b7a69202b316d2921984611ba55b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCVEB6KMARA223HJ536UEFR6IC/bundle.json","state_url":"https://pith.science/pith/XCVEB6KMARA223HJ536UEFR6IC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCVEB6KMARA223HJ536UEFR6IC/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-07T20:42:24Z","links":{"resolver":"https://pith.science/pith/XCVEB6KMARA223HJ536UEFR6IC","bundle":"https://pith.science/pith/XCVEB6KMARA223HJ536UEFR6IC/bundle.json","state":"https://pith.science/pith/XCVEB6KMARA223HJ536UEFR6IC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCVEB6KMARA223HJ536UEFR6IC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XCVEB6KMARA223HJ536UEFR6IC","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":"b4932eff820e67573e276cd950aae3fe6703a0329a5eff38e2353f3875c82596","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T00:58:02Z","title_canon_sha256":"556e3ccf7c20fc662e77477684c2f358c0547ce8a694512e6b90bbfa8d5f66f6"},"schema_version":"1.0","source":{"id":"1901.07670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07670","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07670v1","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07670","created_at":"2026-05-17T23:55:41Z"},{"alias_kind":"pith_short_12","alias_value":"XCVEB6KMARA2","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XCVEB6KMARA223HJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XCVEB6KM","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:78fb1033a86f83f0f849b2b827cf0a92855b7a69202b316d2921984611ba55b5","target":"graph","created_at":"2026-05-17T23:55:41Z","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. in 2015 offers an efficient approach to trade computing power to reduce the communication load in general distributed computing frameworks such as MapReduce. For the more general cascaded CDC, Map computations are repeated at $r$ nodes to significantly reduce the communication load among nodes tasked with computing $Q$ Reduce functions $s$ times. While an achievable cascaded CDC scheme was proposed, it only operates on homogeneous networks, where the storage, computation load and communication load of each computing node is the same. In","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-01-23T00:58:02Z","title":"Cascaded Coded Distributed Computing on Heterogeneous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07670","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:4efdecfbd6bf74677e6113eabd41979a63e4eb9c5ccea48abfb2e6c12a5571b5","target":"record","created_at":"2026-05-17T23:55:41Z","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":"b4932eff820e67573e276cd950aae3fe6703a0329a5eff38e2353f3875c82596","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-23T00:58:02Z","title_canon_sha256":"556e3ccf7c20fc662e77477684c2f358c0547ce8a694512e6b90bbfa8d5f66f6"},"schema_version":"1.0","source":{"id":"1901.07670","kind":"arxiv","version":1}},"canonical_sha256":"b8aa40f94c0441ad6ce9eefd42163e40aa20aa1e367cfacd837b2e654f322a01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8aa40f94c0441ad6ce9eefd42163e40aa20aa1e367cfacd837b2e654f322a01","first_computed_at":"2026-05-17T23:55:41.883523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:41.883523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5JttI4/3c3CnjCqndvmMVM6Ftv7KnHXsKpPpSsQduqXgQMfUZoBGwIQ5P0FNVzLupIgG9umxGN6VJBHICl23Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:41.883952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4efdecfbd6bf74677e6113eabd41979a63e4eb9c5ccea48abfb2e6c12a5571b5","sha256:78fb1033a86f83f0f849b2b827cf0a92855b7a69202b316d2921984611ba55b5"],"state_sha256":"9a155eb10a9a02d23457e791989511aaf67d6886e526fc157a6112dee998d3ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//3x1jfUiE/HDkulh0WRqC4MrmPwc8Kz19E84Ofy5KrNy+ZSByASABg4eNjmqaVWWvHFA3W6v8y5RsLLmy9jCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:42:24.515430Z","bundle_sha256":"e9e7f832d6fc48c73de457cee1ee1eb131f284eaa9fa49407575fdba410a4ce8"}}