{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q7M2LSWHKCX5LGDQ3QAJNMBNPW","short_pith_number":"pith:Q7M2LSWH","canonical_record":{"source":{"id":"1811.02144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-06T03:24:06Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6d0a2cd0ce2f73b87202238862505eda7b8fb1bff1056fe346174e72ada8f145","abstract_canon_sha256":"02bfb7b93481e0a5ba650d25022a5528c1c15eb5043eaef74f20c89049178c16"},"schema_version":"1.0"},"canonical_sha256":"87d9a5cac750afd59870dc0096b02d7da294240aa4e6f0c6e55e8649a89fcf3f","source":{"kind":"arxiv","id":"1811.02144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02144","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02144v2","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02144","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q7M2LSWHKCX5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q7M2LSWHKCX5LGDQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q7M2LSWH","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q7M2LSWHKCX5LGDQ3QAJNMBNPW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.02144","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-06T03:24:06Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6d0a2cd0ce2f73b87202238862505eda7b8fb1bff1056fe346174e72ada8f145","abstract_canon_sha256":"02bfb7b93481e0a5ba650d25022a5528c1c15eb5043eaef74f20c89049178c16"},"schema_version":"1.0"},"canonical_sha256":"87d9a5cac750afd59870dc0096b02d7da294240aa4e6f0c6e55e8649a89fcf3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:21.379544Z","signature_b64":"wnsAwxfKbhQQrmzUkA1wOP4KxVL4CBLMGmva9tEl6qqlaYG2xHp0jc8rz/ZfwVvdbshnN2Dh4FeHyhlWhxjODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87d9a5cac750afd59870dc0096b02d7da294240aa4e6f0c6e55e8649a89fcf3f","last_reissued_at":"2026-05-18T00:01:21.379078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:21.379078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.02144","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoRCyHccJ0kz/NjdzvJnapJwcLRTqPB0dn5Nu7hTSEmPSQO0svt4s/wVb0CdrtrNLJf20yIrawgEbzmzvBt2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:00:59.240726Z"},"content_sha256":"fae43669eda62ffd72f5d07e02345a7895bc12b539384fd186b6cd9c20c3a74f","schema_version":"1.0","event_id":"sha256:fae43669eda62ffd72f5d07e02345a7895bc12b539384fd186b6cd9c20c3a74f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q7M2LSWHKCX5LGDQ3QAJNMBNPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erasure coding for distributed matrix multiplication for matrices with bounded entries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DC","authors_text":"Aditya Ramamoorthy, Konstantinos Konstantinidis, Li Tang","submitted_at":"2018-11-06T03:24:06Z","abstract_excerpt":"Distributed matrix multiplication is widely used in several scientific domains. It is well recognized that computation times on distributed clusters are often dominated by the slowest workers (called stragglers). Recent work has demonstrated that straggler mitigation can be viewed as a problem of designing erasure codes. For matrices $\\mathbf A$ and $\\mathbf B$, the technique essentially maps the computation of $\\mathbf A^T \\mathbf B$ into the multiplication of smaller (coded) submatrices. The stragglers are treated as erasures in this process. The computation can be completed as long as a cer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02144","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:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tQgDLEbeDaryr21WO6GEXy+fDcUN04a64yBsjh7m+rj+dTLMVZrV0OInvZATVnUkQKG8oqu8aTYQy4jFNy2kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:00:59.241084Z"},"content_sha256":"51ea5a127130e16a3a414315f7963c99a80730968c4a29243b4cc7e11bb27b8e","schema_version":"1.0","event_id":"sha256:51ea5a127130e16a3a414315f7963c99a80730968c4a29243b4cc7e11bb27b8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/bundle.json","state_url":"https://pith.science/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/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-31T03:00:59Z","links":{"resolver":"https://pith.science/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW","bundle":"https://pith.science/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/bundle.json","state":"https://pith.science/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7M2LSWHKCX5LGDQ3QAJNMBNPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q7M2LSWHKCX5LGDQ3QAJNMBNPW","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":"02bfb7b93481e0a5ba650d25022a5528c1c15eb5043eaef74f20c89049178c16","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-06T03:24:06Z","title_canon_sha256":"6d0a2cd0ce2f73b87202238862505eda7b8fb1bff1056fe346174e72ada8f145"},"schema_version":"1.0","source":{"id":"1811.02144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02144","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02144v2","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02144","created_at":"2026-05-18T00:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q7M2LSWHKCX5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q7M2LSWHKCX5LGDQ","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q7M2LSWH","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:51ea5a127130e16a3a414315f7963c99a80730968c4a29243b4cc7e11bb27b8e","target":"graph","created_at":"2026-05-18T00:01:21Z","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":"Distributed matrix multiplication is widely used in several scientific domains. It is well recognized that computation times on distributed clusters are often dominated by the slowest workers (called stragglers). Recent work has demonstrated that straggler mitigation can be viewed as a problem of designing erasure codes. For matrices $\\mathbf A$ and $\\mathbf B$, the technique essentially maps the computation of $\\mathbf A^T \\mathbf B$ into the multiplication of smaller (coded) submatrices. The stragglers are treated as erasures in this process. The computation can be completed as long as a cer","authors_text":"Aditya Ramamoorthy, Konstantinos Konstantinidis, Li Tang","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-06T03:24:06Z","title":"Erasure coding for distributed matrix multiplication for matrices with bounded entries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02144","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:fae43669eda62ffd72f5d07e02345a7895bc12b539384fd186b6cd9c20c3a74f","target":"record","created_at":"2026-05-18T00:01:21Z","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":"02bfb7b93481e0a5ba650d25022a5528c1c15eb5043eaef74f20c89049178c16","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-06T03:24:06Z","title_canon_sha256":"6d0a2cd0ce2f73b87202238862505eda7b8fb1bff1056fe346174e72ada8f145"},"schema_version":"1.0","source":{"id":"1811.02144","kind":"arxiv","version":2}},"canonical_sha256":"87d9a5cac750afd59870dc0096b02d7da294240aa4e6f0c6e55e8649a89fcf3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87d9a5cac750afd59870dc0096b02d7da294240aa4e6f0c6e55e8649a89fcf3f","first_computed_at":"2026-05-18T00:01:21.379078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:21.379078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wnsAwxfKbhQQrmzUkA1wOP4KxVL4CBLMGmva9tEl6qqlaYG2xHp0jc8rz/ZfwVvdbshnN2Dh4FeHyhlWhxjODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:21.379544Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae43669eda62ffd72f5d07e02345a7895bc12b539384fd186b6cd9c20c3a74f","sha256:51ea5a127130e16a3a414315f7963c99a80730968c4a29243b4cc7e11bb27b8e"],"state_sha256":"d6ab083a539bd0da9b5e7665e84157fd38c9bf69761df95af637b251521a2add"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UsTotK8QIZGvrxlo447obnGGkG1vDJByXTlVRFuiaf7JfnJFOf5+Jo73RNvVYZ0JtfkU3PthWyJTIFQLnTiZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:00:59.243013Z","bundle_sha256":"4c509608c455f2855deea1dacc2cdc75ef3ac2c645c8cf1c6fc11c07315cd992"}}