{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OWV4OHPXRS7ELLI6EI52JZUWRA","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":"c2f29e120d74c88a01aa045a58a323e70bd2e938fcf92790176c44b34aeeeb6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-29T16:39:50Z","title_canon_sha256":"9a68a237397e0ae5a752998e98b49f7f8140a18c8617ee334dc84334944c6dcc"},"schema_version":"1.0","source":{"id":"1904.12804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12804","created_at":"2026-05-17T23:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12804v1","created_at":"2026-05-17T23:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12804","created_at":"2026-05-17T23:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"OWV4OHPXRS7E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OWV4OHPXRS7ELLI6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OWV4OHPX","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:2516a6897a49f4c4290989aed0556a5877afcadcae98570c67836274bcc26b1e","target":"graph","created_at":"2026-05-17T23:47:32Z","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":"Asymptotically tight lower bounds are derived for the I/O complexity of a general class of hybrid algorithms computing the product of $n \\times n$ square matrices combining ``\\emph{Strassen-like}'' fast matrix multiplication approach with computational complexity $\\Theta{n^{\\log_2 7}}$, and ``\\emph{standard}'' matrix multiplication algorithms with computational complexity $\\Omega\\left(n^3\\right)$. We present a novel and tight $\\Omega\\left(\\left(\\frac{n}{\\max\\{\\sqrt{M},n_0\\}}\\right)^{\\log_2 7}\\left(\\max\\{1,\\frac{n_0}{M}\\}\\right)^3M\\right)$ lower bound for the I/O complexity a class of ``\\emph{u","authors_text":"Lorenzo De Stefani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-29T16:39:50Z","title":"The I/O complexity of hybrid algorithms for square matrix multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12804","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:f34e8f29b05fae7ca7d8e3278abf59b952dd7cb74cfac8abe5d75f3fc8487b30","target":"record","created_at":"2026-05-17T23:47:32Z","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":"c2f29e120d74c88a01aa045a58a323e70bd2e938fcf92790176c44b34aeeeb6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-29T16:39:50Z","title_canon_sha256":"9a68a237397e0ae5a752998e98b49f7f8140a18c8617ee334dc84334944c6dcc"},"schema_version":"1.0","source":{"id":"1904.12804","kind":"arxiv","version":1}},"canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","first_computed_at":"2026-05-17T23:47:32.217071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:32.217071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"swX1YbfINokA4f0bOj7h44+7jo2MOmHXmYT78gXgvDYhJX1AxG5wfLG3TO9QjVg28EvSF5OMR3eHf7cfcEmSAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:32.217676Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34e8f29b05fae7ca7d8e3278abf59b952dd7cb74cfac8abe5d75f3fc8487b30","sha256:2516a6897a49f4c4290989aed0556a5877afcadcae98570c67836274bcc26b1e"],"state_sha256":"786a494897248be7153b3e3372597497f860c29793d944df13af16bec3fb2b62"}