{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X6R4TODWKTARH2JTCB6WLX3NQ6","short_pith_number":"pith:X6R4TODW","schema_version":"1.0","canonical_sha256":"bfa3c9b87654c113e933107d65df6d879a0d4d9c94df5269d333db0dc4614d79","source":{"kind":"arxiv","id":"1907.08064","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Anindya B. Das, Namrata Vaswani","submitted_at":"2019-07-18T14:12:26Z","abstract_excerpt":"Distributed matrix computations -- matrix-matrix or matrix-vector multiplications -- are well-recognized to suffer from the problem of stragglers (slow or failed worker nodes). Much of prior work in this area is (i) either sub-optimal in terms of its straggler resilience, or (ii) suffers from numerical problems, i.e., there is a blow-up of round-off errors in the decoded result owing to the high condition numbers of the corresponding decoding matrices. Our work presents convolutional coding approach to this problem that removes these limitations. It is optimal in terms of its straggler resilie"},"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.08064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-18T14:12:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8aeb530c6b061b2667d5f307c27d2d568ae8d512fcd46584d0d02ca3f7c4c491","abstract_canon_sha256":"d353977b216b0a896a5f85745ba15e9b6f7ed539dfd127c14cce2d4363d02e1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:07:10.845471Z","signature_b64":"KujBPNGRewNegM91RtLqtrjhpOasFjIyGJ1BVZxivjQVSgTMkMqmVCTShAncC1N+imvWVGkfHUFCTXpQrkBMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa3c9b87654c113e933107d65df6d879a0d4d9c94df5269d333db0dc4614d79","last_reissued_at":"2026-07-05T01:07:10.845053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:07:10.845053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Robust Distributed Matrix Computations via Convolutional Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Anindya B. Das, Namrata Vaswani","submitted_at":"2019-07-18T14:12:26Z","abstract_excerpt":"Distributed matrix computations -- matrix-matrix or matrix-vector multiplications -- are well-recognized to suffer from the problem of stragglers (slow or failed worker nodes). Much of prior work in this area is (i) either sub-optimal in terms of its straggler resilience, or (ii) suffers from numerical problems, i.e., there is a blow-up of round-off errors in the decoded result owing to the high condition numbers of the corresponding decoding matrices. Our work presents convolutional coding approach to this problem that removes these limitations. It is optimal in terms of its straggler resilie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08064","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1907.08064/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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.08064","created_at":"2026-07-05T01:07:10.845115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08064v2","created_at":"2026-07-05T01:07:10.845115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08064","created_at":"2026-07-05T01:07:10.845115+00:00"},{"alias_kind":"pith_short_12","alias_value":"X6R4TODWKTAR","created_at":"2026-07-05T01:07:10.845115+00:00"},{"alias_kind":"pith_short_16","alias_value":"X6R4TODWKTARH2JT","created_at":"2026-07-05T01:07:10.845115+00:00"},{"alias_kind":"pith_short_8","alias_value":"X6R4TODW","created_at":"2026-07-05T01:07:10.845115+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08058","citing_title":"General Coded Computing: Adversarial Settings","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6","json":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6.json","graph_json":"https://pith.science/api/pith-number/X6R4TODWKTARH2JTCB6WLX3NQ6/graph.json","events_json":"https://pith.science/api/pith-number/X6R4TODWKTARH2JTCB6WLX3NQ6/events.json","paper":"https://pith.science/paper/X6R4TODW"},"agent_actions":{"view_html":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6","download_json":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6.json","view_paper":"https://pith.science/paper/X6R4TODW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08064&json=true","fetch_graph":"https://pith.science/api/pith-number/X6R4TODWKTARH2JTCB6WLX3NQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/X6R4TODWKTARH2JTCB6WLX3NQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6/action/storage_attestation","attest_author":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6/action/author_attestation","sign_citation":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6/action/citation_signature","submit_replication":"https://pith.science/pith/X6R4TODWKTARH2JTCB6WLX3NQ6/action/replication_record"}},"created_at":"2026-07-05T01:07:10.845115+00:00","updated_at":"2026-07-05T01:07:10.845115+00:00"}