{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IL5TQIIDAL5CLUO5N2YOWXFILU","short_pith_number":"pith:IL5TQIID","canonical_record":{"source":{"id":"1802.03430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-09T19:49:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b7c9ae5e871e55258fa585022e7e58bcd7f14f2df897cf117ebc02ba73f9fba2","abstract_canon_sha256":"fe15abb9873329b809852edf9769e7502e051a39d249591bcc42a0d93c8e0413"},"schema_version":"1.0"},"canonical_sha256":"42fb38210302fa25d1dd6eb0eb5ca85d1afae92e54213ea536cd926ae10aa6dc","source":{"kind":"arxiv","id":"1802.03430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03430","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03430v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03430","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"IL5TQIIDAL5C","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IL5TQIIDAL5CLUO5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IL5TQIID","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IL5TQIIDAL5CLUO5N2YOWXFILU","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-09T19:49:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"b7c9ae5e871e55258fa585022e7e58bcd7f14f2df897cf117ebc02ba73f9fba2","abstract_canon_sha256":"fe15abb9873329b809852edf9769e7502e051a39d249591bcc42a0d93c8e0413"},"schema_version":"1.0"},"canonical_sha256":"42fb38210302fa25d1dd6eb0eb5ca85d1afae92e54213ea536cd926ae10aa6dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:09.114429Z","signature_b64":"xVe9CvZ6Cpv2VDEWKTRLqK8Szsmxb/L0fhXS7gsvhvaGjbA75RtmV3n6vhIzsamCUOfbClxbK6xW+laGHlMfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42fb38210302fa25d1dd6eb0eb5ca85d1afae92e54213ea536cd926ae10aa6dc","last_reissued_at":"2026-05-18T00:18:09.113725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:09.113725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03430","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CSkwd2NYGAVzaVBdxN9FUySqlhu2mVBGDgNqKrxR1PZ30YXK8qQtI1FO6oo5aF7EXh9V3hddNW80Xmq0iKfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:02:42.054332Z"},"content_sha256":"1538f77a81e59a0d0923617e5374461463c155d6e2cfc6499a8ad03bb63d25a3","schema_version":"1.0","event_id":"sha256:1538f77a81e59a0d0923617e5374461463c155d6e2cfc6499a8ad03bb63d25a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IL5TQIIDAL5CLUO5N2YOWXFILU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coded Sparse Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DC","authors_text":"Jiashang Liu, Ness Shroff, Sinong Wang","submitted_at":"2018-02-09T19:49:36Z","abstract_excerpt":"In a large-scale and distributed matrix multiplication problem $C=A^{\\intercal}B$, where $C\\in\\mathbb{R}^{r\\times t}$, the coded computation plays an important role to effectively deal with \"stragglers\" (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could result in much higher computation overhead, i.e., $O(rt)$ decoding time. In this paper, we develop a new coded computation strategy, we call \\emph{sparse code}, which achieves "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03430","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Yxl26iRMODMxB6bKwF6aGVQXWYk+awe4hcuJBekPmijYgdHWE3SC6DIygg/0fjp+kxM06/opT7gIeSkgxBrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:02:42.054729Z"},"content_sha256":"6e101967ba71bafa702c5418f6b534cbbf0cc0a3c4b3fac851069fbb4b399d65","schema_version":"1.0","event_id":"sha256:6e101967ba71bafa702c5418f6b534cbbf0cc0a3c4b3fac851069fbb4b399d65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/bundle.json","state_url":"https://pith.science/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T16:02:42Z","links":{"resolver":"https://pith.science/pith/IL5TQIIDAL5CLUO5N2YOWXFILU","bundle":"https://pith.science/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/bundle.json","state":"https://pith.science/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IL5TQIIDAL5CLUO5N2YOWXFILU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IL5TQIIDAL5CLUO5N2YOWXFILU","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":"fe15abb9873329b809852edf9769e7502e051a39d249591bcc42a0d93c8e0413","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-09T19:49:36Z","title_canon_sha256":"b7c9ae5e871e55258fa585022e7e58bcd7f14f2df897cf117ebc02ba73f9fba2"},"schema_version":"1.0","source":{"id":"1802.03430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03430","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03430v2","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03430","created_at":"2026-05-18T00:18:09Z"},{"alias_kind":"pith_short_12","alias_value":"IL5TQIIDAL5C","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IL5TQIIDAL5CLUO5","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IL5TQIID","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:6e101967ba71bafa702c5418f6b534cbbf0cc0a3c4b3fac851069fbb4b399d65","target":"graph","created_at":"2026-05-18T00:18:09Z","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":"In a large-scale and distributed matrix multiplication problem $C=A^{\\intercal}B$, where $C\\in\\mathbb{R}^{r\\times t}$, the coded computation plays an important role to effectively deal with \"stragglers\" (distributed computations that may get delayed due to few slow or faulty processors). However, existing coded schemes could destroy the significant sparsity that exists in large-scale machine learning problems, and could result in much higher computation overhead, i.e., $O(rt)$ decoding time. In this paper, we develop a new coded computation strategy, we call \\emph{sparse code}, which achieves ","authors_text":"Jiashang Liu, Ness Shroff, Sinong Wang","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-09T19:49:36Z","title":"Coded Sparse Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03430","kind":"arxiv","version":2},"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:1538f77a81e59a0d0923617e5374461463c155d6e2cfc6499a8ad03bb63d25a3","target":"record","created_at":"2026-05-18T00:18:09Z","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":"fe15abb9873329b809852edf9769e7502e051a39d249591bcc42a0d93c8e0413","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-09T19:49:36Z","title_canon_sha256":"b7c9ae5e871e55258fa585022e7e58bcd7f14f2df897cf117ebc02ba73f9fba2"},"schema_version":"1.0","source":{"id":"1802.03430","kind":"arxiv","version":2}},"canonical_sha256":"42fb38210302fa25d1dd6eb0eb5ca85d1afae92e54213ea536cd926ae10aa6dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42fb38210302fa25d1dd6eb0eb5ca85d1afae92e54213ea536cd926ae10aa6dc","first_computed_at":"2026-05-18T00:18:09.113725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:09.113725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xVe9CvZ6Cpv2VDEWKTRLqK8Szsmxb/L0fhXS7gsvhvaGjbA75RtmV3n6vhIzsamCUOfbClxbK6xW+laGHlMfBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:09.114429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1538f77a81e59a0d0923617e5374461463c155d6e2cfc6499a8ad03bb63d25a3","sha256:6e101967ba71bafa702c5418f6b534cbbf0cc0a3c4b3fac851069fbb4b399d65"],"state_sha256":"58e663f9d2f81405edc8f2ba05fd41be1f990b18c74298b81a821674f3582a80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0UwVRZtfRPT7LK0qCtkKPDNBpZJXiqICNCtI3S1Ohuc9FGsqhJhjzFOSPmiX2Xzt7hl6b1ZUisveuZxbI1bGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:02:42.056999Z","bundle_sha256":"29f63345908378efa16e105a3964407593a80809c7e8d8b2d15551fefa9ea683"}}