{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BBAHUMBY227T4TUT2RPQSXLBOL","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":"10ba821593c6254d1ee0505de5a6b6efccec7cc3c273a663870cf28e82e35802","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:45:49Z","title_canon_sha256":"4aab0a3ff4350ddbf2a7044905b1d78a973df17ad8d3544c7c047692c5f6f568"},"schema_version":"1.0","source":{"id":"1907.08818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08818","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08818v1","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08818","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"BBAHUMBY227T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BBAHUMBY227T4TUT","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BBAHUMBY","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:723b4d39caa1b248e71f06996f46a7489f8a1150a20148de8ad691639d3067bb","target":"graph","created_at":"2026-05-17T23:40:03Z","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":"Slow working nodes, known as stragglers, can greatly reduce the speed of distributed computation. Coded matrix multiplication is a recently introduced technique that enables straggler-resistant distributed multiplication of large matrices. A key property is that the finishing time depends only on the work completed by a set of the fastest workers, while the work done by the slowest workers is ignored completely. This paper is motivated by the observation that in real-world commercial cloud computing systems such as Amazon's Elastic Compute Cloud (EC2) the distinction between fast and slow node","authors_text":"Nuwan Ferdinand, Shahrzad Kiani, Stark C. Draper","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:45:49Z","title":"Hierarchical Coded Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08818","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:75d35320ea5ffdad49bb9ea7c11b2196a7613bd0749983afd1c44eae0ef1e54e","target":"record","created_at":"2026-05-17T23:40:03Z","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":"10ba821593c6254d1ee0505de5a6b6efccec7cc3c273a663870cf28e82e35802","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:45:49Z","title_canon_sha256":"4aab0a3ff4350ddbf2a7044905b1d78a973df17ad8d3544c7c047692c5f6f568"},"schema_version":"1.0","source":{"id":"1907.08818","kind":"arxiv","version":1}},"canonical_sha256":"08407a3038d6bf3e4e93d45f095d6172c118337c56a2116c9b13b47898d3226d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08407a3038d6bf3e4e93d45f095d6172c118337c56a2116c9b13b47898d3226d","first_computed_at":"2026-05-17T23:40:03.031414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:03.031414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BenOXGrKeevgV1cV2mQQSczgCoBB0kMx/+iCcn29BFvh0QyaXRm/QZUoKctYRuQojPGk+QBqiMg+h06tg4VtCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:03.031974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d35320ea5ffdad49bb9ea7c11b2196a7613bd0749983afd1c44eae0ef1e54e","sha256:723b4d39caa1b248e71f06996f46a7489f8a1150a20148de8ad691639d3067bb"],"state_sha256":"1a3f9944463a4dd008b4827ad3538b6d0aa97f9553e69b9a98a559b02730e8d4"}