{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:A34TGINT67RNVF6QSHTFGL2KEC","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":"e139fbe8c215d59de69ce3075dcb42486d67179fdf0ae4530fc23e4c151949e1","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-05-15T07:26:56Z","title_canon_sha256":"22826a8eebe46e5d7c99a87b4f19891ccd9c456f0487d2e590d966f8044f46f9"},"schema_version":"1.0","source":{"id":"0905.2485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.2485","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"arxiv_version","alias_value":"0905.2485v1","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2485","created_at":"2026-05-18T04:12:55Z"},{"alias_kind":"pith_short_12","alias_value":"A34TGINT67RN","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"A34TGINT67RNVF6Q","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"A34TGINT","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6bcf287bc643b6c92d30d6621d9e3076cf0fc3a2dad6ff464133e2920c8d3c42","target":"graph","created_at":"2026-05-18T04:12:55Z","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":"In 1981 Hong and Kung proved a lower bound on the amount of communication needed to perform dense, matrix-multiplication using the conventional $O(n^3)$ algorithm, where the input matrices were too large to fit in the small, fast memory. In 2004 Irony, Toledo and Tiskin gave a new proof of this result and extended it to the parallel case. In both cases the lower bound may be expressed as $\\Omega$(#arithmetic operations / $\\sqrt{M}$), where M is the size of the fast memory (or local memory in the parallel case). Here we generalize these results to a much wider variety of algorithms, including L","authors_text":"Grey Ballard, James Demmel, Oded Schwartz, Olga Holtz","cross_cats":["cs.DS","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-05-15T07:26:56Z","title":"Minimizing Communication in Linear Algebra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2485","kind":"arxiv","version":1},"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:dc818486ee1dcd5e9726dcd103f06663e9ffa4995e1af776c5b96f2a58c5b510","target":"record","created_at":"2026-05-18T04:12:55Z","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":"e139fbe8c215d59de69ce3075dcb42486d67179fdf0ae4530fc23e4c151949e1","cross_cats_sorted":["cs.DS","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-05-15T07:26:56Z","title_canon_sha256":"22826a8eebe46e5d7c99a87b4f19891ccd9c456f0487d2e590d966f8044f46f9"},"schema_version":"1.0","source":{"id":"0905.2485","kind":"arxiv","version":1}},"canonical_sha256":"06f93321b3f7e2da97d091e6532f4a20b50b1a11987c1e00860b73c0869264c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06f93321b3f7e2da97d091e6532f4a20b50b1a11987c1e00860b73c0869264c2","first_computed_at":"2026-05-18T04:12:55.166615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:55.166615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quOLFKxMVPl9GN6kUvjBq/FgyDraJ/d0wLw48WVg1NtFIPpRCUZy1f8IfvavZilz6hdyIMbT+IVaRakYIksJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:55.167137Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.2485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc818486ee1dcd5e9726dcd103f06663e9ffa4995e1af776c5b96f2a58c5b510","sha256:6bcf287bc643b6c92d30d6621d9e3076cf0fc3a2dad6ff464133e2920c8d3c42"],"state_sha256":"d2334bf424ef4697e0ddb24272edc1ff8e4b295a3e28d8abc7c59e401c8f0f05"}