{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WE4UX53R2K4C4UGMEFYEOIZU5K","short_pith_number":"pith:WE4UX53R","schema_version":"1.0","canonical_sha256":"b1394bf771d2b82e50cc2170472334ea95449f90bbf6dd1775e9ae7d1a16be0d","source":{"kind":"arxiv","id":"1306.4161","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Parallel Matrix Multiplication on Large-Scale Distributed Memory Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexey Lastovetsky, Jean-Noel Quintin, Khalid Hasanov","submitted_at":"2013-06-18T12:17:36Z","abstract_excerpt":"Matrix multiplication is a very important computation kernel both in its own right as a building block of many scientific applications and as a popular representative for other scientific applications. Cannon algorithm which dates back to 1969 was the first efficient algorithm for parallel matrix multiplication providing theoretically optimal communication cost. However this algorithm requires a square number of processors. In the mid 1990s, the SUMMA algorithm was introduced. SUMMA overcomes the shortcomings of Cannon algorithm as it can be used on a non-square number of processors as well. S"},"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":"1306.4161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-18T12:17:36Z","cross_cats_sorted":[],"title_canon_sha256":"bee05b3cd31774b35a0f3f5bac817cfd103868f6fc5bd32a47f9da3d906eb5ae","abstract_canon_sha256":"fbcc453910cd912ca3b205760b7adbf640908625c0867a250d9cc146056a7d74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:36.951449Z","signature_b64":"pGZ0Ddvl3p+iIhwyj2MuEmQreAUaGIMn8NXkRaDPBLP494qQsi0XdBy8pudpTfQADpy4ejWwPmduxm+/5kA7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1394bf771d2b82e50cc2170472334ea95449f90bbf6dd1775e9ae7d1a16be0d","last_reissued_at":"2026-05-18T03:20:36.950709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:36.950709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Parallel Matrix Multiplication on Large-Scale Distributed Memory Platforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexey Lastovetsky, Jean-Noel Quintin, Khalid Hasanov","submitted_at":"2013-06-18T12:17:36Z","abstract_excerpt":"Matrix multiplication is a very important computation kernel both in its own right as a building block of many scientific applications and as a popular representative for other scientific applications. Cannon algorithm which dates back to 1969 was the first efficient algorithm for parallel matrix multiplication providing theoretically optimal communication cost. However this algorithm requires a square number of processors. In the mid 1990s, the SUMMA algorithm was introduced. SUMMA overcomes the shortcomings of Cannon algorithm as it can be used on a non-square number of processors as well. S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4161","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":"1306.4161","created_at":"2026-05-18T03:20:36.950806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4161v1","created_at":"2026-05-18T03:20:36.950806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4161","created_at":"2026-05-18T03:20:36.950806+00:00"},{"alias_kind":"pith_short_12","alias_value":"WE4UX53R2K4C","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WE4UX53R2K4C4UGM","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WE4UX53R","created_at":"2026-05-18T12:28:04.890932+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/WE4UX53R2K4C4UGMEFYEOIZU5K","json":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K.json","graph_json":"https://pith.science/api/pith-number/WE4UX53R2K4C4UGMEFYEOIZU5K/graph.json","events_json":"https://pith.science/api/pith-number/WE4UX53R2K4C4UGMEFYEOIZU5K/events.json","paper":"https://pith.science/paper/WE4UX53R"},"agent_actions":{"view_html":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K","download_json":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K.json","view_paper":"https://pith.science/paper/WE4UX53R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4161&json=true","fetch_graph":"https://pith.science/api/pith-number/WE4UX53R2K4C4UGMEFYEOIZU5K/graph.json","fetch_events":"https://pith.science/api/pith-number/WE4UX53R2K4C4UGMEFYEOIZU5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K/action/storage_attestation","attest_author":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K/action/author_attestation","sign_citation":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K/action/citation_signature","submit_replication":"https://pith.science/pith/WE4UX53R2K4C4UGMEFYEOIZU5K/action/replication_record"}},"created_at":"2026-05-18T03:20:36.950806+00:00","updated_at":"2026-05-18T03:20:36.950806+00:00"}