{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4GCBPZ7LXJCSS4KSHBXJ6ULKU7","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":"1d445e907859f1e55b1e82f2a61602fc5ba3a8ff69b8f521f2fedb56b2b9c64c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:46:25Z","title_canon_sha256":"7e88c4fd220637fbf7de2b8c68077c9b3cb103fe14c3d3187b5318f659a4895e"},"schema_version":"1.0","source":{"id":"1907.08819","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08819","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08819v1","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08819","created_at":"2026-05-17T23:40:05Z"},{"alias_kind":"pith_short_12","alias_value":"4GCBPZ7LXJCS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4GCBPZ7LXJCSS4KS","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4GCBPZ7L","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6e8e2f644fbf002a75f144442b726bc2f3473d7b2942b4793b1593f4d27f9064","target":"graph","created_at":"2026-05-17T23:40:05Z","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 matrix multiplication is a technique to enable straggler-resistant multiplication of large matrices in distributed computing systems. In this paper, we first present a conceptual framework to represent the division of work amongst processors in coded matrix multiplication as a cuboid partitioning problem. This framework allows us to unify existing methods and motivates new techniques. Building on this framework, we apply the idea of hierarchical coding (Ferdinand & Draper, 2018) to coded matrix multiplication. The hierarchical scheme we develop is able to exploit the work completed by al","authors_text":"Nuwan Ferdinand, Shahrzad Kiani, Stark C. Draper","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:46:25Z","title":"Cuboid Partitioning for Hierarchical Coded Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08819","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:d60021d624216ec217102b8b3a69c107bdf5ef803d5020c7b4ae3ba36391a0df","target":"record","created_at":"2026-05-17T23:40:05Z","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":"1d445e907859f1e55b1e82f2a61602fc5ba3a8ff69b8f521f2fedb56b2b9c64c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:46:25Z","title_canon_sha256":"7e88c4fd220637fbf7de2b8c68077c9b3cb103fe14c3d3187b5318f659a4895e"},"schema_version":"1.0","source":{"id":"1907.08819","kind":"arxiv","version":1}},"canonical_sha256":"e18417e7ebba45297152386e9f516aa7c60b0fd945f3ec1e3d1a32e2111d8334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e18417e7ebba45297152386e9f516aa7c60b0fd945f3ec1e3d1a32e2111d8334","first_computed_at":"2026-05-17T23:40:05.267991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:05.267991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GbGS2c3cLrleYnPnV7UMhyMrZOfbp6KkCshtTGTiKIVFTTHW1EVtp8xsxoex5m63fajDB8jtfqYdxFBisXQlDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:05.268587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08819","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d60021d624216ec217102b8b3a69c107bdf5ef803d5020c7b4ae3ba36391a0df","sha256:6e8e2f644fbf002a75f144442b726bc2f3473d7b2942b4793b1593f4d27f9064"],"state_sha256":"1ea149a39afd71a8d435e507699d83582626ce01d37cb3bfbcc8c3acfc189724"}