{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OWV4OHPXRS7ELLI6EI52JZUWRA","short_pith_number":"pith:OWV4OHPX","schema_version":"1.0","canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","source":{"kind":"arxiv","id":"1904.12804","version":1},"attestation_state":"computed","paper":{"title":"The I/O complexity of hybrid algorithms for square matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lorenzo De Stefani","submitted_at":"2019-04-29T16:39:50Z","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"},"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":"1904.12804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-29T16:39:50Z","cross_cats_sorted":[],"title_canon_sha256":"9a68a237397e0ae5a752998e98b49f7f8140a18c8617ee334dc84334944c6dcc","abstract_canon_sha256":"c2f29e120d74c88a01aa045a58a323e70bd2e938fcf92790176c44b34aeeeb6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:32.217676Z","signature_b64":"swX1YbfINokA4f0bOj7h44+7jo2MOmHXmYT78gXgvDYhJX1AxG5wfLG3TO9QjVg28EvSF5OMR3eHf7cfcEmSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","last_reissued_at":"2026-05-17T23:47:32.217071Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:32.217071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The I/O complexity of hybrid algorithms for square matrix multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lorenzo De Stefani","submitted_at":"2019-04-29T16:39:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12804","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":"1904.12804","created_at":"2026-05-17T23:47:32.217188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12804v1","created_at":"2026-05-17T23:47:32.217188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12804","created_at":"2026-05-17T23:47:32.217188+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWV4OHPXRS7E","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWV4OHPXRS7ELLI6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWV4OHPX","created_at":"2026-05-18T12:33:24.271573+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/OWV4OHPXRS7ELLI6EI52JZUWRA","json":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA.json","graph_json":"https://pith.science/api/pith-number/OWV4OHPXRS7ELLI6EI52JZUWRA/graph.json","events_json":"https://pith.science/api/pith-number/OWV4OHPXRS7ELLI6EI52JZUWRA/events.json","paper":"https://pith.science/paper/OWV4OHPX"},"agent_actions":{"view_html":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA","download_json":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA.json","view_paper":"https://pith.science/paper/OWV4OHPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12804&json=true","fetch_graph":"https://pith.science/api/pith-number/OWV4OHPXRS7ELLI6EI52JZUWRA/graph.json","fetch_events":"https://pith.science/api/pith-number/OWV4OHPXRS7ELLI6EI52JZUWRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/action/storage_attestation","attest_author":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/action/author_attestation","sign_citation":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/action/citation_signature","submit_replication":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/action/replication_record"}},"created_at":"2026-05-17T23:47:32.217188+00:00","updated_at":"2026-05-17T23:47:32.217188+00:00"}