{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WQPVDFTL2A6GDSJ3XB5E5QPGEQ","short_pith_number":"pith:WQPVDFTL","schema_version":"1.0","canonical_sha256":"b41f51966bd03c61c93bb87a4ec1e62435010a887a0068dd9eaf64cab92fb3f4","source":{"kind":"arxiv","id":"1202.3177","version":1},"attestation_state":"computed","paper":{"title":"Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds","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:42:19Z","abstract_excerpt":"A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only recently been found. One is based on classical matrix multiplication (Solomonik and Demmel, 2011), and one is based on Strassen's fast matrix multiplication (Ballard, Demmel, Holtz, Lipshitz, and Schwartz, 2012). Both algorithms scale perfectly, but only up to some number of processors where the inter-processor communication no longer scales.\n  We obtain a m"},"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.3177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-14T23:42:19Z","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"title_canon_sha256":"6f81b1d0015b4969eba271e9a6e6a1d9c954fc571a6abdc378e8084fc8fa66bf","abstract_canon_sha256":"ab13fdeda6ee14bee085128fcd0c30b44d86072412d51be4b0796d36764cc3a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:14.493109Z","signature_b64":"c78ogRTf3hLfbQ/ox/DCWwUO1hlsH4+mED6tcYiUUa3IV5NIVzE9I0Ggm1JB7l/OYHv6Nr/7uCVevDp6LLOFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41f51966bd03c61c93bb87a4ec1e62435010a887a0068dd9eaf64cab92fb3f4","last_reissued_at":"2026-05-18T04:02:14.492494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:14.492494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds","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:42:19Z","abstract_excerpt":"A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect strong scaling have only recently been found. One is based on classical matrix multiplication (Solomonik and Demmel, 2011), and one is based on Strassen's fast matrix multiplication (Ballard, Demmel, Holtz, Lipshitz, and Schwartz, 2012). Both algorithms scale perfectly, but only up to some number of processors where the inter-processor communication no longer scales.\n  We obtain a m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3177","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.3177","created_at":"2026-05-18T04:02:14.492584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3177v1","created_at":"2026-05-18T04:02:14.492584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3177","created_at":"2026-05-18T04:02:14.492584+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQPVDFTL2A6G","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQPVDFTL2A6GDSJ3","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQPVDFTL","created_at":"2026-05-18T12:27:25.539911+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/WQPVDFTL2A6GDSJ3XB5E5QPGEQ","json":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ.json","graph_json":"https://pith.science/api/pith-number/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/graph.json","events_json":"https://pith.science/api/pith-number/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/events.json","paper":"https://pith.science/paper/WQPVDFTL"},"agent_actions":{"view_html":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ","download_json":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ.json","view_paper":"https://pith.science/paper/WQPVDFTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3177&json=true","fetch_graph":"https://pith.science/api/pith-number/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/action/storage_attestation","attest_author":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/action/author_attestation","sign_citation":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/action/citation_signature","submit_replication":"https://pith.science/pith/WQPVDFTL2A6GDSJ3XB5E5QPGEQ/action/replication_record"}},"created_at":"2026-05-18T04:02:14.492584+00:00","updated_at":"2026-05-18T04:02:14.492584+00:00"}