{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EN4DLY2MOIHRWHNJE4MYBRCJUG","short_pith_number":"pith:EN4DLY2M","schema_version":"1.0","canonical_sha256":"237835e34c720f1b1da9271980c449a1834172535b6ac5b573e7dbba2c6222b4","source":{"kind":"arxiv","id":"1901.10674","version":1},"attestation_state":"computed","paper":{"title":"Universally Decodable Matrices for Distributed Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel","submitted_at":"2019-01-30T04:42:09Z","abstract_excerpt":"Coded computation is an emerging research area that leverages concepts from erasure coding to mitigate the effect of stragglers (slow nodes) in distributed computation clusters, especially for matrix computation problems. In this work, we present a class of distributed matrix-vector multiplication schemes that are based on codes in the Rosenbloom-Tsfasman metric and universally decodable matrices. Our schemes take into account the inherent computation order within a worker node. In particular, they allow us to effectively leverage partial computations performed by stragglers (a feature that ma"},"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":"1901.10674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-30T04:42:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"446eed9f71ac50d541a8ef5c4024688fffa748e85afcf0f40d7f25f7b7504c69","abstract_canon_sha256":"1019aad200ee3caca8c8c3e5b373e3b73c04960fec19883401a16bef280b0aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.325245Z","signature_b64":"wmUpLj+ohg4ajeqFE+lyEGLybMG2w3HpTrd+6p9qfLYMMwyfANzsZRlY9vEvB8GVFhRS63R0asGqc+qgQxC9Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"237835e34c720f1b1da9271980c449a1834172535b6ac5b573e7dbba2c6222b4","last_reissued_at":"2026-05-17T23:55:06.324594Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.324594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universally Decodable Matrices for Distributed Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel","submitted_at":"2019-01-30T04:42:09Z","abstract_excerpt":"Coded computation is an emerging research area that leverages concepts from erasure coding to mitigate the effect of stragglers (slow nodes) in distributed computation clusters, especially for matrix computation problems. In this work, we present a class of distributed matrix-vector multiplication schemes that are based on codes in the Rosenbloom-Tsfasman metric and universally decodable matrices. Our schemes take into account the inherent computation order within a worker node. In particular, they allow us to effectively leverage partial computations performed by stragglers (a feature that ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10674","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":"1901.10674","created_at":"2026-05-17T23:55:06.324708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10674v1","created_at":"2026-05-17T23:55:06.324708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10674","created_at":"2026-05-17T23:55:06.324708+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN4DLY2MOIHR","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN4DLY2MOIHRWHNJ","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN4DLY2M","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05965","citing_title":"Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG","json":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG.json","graph_json":"https://pith.science/api/pith-number/EN4DLY2MOIHRWHNJE4MYBRCJUG/graph.json","events_json":"https://pith.science/api/pith-number/EN4DLY2MOIHRWHNJE4MYBRCJUG/events.json","paper":"https://pith.science/paper/EN4DLY2M"},"agent_actions":{"view_html":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG","download_json":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG.json","view_paper":"https://pith.science/paper/EN4DLY2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10674&json=true","fetch_graph":"https://pith.science/api/pith-number/EN4DLY2MOIHRWHNJE4MYBRCJUG/graph.json","fetch_events":"https://pith.science/api/pith-number/EN4DLY2MOIHRWHNJE4MYBRCJUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG/action/storage_attestation","attest_author":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG/action/author_attestation","sign_citation":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG/action/citation_signature","submit_replication":"https://pith.science/pith/EN4DLY2MOIHRWHNJE4MYBRCJUG/action/replication_record"}},"created_at":"2026-05-17T23:55:06.324708+00:00","updated_at":"2026-05-17T23:55:06.324708+00:00"}