{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:USF23YIUEUXU37DM7RQQYER6BX","short_pith_number":"pith:USF23YIU","canonical_record":{"source":{"id":"1705.10464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"199539e976b61826884df99eb958ce85f27e1df456e965acf05d25546abda71b","abstract_canon_sha256":"d890df181a80f2181f1dc6af097bd309aa102ecace9c2c61aa30a26540ac1a1c"},"schema_version":"1.0"},"canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","source":{"kind":"arxiv","id":"1705.10464","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10464","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10464v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10464","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"USF23YIUEUXU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"USF23YIUEUXU37DM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"USF23YIU","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:USF23YIUEUXU37DM7RQQYER6BX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","cross_cats_sorted":["cs.DC","math.IT"],"title_canon_sha256":"199539e976b61826884df99eb958ce85f27e1df456e965acf05d25546abda71b","abstract_canon_sha256":"d890df181a80f2181f1dc6af097bd309aa102ecace9c2c61aa30a26540ac1a1c"},"schema_version":"1.0"},"canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:11.710774Z","signature_b64":"mF8KG/bcnQcz10cP5w6+f17MvqbgkjPyv2HfSE/WVYSP+K7wXAy9Zeixfjv1YAF+xwscbuSVZqRBblpJOgaeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","last_reissued_at":"2026-05-18T00:25:11.710300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:11.710300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10464","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mGOWN6yujky6+goQZpmcDfGAVRtuEc/49slkyIMp5RLOAf+dgFbU0XUk73oHvpIL56TOmaraxOunTywrNnH/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:29.750998Z"},"content_sha256":"bb502342b075987df8ff07a3aeb1bec1ac6cbed5cdad6b3bbd2835c3adc28cce","schema_version":"1.0","event_id":"sha256:bb502342b075987df8ff07a3aeb1bec1ac6cbed5cdad6b3bbd2835c3adc28cce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:USF23YIUEUXU37DM7RQQYER6BX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","submitted_at":"2017-05-30T06:07:16Z","abstract_excerpt":"We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a computation strategy that leverages ideas from coding theory to design intermediate computations at the worker nodes, in order to efficiently deal with straggling workers. The proposed strategy, named as \\emph{polynomial codes}, achieves the optimum recovery threshold, defined as the minimum number of workers that the master needs to wait for in order to compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10464","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:25:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfMQimZB09RvTrXybyab8E7MHvnblgsVmCHNPUQ+ptdGWt+KbWqPpjLEyK0uJ6rUGvjR4hRG5lEBAn5g0hmvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:56:29.751726Z"},"content_sha256":"6f367b967a04ecff0f40cd0ad7de35715af3f309299f5c0169900a89aae4dd58","schema_version":"1.0","event_id":"sha256:6f367b967a04ecff0f40cd0ad7de35715af3f309299f5c0169900a89aae4dd58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/bundle.json","state_url":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USF23YIUEUXU37DM7RQQYER6BX/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-25T18:56:29Z","links":{"resolver":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX","bundle":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/bundle.json","state":"https://pith.science/pith/USF23YIUEUXU37DM7RQQYER6BX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USF23YIUEUXU37DM7RQQYER6BX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:USF23YIUEUXU37DM7RQQYER6BX","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":"d890df181a80f2181f1dc6af097bd309aa102ecace9c2c61aa30a26540ac1a1c","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","title_canon_sha256":"199539e976b61826884df99eb958ce85f27e1df456e965acf05d25546abda71b"},"schema_version":"1.0","source":{"id":"1705.10464","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10464","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10464v2","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10464","created_at":"2026-05-18T00:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"USF23YIUEUXU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"USF23YIUEUXU37DM","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"USF23YIU","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:6f367b967a04ecff0f40cd0ad7de35715af3f309299f5c0169900a89aae4dd58","target":"graph","created_at":"2026-05-18T00:25:11Z","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":"We consider a large-scale matrix multiplication problem where the computation is carried out using a distributed system with a master node and multiple worker nodes, where each worker can store parts of the input matrices. We propose a computation strategy that leverages ideas from coding theory to design intermediate computations at the worker nodes, in order to efficiently deal with straggling workers. The proposed strategy, named as \\emph{polynomial codes}, achieves the optimum recovery threshold, defined as the minimum number of workers that the master needs to wait for in order to compute","authors_text":"A. Salman Avestimehr, Mohammad Ali Maddah-Ali, Qian Yu","cross_cats":["cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","title":"Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10464","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:bb502342b075987df8ff07a3aeb1bec1ac6cbed5cdad6b3bbd2835c3adc28cce","target":"record","created_at":"2026-05-18T00:25:11Z","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":"d890df181a80f2181f1dc6af097bd309aa102ecace9c2c61aa30a26540ac1a1c","cross_cats_sorted":["cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T06:07:16Z","title_canon_sha256":"199539e976b61826884df99eb958ce85f27e1df456e965acf05d25546abda71b"},"schema_version":"1.0","source":{"id":"1705.10464","kind":"arxiv","version":2}},"canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a48bade114252f4dfc6cfc610c123e0df63fbff90a62537fe84be6f3a2dd2774","first_computed_at":"2026-05-18T00:25:11.710300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:11.710300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mF8KG/bcnQcz10cP5w6+f17MvqbgkjPyv2HfSE/WVYSP+K7wXAy9Zeixfjv1YAF+xwscbuSVZqRBblpJOgaeDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:11.710774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10464","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb502342b075987df8ff07a3aeb1bec1ac6cbed5cdad6b3bbd2835c3adc28cce","sha256:6f367b967a04ecff0f40cd0ad7de35715af3f309299f5c0169900a89aae4dd58"],"state_sha256":"1c91ab92ce34c879700480ca48f212bad7103d1940616c275e9ab5d4772c1a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zFtxonUPmXEKiyE5zo6GzqN0NYN0mpPEni8MHfnC9lVhWgnT2FZ+2NogVB6TeQ+htKF4fhY1unHcg1SO4TvGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:56:29.756263Z","bundle_sha256":"0c712262fe76b6cd37e8dcda8d09e56cc6d821ce168a591eacbff16a3969c63d"}}