{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YAOSM4DOILAGUNW2FYPRITQU6B","short_pith_number":"pith:YAOSM4DO","schema_version":"1.0","canonical_sha256":"c01d26706e42c06a36da2e1f144e14f04164ba6f00e6635ad692fadee2d01a61","source":{"kind":"arxiv","id":"1202.3173","version":1},"attestation_state":"computed","paper":{"title":"Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"primary_cat":"cs.DS","authors_text":"Benjamin Lipshitz, Grey Ballard, James Demmel, Oded Schwartz, Olga Holtz","submitted_at":"2012-02-14T23:12:23Z","abstract_excerpt":"Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on Strassen's fast matrix multiplication and minimizes communication. The algorithm outperforms all known parallel matrix multiplication algorithms, classical and Strassen-based, both asymptotically and in practice.\n  A critical bottleneck in parallelizing Strassen's algorithm is the communication between the processors. Ballard, Demmel, Holtz, and Schwartz (SPAA'11) prove lower bounds on these communication costs, using "},"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":"1202.3173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-14T23:12:23Z","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"title_canon_sha256":"9a146f2e183adf6d00132e47d1da42ece76fd6b394a389f0810be4b73f78e9c3","abstract_canon_sha256":"0eab787a0b574f540d09483773dcafee9a1a32ed764eed2c386e87d513218e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:14.512394Z","signature_b64":"8cXAQhPjYhV0x7y2VJG9Gx/BaouWM87E3isLpQiBsnGhLfUMOVRQA6voDnwHqEJMK1oHlC9+9vXCmVwHckEeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c01d26706e42c06a36da2e1f144e14f04164ba6f00e6635ad692fadee2d01a61","last_reissued_at":"2026-05-18T04:02:14.511629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:14.511629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"primary_cat":"cs.DS","authors_text":"Benjamin Lipshitz, Grey Ballard, James Demmel, Oded Schwartz, Olga Holtz","submitted_at":"2012-02-14T23:12:23Z","abstract_excerpt":"Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on Strassen's fast matrix multiplication and minimizes communication. The algorithm outperforms all known parallel matrix multiplication algorithms, classical and Strassen-based, both asymptotically and in practice.\n  A critical bottleneck in parallelizing Strassen's algorithm is the communication between the processors. Ballard, Demmel, Holtz, and Schwartz (SPAA'11) prove lower bounds on these communication costs, using "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3173","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":"1202.3173","created_at":"2026-05-18T04:02:14.511761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3173v1","created_at":"2026-05-18T04:02:14.511761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3173","created_at":"2026-05-18T04:02:14.511761+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAOSM4DOILAG","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAOSM4DOILAGUNW2","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAOSM4DO","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B","json":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B.json","graph_json":"https://pith.science/api/pith-number/YAOSM4DOILAGUNW2FYPRITQU6B/graph.json","events_json":"https://pith.science/api/pith-number/YAOSM4DOILAGUNW2FYPRITQU6B/events.json","paper":"https://pith.science/paper/YAOSM4DO"},"agent_actions":{"view_html":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B","download_json":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B.json","view_paper":"https://pith.science/paper/YAOSM4DO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3173&json=true","fetch_graph":"https://pith.science/api/pith-number/YAOSM4DOILAGUNW2FYPRITQU6B/graph.json","fetch_events":"https://pith.science/api/pith-number/YAOSM4DOILAGUNW2FYPRITQU6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B/action/storage_attestation","attest_author":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B/action/author_attestation","sign_citation":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B/action/citation_signature","submit_replication":"https://pith.science/pith/YAOSM4DOILAGUNW2FYPRITQU6B/action/replication_record"}},"created_at":"2026-05-18T04:02:14.511761+00:00","updated_at":"2026-05-18T04:02:14.511761+00:00"}