{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6YQZ7Q74IZEGBCW7TGXZIV7J6I","short_pith_number":"pith:6YQZ7Q74","canonical_record":{"source":{"id":"1109.1693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-08T11:36:00Z","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"title_canon_sha256":"b18d056c987d93c44a44c6343acde1a12acc7995ada3311214fbc1215ef648f6","abstract_canon_sha256":"70cee293ca3c2c8df32a3d13fcee9372d117976aed5a4da78e60a14854b28d92"},"schema_version":"1.0"},"canonical_sha256":"f6219fc3fc4648608adf99af9457e9f218c72e867031d7562cae9e4e1952da5d","source":{"kind":"arxiv","id":"1109.1693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1693","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1693v1","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1693","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"6YQZ7Q74IZEG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6YQZ7Q74IZEGBCW7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6YQZ7Q74","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6YQZ7Q74IZEGBCW7TGXZIV7J6I","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-08T11:36:00Z","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"title_canon_sha256":"b18d056c987d93c44a44c6343acde1a12acc7995ada3311214fbc1215ef648f6","abstract_canon_sha256":"70cee293ca3c2c8df32a3d13fcee9372d117976aed5a4da78e60a14854b28d92"},"schema_version":"1.0"},"canonical_sha256":"f6219fc3fc4648608adf99af9457e9f218c72e867031d7562cae9e4e1952da5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:46.700432Z","signature_b64":"z08mIDhrKtj8qcQp2KWJOIfW0axCbAOCTXQ1MifLo4w8T4GUG73HKq2NrH+OS/8AFIWXAhfMz2LEhTP32PDqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6219fc3fc4648608adf99af9457e9f218c72e867031d7562cae9e4e1952da5d","last_reissued_at":"2026-05-18T04:13:46.700077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:46.700077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1693","source_version":1,"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-18T04:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ynSr5dYfbJHPJXzl8wvZm5DNHIxrqPqnnSRTL6pGsaXoTWjxERutgQJflmeHah+MvDYbyWL6SBc9qfQsWdPDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:02:47.737779Z"},"content_sha256":"18e178ea7c29126a06435d310e2e697d50ff632862707bb1783a36da6300f0fd","schema_version":"1.0","event_id":"sha256:18e178ea7c29126a06435d310e2e697d50ff632862707bb1783a36da6300f0fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6YQZ7Q74IZEGBCW7TGXZIV7J6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Expansion and Communication Costs of Fast 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":"Grey Ballard, James Demmel, Oded Schwartz, Olga Holtz","submitted_at":"2011-09-08T11:36:00Z","abstract_excerpt":"The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain first lower bounds on their communication costs.\n  In the sequential case, where the processor has a fast memory of size $M$, too small to store three $n$-by-$n$ matrices, the lower bound on the number of words moved between fast and slow memory is, for many of the matrix multiplication algorithms, $\\Omega((\\frac{n}{\\sqrt M})^{\\omega_0}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1693","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"},"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-18T04:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsBiAguPt1wOzqDLnrC7PgfzsWdFGrjuE33NU7SQHXqwNPVNJdda0KVIiEW0htXZpKh6Sgec6sZ8LDD+zj+WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:02:47.738136Z"},"content_sha256":"b197995a25666d874fbf0708dc0e3cb57e8b83fb18816702f7cf3614ee01195c","schema_version":"1.0","event_id":"sha256:b197995a25666d874fbf0708dc0e3cb57e8b83fb18816702f7cf3614ee01195c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/bundle.json","state_url":"https://pith.science/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/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-31T22:02:47Z","links":{"resolver":"https://pith.science/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I","bundle":"https://pith.science/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/bundle.json","state":"https://pith.science/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6YQZ7Q74IZEGBCW7TGXZIV7J6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6YQZ7Q74IZEGBCW7TGXZIV7J6I","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":"70cee293ca3c2c8df32a3d13fcee9372d117976aed5a4da78e60a14854b28d92","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-08T11:36:00Z","title_canon_sha256":"b18d056c987d93c44a44c6343acde1a12acc7995ada3311214fbc1215ef648f6"},"schema_version":"1.0","source":{"id":"1109.1693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1693","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1693v1","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1693","created_at":"2026-05-18T04:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"6YQZ7Q74IZEG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6YQZ7Q74IZEGBCW7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6YQZ7Q74","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:b197995a25666d874fbf0708dc0e3cb57e8b83fb18816702f7cf3614ee01195c","target":"graph","created_at":"2026-05-18T04:13:46Z","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":"The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstrate this on Strassen's and other fast matrix multiplication algorithms, and obtain first lower bounds on their communication costs.\n  In the sequential case, where the processor has a fast memory of size $M$, too small to store three $n$-by-$n$ matrices, the lower bound on the number of words moved between fast and slow memory is, for many of the matrix multiplication algorithms, $\\Omega((\\frac{n}{\\sqrt M})^{\\omega_0}","authors_text":"Grey Ballard, James Demmel, Oded Schwartz, Olga Holtz","cross_cats":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-08T11:36:00Z","title":"Graph Expansion and Communication Costs of Fast Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1693","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:18e178ea7c29126a06435d310e2e697d50ff632862707bb1783a36da6300f0fd","target":"record","created_at":"2026-05-18T04:13:46Z","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":"70cee293ca3c2c8df32a3d13fcee9372d117976aed5a4da78e60a14854b28d92","cross_cats_sorted":["cs.CC","cs.DC","cs.NA","math.CO","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-08T11:36:00Z","title_canon_sha256":"b18d056c987d93c44a44c6343acde1a12acc7995ada3311214fbc1215ef648f6"},"schema_version":"1.0","source":{"id":"1109.1693","kind":"arxiv","version":1}},"canonical_sha256":"f6219fc3fc4648608adf99af9457e9f218c72e867031d7562cae9e4e1952da5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6219fc3fc4648608adf99af9457e9f218c72e867031d7562cae9e4e1952da5d","first_computed_at":"2026-05-18T04:13:46.700077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:46.700077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z08mIDhrKtj8qcQp2KWJOIfW0axCbAOCTXQ1MifLo4w8T4GUG73HKq2NrH+OS/8AFIWXAhfMz2LEhTP32PDqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:46.700432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18e178ea7c29126a06435d310e2e697d50ff632862707bb1783a36da6300f0fd","sha256:b197995a25666d874fbf0708dc0e3cb57e8b83fb18816702f7cf3614ee01195c"],"state_sha256":"9eef424d2f5f87395a8f786ec620b5371d7cd459a94f47eaa402e9809f4536af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dlVvli4b07keJRjYIw9J3W4prVIgm9p1sQtK4JPqjDgjw/ihAxVKRxjhFRHouGNEcdgOv1pLNVczu8BYvpiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:02:47.740185Z","bundle_sha256":"e1c9996d212f49fc89df4676dcc5ebc833e5ce5d0d3df1aed38b123a13a7b957"}}