{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DO7OZDELKLGIMHF6YDDT5RSLQ4","short_pith_number":"pith:DO7OZDEL","canonical_record":{"source":{"id":"1712.08230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T22:02:25Z","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"title_canon_sha256":"32863809559bdb390929d92513c7b515acc21f246462fe9af982a21602fceceb","abstract_canon_sha256":"167ecfcf3f7f7cfc59fee4c4bbc963b618b5523f6b192c5d65d4082145668bf8"},"schema_version":"1.0"},"canonical_sha256":"1bbeec8c8b52cc861cbec0c73ec64b872f605f782333bcff633e5af68af463b5","source":{"kind":"arxiv","id":"1712.08230","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08230","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08230v3","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08230","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"DO7OZDELKLGI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DO7OZDELKLGIMHF6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DO7OZDEL","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DO7OZDELKLGIMHF6YDDT5RSLQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08230","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T22:02:25Z","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"title_canon_sha256":"32863809559bdb390929d92513c7b515acc21f246462fe9af982a21602fceceb","abstract_canon_sha256":"167ecfcf3f7f7cfc59fee4c4bbc963b618b5523f6b192c5d65d4082145668bf8"},"schema_version":"1.0"},"canonical_sha256":"1bbeec8c8b52cc861cbec0c73ec64b872f605f782333bcff633e5af68af463b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.661687Z","signature_b64":"utMf4Olq+FyM5Zc1nAfFe/OqHdI/yV+NE3rPDPBBS7jR6E44YyUYrRHbqaMba2ljjDMzisWxgEztTfpgwN9LDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bbeec8c8b52cc861cbec0c73ec64b872f605f782333bcff633e5af68af463b5","last_reissued_at":"2026-05-18T00:02:49.660960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.660960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08230","source_version":3,"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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETkp2ka5Q04W31paCgYx4zU2G9Ia/TKnY/P4v01qpNFTz3xcBzXc0VIGxl5wAF4ugU6N2rnQkQqWICLYjtt9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:12.545011Z"},"content_sha256":"97583275c875967f6a4ebdb75a74686dbd2f0a4911dc1f07dcad50ada9cb2222","schema_version":"1.0","event_id":"sha256:97583275c875967f6a4ebdb75a74686dbd2f0a4911dc1f07dcad50ada9cb2222"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DO7OZDELKLGIMHF6YDDT5RSLQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.PF","math.IT"],"primary_cat":"cs.IT","authors_text":"Albin Severinson, Alexandre Graell i Amat, Eirik Rosnes","submitted_at":"2017-12-21T22:02:25Z","abstract_excerpt":"We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to each submatrix. For this scheme, we prove that up to a given number of partitions the communication load and the computational delay (not including the encoding and decoding delay) are identical to those of the scheme recently proposed by Li et al., based on a single, long MDS code. However, due to the use of shorter MDS codes, our scheme yields a significantly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08230","kind":"arxiv","version":3},"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:02:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9tYOYMGM369gyjP/rUtX9tMuwQGDwyFitIwnHe0Y5auSQ4yxo4r91tQ7LQx5wkSyab5i1VnrRthWE711UJPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:12.545368Z"},"content_sha256":"9ad64f700aeea0e68ab5009cce1bbf8a12939cedc7a0f04433d311a88a3a2fe0","schema_version":"1.0","event_id":"sha256:9ad64f700aeea0e68ab5009cce1bbf8a12939cedc7a0f04433d311a88a3a2fe0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/bundle.json","state_url":"https://pith.science/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/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-28T07:36:12Z","links":{"resolver":"https://pith.science/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4","bundle":"https://pith.science/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/bundle.json","state":"https://pith.science/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO7OZDELKLGIMHF6YDDT5RSLQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DO7OZDELKLGIMHF6YDDT5RSLQ4","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":"167ecfcf3f7f7cfc59fee4c4bbc963b618b5523f6b192c5d65d4082145668bf8","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T22:02:25Z","title_canon_sha256":"32863809559bdb390929d92513c7b515acc21f246462fe9af982a21602fceceb"},"schema_version":"1.0","source":{"id":"1712.08230","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08230","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08230v3","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08230","created_at":"2026-05-18T00:02:49Z"},{"alias_kind":"pith_short_12","alias_value":"DO7OZDELKLGI","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DO7OZDELKLGIMHF6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DO7OZDEL","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:9ad64f700aeea0e68ab5009cce1bbf8a12939cedc7a0f04433d311a88a3a2fe0","target":"graph","created_at":"2026-05-18T00:02:49Z","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":"We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to each submatrix. For this scheme, we prove that up to a given number of partitions the communication load and the computational delay (not including the encoding and decoding delay) are identical to those of the scheme recently proposed by Li et al., based on a single, long MDS code. However, due to the use of shorter MDS codes, our scheme yields a significantly","authors_text":"Albin Severinson, Alexandre Graell i Amat, Eirik Rosnes","cross_cats":["cs.DC","cs.LG","cs.PF","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T22:02:25Z","title":"Block-Diagonal and LT Codes for Distributed Computing With Straggling Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08230","kind":"arxiv","version":3},"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:97583275c875967f6a4ebdb75a74686dbd2f0a4911dc1f07dcad50ada9cb2222","target":"record","created_at":"2026-05-18T00:02:49Z","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":"167ecfcf3f7f7cfc59fee4c4bbc963b618b5523f6b192c5d65d4082145668bf8","cross_cats_sorted":["cs.DC","cs.LG","cs.PF","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-21T22:02:25Z","title_canon_sha256":"32863809559bdb390929d92513c7b515acc21f246462fe9af982a21602fceceb"},"schema_version":"1.0","source":{"id":"1712.08230","kind":"arxiv","version":3}},"canonical_sha256":"1bbeec8c8b52cc861cbec0c73ec64b872f605f782333bcff633e5af68af463b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bbeec8c8b52cc861cbec0c73ec64b872f605f782333bcff633e5af68af463b5","first_computed_at":"2026-05-18T00:02:49.660960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:49.660960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utMf4Olq+FyM5Zc1nAfFe/OqHdI/yV+NE3rPDPBBS7jR6E44YyUYrRHbqaMba2ljjDMzisWxgEztTfpgwN9LDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:49.661687Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08230","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97583275c875967f6a4ebdb75a74686dbd2f0a4911dc1f07dcad50ada9cb2222","sha256:9ad64f700aeea0e68ab5009cce1bbf8a12939cedc7a0f04433d311a88a3a2fe0"],"state_sha256":"3715664d18737cf768705d4b43cf539c4f18f0aae9e0a3dddf39040bf5679970"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dF6LPHu32DxELuAORWHxmR36RHW97DdARcQlAzPAozPoFFfmgGUVWBNLpZCijuhIqrMq8wovdB5FZRy3MnM8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:36:12.547378Z","bundle_sha256":"2e5da1186d86065832f6dfc2a613105fa9c84ea06744f756ac085a1e1a8b7d22"}}