{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OWV4OHPXRS7ELLI6EI52JZUWRA","short_pith_number":"pith:OWV4OHPX","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"},"canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","source":{"kind":"arxiv","id":"1904.12804","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OWV4OHPXRS7ELLI6EI52JZUWRA","target":"record","payload":{"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"},"canonical_sha256":"75abc71df78cbe45ad1e223ba4e696880b50080098d8736ef596f69bef200bf8","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"},"source_kind":"arxiv","source_id":"1904.12804","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-17T23:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buVj6avHH+m6dYNV7srr9v4U7L2FJelr3yHUH7tZAOxwNubL0wYVLO2uWy/wjLIqsUUgIQ/OozXyRCqilMdoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:55:42.816179Z"},"content_sha256":"f34e8f29b05fae7ca7d8e3278abf59b952dd7cb74cfac8abe5d75f3fc8487b30","schema_version":"1.0","event_id":"sha256:f34e8f29b05fae7ca7d8e3278abf59b952dd7cb74cfac8abe5d75f3fc8487b30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OWV4OHPXRS7ELLI6EI52JZUWRA","target":"graph","payload":{"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"},"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-17T23:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yg0uaTzCEz+1tycUrfyFzgt5O68SjoLjspHz+RhtXyfV/abKdDaLyTiER0Q+mnxIf/9apI02zfaqrl0h5o2wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:55:42.816555Z"},"content_sha256":"2516a6897a49f4c4290989aed0556a5877afcadcae98570c67836274bcc26b1e","schema_version":"1.0","event_id":"sha256:2516a6897a49f4c4290989aed0556a5877afcadcae98570c67836274bcc26b1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/bundle.json","state_url":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/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-06-23T23:55:42Z","links":{"resolver":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA","bundle":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/bundle.json","state":"https://pith.science/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWV4OHPXRS7ELLI6EI52JZUWRA/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgRKXUuRi7fs8YIfXWAhaEZ1EZwg+++qjJInbxpq7lIeN7inDebtO8e5mTL48XF6Jb1TeDOWAmaZOfmGMdtbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:55:42.818535Z","bundle_sha256":"a055a36ee38a7b722e5f86a4ffa38ae8f8c68f13dfed3d7ae1c95e696dd24652"}}