{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4GCBPZ7LXJCSS4KSHBXJ6ULKU7","short_pith_number":"pith:4GCBPZ7L","schema_version":"1.0","canonical_sha256":"e18417e7ebba45297152386e9f516aa7c60b0fd945f3ec1e3d1a32e2111d8334","source":{"kind":"arxiv","id":"1907.08819","version":1},"attestation_state":"computed","paper":{"title":"Cuboid Partitioning for Hierarchical Coded Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nuwan Ferdinand, Shahrzad Kiani, Stark C. Draper","submitted_at":"2019-07-20T14:46:25Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1907.08819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-20T14:46:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e88c4fd220637fbf7de2b8c68077c9b3cb103fe14c3d3187b5318f659a4895e","abstract_canon_sha256":"1d445e907859f1e55b1e82f2a61602fc5ba3a8ff69b8f521f2fedb56b2b9c64c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:05.268587Z","signature_b64":"GbGS2c3cLrleYnPnV7UMhyMrZOfbp6KkCshtTGTiKIVFTTHW1EVtp8xsxoex5m63fajDB8jtfqYdxFBisXQlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e18417e7ebba45297152386e9f516aa7c60b0fd945f3ec1e3d1a32e2111d8334","last_reissued_at":"2026-05-17T23:40:05.267991Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:05.267991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cuboid Partitioning for Hierarchical Coded Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nuwan Ferdinand, Shahrzad Kiani, Stark C. Draper","submitted_at":"2019-07-20T14:46:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08819","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.08819","created_at":"2026-05-17T23:40:05.268059+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08819v1","created_at":"2026-05-17T23:40:05.268059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08819","created_at":"2026-05-17T23:40:05.268059+00:00"},{"alias_kind":"pith_short_12","alias_value":"4GCBPZ7LXJCS","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4GCBPZ7LXJCSS4KS","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4GCBPZ7L","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7","json":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7.json","graph_json":"https://pith.science/api/pith-number/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/graph.json","events_json":"https://pith.science/api/pith-number/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/events.json","paper":"https://pith.science/paper/4GCBPZ7L"},"agent_actions":{"view_html":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7","download_json":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7.json","view_paper":"https://pith.science/paper/4GCBPZ7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08819&json=true","fetch_graph":"https://pith.science/api/pith-number/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/graph.json","fetch_events":"https://pith.science/api/pith-number/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/action/storage_attestation","attest_author":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/action/author_attestation","sign_citation":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/action/citation_signature","submit_replication":"https://pith.science/pith/4GCBPZ7LXJCSS4KSHBXJ6ULKU7/action/replication_record"}},"created_at":"2026-05-17T23:40:05.268059+00:00","updated_at":"2026-05-17T23:40:05.268059+00:00"}