{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UT2TTB7PMJDAVUDCFJCJ2QYEVV","short_pith_number":"pith:UT2TTB7P","canonical_record":{"source":{"id":"1808.06583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T17:44:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"182dd4c566770d1cc7915a0b7f224e063c1e8cf889c5746ed5c35a47df517a4d","abstract_canon_sha256":"855797906f398b2d91aee524176d55d78a17e47b064d8607f9cabb01231ab07c"},"schema_version":"1.0"},"canonical_sha256":"a4f53987ef62460ad0622a449d4304ad7261063fd4d1331ddbc03fe31187115a","source":{"kind":"arxiv","id":"1808.06583","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06583","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06583v2","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06583","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"UT2TTB7PMJDA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UT2TTB7PMJDAVUDC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UT2TTB7P","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UT2TTB7PMJDAVUDCFJCJ2QYEVV","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T17:44:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"182dd4c566770d1cc7915a0b7f224e063c1e8cf889c5746ed5c35a47df517a4d","abstract_canon_sha256":"855797906f398b2d91aee524176d55d78a17e47b064d8607f9cabb01231ab07c"},"schema_version":"1.0"},"canonical_sha256":"a4f53987ef62460ad0622a449d4304ad7261063fd4d1331ddbc03fe31187115a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:39.585133Z","signature_b64":"QBbbh8OJ0DJBY3OvVdJ4J7yDUNdlmBv3nFyEbb3Pz4Rr9NDFOecbIutgLoFlN52tvBGNjcLQM4pNwk0esPHMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4f53987ef62460ad0622a449d4304ad7261063fd4d1331ddbc03fe31187115a","last_reissued_at":"2026-05-18T00:07:39.584495Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:39.584495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06583","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-18T00:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTr8U+G9uRu0IlF68OXtD1m3vQNHDKipPRVeZ9MeEZsCuaZyzbJTM/b91AcOkPanCx2UgMdDf9Ef07x0GUsVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:06.941443Z"},"content_sha256":"c7a170e016ec040c5e6b9e7cfdd2e1db245151244522ea70d985a3d1085b79c9","schema_version":"1.0","event_id":"sha256:c7a170e016ec040c5e6b9e7cfdd2e1db245151244522ea70d985a3d1085b79c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UT2TTB7PMJDAVUDCFJCJ2QYEVV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Latency-Communication Trade-Off for Map-Shuffle-Reduce Systems with Stragglers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingjing Zhang, Osvaldo Simeone","submitted_at":"2018-08-20T17:44:43Z","abstract_excerpt":"In a distributed computing system operating according to the map-shuffle-reduce framework, coding data prior to storage can be useful both to reduce the latency caused by straggling servers and to decrease the inter-server communication load in the shuffling phase. In prior work, a concatenated coding scheme was proposed for a matrix multiplication task. In this scheme, the outer Maximum Distance Separable (MDS) code is leveraged to correct erasures caused by stragglers, while the inner repetition code is used to improve the communication efficiency in the shuffling phase by means of coded mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06583","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-18T00:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvMTnRzqC1i8ksecfNgbnwA10Q8X2inmCAx7VJtmbJKe8LG6NBE9UmIws5reQgSV6bOy+JnRryR6C67Slpc9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:19:06.942110Z"},"content_sha256":"110930f47cb5c3dad47c6a24f459969b0c8a95848621ee31f7bb7acbd50701c5","schema_version":"1.0","event_id":"sha256:110930f47cb5c3dad47c6a24f459969b0c8a95848621ee31f7bb7acbd50701c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/bundle.json","state_url":"https://pith.science/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/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-05-26T15:19:06Z","links":{"resolver":"https://pith.science/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV","bundle":"https://pith.science/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/bundle.json","state":"https://pith.science/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UT2TTB7PMJDAVUDCFJCJ2QYEVV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UT2TTB7PMJDAVUDCFJCJ2QYEVV","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":"855797906f398b2d91aee524176d55d78a17e47b064d8607f9cabb01231ab07c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T17:44:43Z","title_canon_sha256":"182dd4c566770d1cc7915a0b7f224e063c1e8cf889c5746ed5c35a47df517a4d"},"schema_version":"1.0","source":{"id":"1808.06583","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06583","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06583v2","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06583","created_at":"2026-05-18T00:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"UT2TTB7PMJDA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UT2TTB7PMJDAVUDC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UT2TTB7P","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:110930f47cb5c3dad47c6a24f459969b0c8a95848621ee31f7bb7acbd50701c5","target":"graph","created_at":"2026-05-18T00:07:39Z","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":"In a distributed computing system operating according to the map-shuffle-reduce framework, coding data prior to storage can be useful both to reduce the latency caused by straggling servers and to decrease the inter-server communication load in the shuffling phase. In prior work, a concatenated coding scheme was proposed for a matrix multiplication task. In this scheme, the outer Maximum Distance Separable (MDS) code is leveraged to correct erasures caused by stragglers, while the inner repetition code is used to improve the communication efficiency in the shuffling phase by means of coded mul","authors_text":"Jingjing Zhang, Osvaldo Simeone","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T17:44:43Z","title":"Improved Latency-Communication Trade-Off for Map-Shuffle-Reduce Systems with Stragglers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06583","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:c7a170e016ec040c5e6b9e7cfdd2e1db245151244522ea70d985a3d1085b79c9","target":"record","created_at":"2026-05-18T00:07:39Z","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":"855797906f398b2d91aee524176d55d78a17e47b064d8607f9cabb01231ab07c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-20T17:44:43Z","title_canon_sha256":"182dd4c566770d1cc7915a0b7f224e063c1e8cf889c5746ed5c35a47df517a4d"},"schema_version":"1.0","source":{"id":"1808.06583","kind":"arxiv","version":2}},"canonical_sha256":"a4f53987ef62460ad0622a449d4304ad7261063fd4d1331ddbc03fe31187115a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4f53987ef62460ad0622a449d4304ad7261063fd4d1331ddbc03fe31187115a","first_computed_at":"2026-05-18T00:07:39.584495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:39.584495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QBbbh8OJ0DJBY3OvVdJ4J7yDUNdlmBv3nFyEbb3Pz4Rr9NDFOecbIutgLoFlN52tvBGNjcLQM4pNwk0esPHMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:39.585133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06583","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7a170e016ec040c5e6b9e7cfdd2e1db245151244522ea70d985a3d1085b79c9","sha256:110930f47cb5c3dad47c6a24f459969b0c8a95848621ee31f7bb7acbd50701c5"],"state_sha256":"139fb18976a63ff8775ebd854729be043d7ff1d502032757c2da27b40ea96508"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OkiffTYUfER3qYRizzBzRyhH+M2TgFeC+3F2B11s17bX9kYdM+YHCvn4Atatq4VmZPCDdTALfFHlBKirfkaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:19:06.945629Z","bundle_sha256":"d074f963bf4c30412e55044f940b4c94fca87aac060dce3465062c7e4a77bdf4"}}