{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NSGVKJI37UONMZS2EXRSVHKDRO","short_pith_number":"pith:NSGVKJI3","canonical_record":{"source":{"id":"1605.02224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T17:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"eb97e923051951db6a587345792895a71b8cbd5848294d7e0d8f03377f782d96","abstract_canon_sha256":"95aac25639778b5a43963a5606b26b740abed5e183e35658c1cb2536cc3ca7ff"},"schema_version":"1.0"},"canonical_sha256":"6c8d55251bfd1cd6665a25e32a9d438bb98543f5883712c809a5b16fd0987c80","source":{"kind":"arxiv","id":"1605.02224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02224","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02224v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02224","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"NSGVKJI37UON","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NSGVKJI37UONMZS2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NSGVKJI3","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NSGVKJI37UONMZS2EXRSVHKDRO","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T17:53:46Z","cross_cats_sorted":[],"title_canon_sha256":"eb97e923051951db6a587345792895a71b8cbd5848294d7e0d8f03377f782d96","abstract_canon_sha256":"95aac25639778b5a43963a5606b26b740abed5e183e35658c1cb2536cc3ca7ff"},"schema_version":"1.0"},"canonical_sha256":"6c8d55251bfd1cd6665a25e32a9d438bb98543f5883712c809a5b16fd0987c80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.650007Z","signature_b64":"CmQQ9Ec3g1ZlbCw6iFwCLcnDdJtfcCPtpYoYTTPCpb/Syuesn5X5iaLODstB7T8uRW4M85FyYHFDCboZ8zMMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c8d55251bfd1cd6665a25e32a9d438bb98543f5883712c809a5b16fd0987c80","last_reissued_at":"2026-05-18T01:15:21.649418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.649418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02224","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-18T01:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opfXty6aj2jBl2DU2bdx++plTDho4vNrR5fwF+7qKiZBfFUgpvvyfi7G2aDOBvXoHoOV1TnnpI0mJ1c2+SWLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:12:53.425237Z"},"content_sha256":"be3123da2791f78a3ba0c71958ab2280c3696f63699982948cc72eb8eef0cb68","schema_version":"1.0","event_id":"sha256:be3123da2791f78a3ba0c71958ab2280c3696f63699982948cc72eb8eef0cb68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NSGVKJI37UONMZS2EXRSVHKDRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The I/O complexity of Strassen's matrix multiplication with recomputation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gianfranco Bilardi, Lorenzo De Stefani","submitted_at":"2016-05-07T17:53:46Z","abstract_excerpt":"A tight $\\Omega((n/\\sqrt{M})^{\\log_2 7}M)$ lower bound is derived on the \\io complexity of Strassen's algorithm to multiply two $n \\times n$ matrices, in a two-level storage hierarchy with $M$ words of fast memory. A proof technique is introduced, which exploits the Grigoriev's flow of the matrix multiplication function as well as some combinatorial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02224","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-18T01:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x98bCtQoDF2uuLM68CXV0WB/rvR4ah59E9C+HfZmJBeIZ4GzchOiuxbzbYxVsz7PSZ1Cd2z5WO3wa0b4uwzaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:12:53.425602Z"},"content_sha256":"006d6e7a37b104b7a8a969ce7ad7c0c0679141bc361790440ee753953b40e9dd","schema_version":"1.0","event_id":"sha256:006d6e7a37b104b7a8a969ce7ad7c0c0679141bc361790440ee753953b40e9dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSGVKJI37UONMZS2EXRSVHKDRO/bundle.json","state_url":"https://pith.science/pith/NSGVKJI37UONMZS2EXRSVHKDRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSGVKJI37UONMZS2EXRSVHKDRO/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-02T05:12:53Z","links":{"resolver":"https://pith.science/pith/NSGVKJI37UONMZS2EXRSVHKDRO","bundle":"https://pith.science/pith/NSGVKJI37UONMZS2EXRSVHKDRO/bundle.json","state":"https://pith.science/pith/NSGVKJI37UONMZS2EXRSVHKDRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSGVKJI37UONMZS2EXRSVHKDRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NSGVKJI37UONMZS2EXRSVHKDRO","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":"95aac25639778b5a43963a5606b26b740abed5e183e35658c1cb2536cc3ca7ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T17:53:46Z","title_canon_sha256":"eb97e923051951db6a587345792895a71b8cbd5848294d7e0d8f03377f782d96"},"schema_version":"1.0","source":{"id":"1605.02224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02224","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02224v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02224","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"NSGVKJI37UON","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NSGVKJI37UONMZS2","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NSGVKJI3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:006d6e7a37b104b7a8a969ce7ad7c0c0679141bc361790440ee753953b40e9dd","target":"graph","created_at":"2026-05-18T01:15:21Z","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":"A tight $\\Omega((n/\\sqrt{M})^{\\log_2 7}M)$ lower bound is derived on the \\io complexity of Strassen's algorithm to multiply two $n \\times n$ matrices, in a two-level storage hierarchy with $M$ words of fast memory. A proof technique is introduced, which exploits the Grigoriev's flow of the matrix multiplication function as well as some combinatorial properties of the Strassen computational directed acyclic graph (CDAG). Applications to parallel computation are also developed. The result generalizes a similar bound previously obtained under the constraint of no-recomputation, that is, that inte","authors_text":"Gianfranco Bilardi, Lorenzo De Stefani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T17:53:46Z","title":"The I/O complexity of Strassen's matrix multiplication with recomputation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02224","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:be3123da2791f78a3ba0c71958ab2280c3696f63699982948cc72eb8eef0cb68","target":"record","created_at":"2026-05-18T01:15:21Z","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":"95aac25639778b5a43963a5606b26b740abed5e183e35658c1cb2536cc3ca7ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-07T17:53:46Z","title_canon_sha256":"eb97e923051951db6a587345792895a71b8cbd5848294d7e0d8f03377f782d96"},"schema_version":"1.0","source":{"id":"1605.02224","kind":"arxiv","version":1}},"canonical_sha256":"6c8d55251bfd1cd6665a25e32a9d438bb98543f5883712c809a5b16fd0987c80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c8d55251bfd1cd6665a25e32a9d438bb98543f5883712c809a5b16fd0987c80","first_computed_at":"2026-05-18T01:15:21.649418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.649418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CmQQ9Ec3g1ZlbCw6iFwCLcnDdJtfcCPtpYoYTTPCpb/Syuesn5X5iaLODstB7T8uRW4M85FyYHFDCboZ8zMMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.650007Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be3123da2791f78a3ba0c71958ab2280c3696f63699982948cc72eb8eef0cb68","sha256:006d6e7a37b104b7a8a969ce7ad7c0c0679141bc361790440ee753953b40e9dd"],"state_sha256":"58947a545e8bb5bab51441e477837aa862eb5fdd0618a9448ecc1d74e0c0d977"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/dpF69I4TUMAWnsK3p6kOCHVXSyaZxwN4dj/+5x4u0GDiI+2k2v6bqVp0o/EXOA6JjqmqqQdRUHVt9RGsCDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:12:53.427638Z","bundle_sha256":"ab13b479c1611ff96c08dab0fe546f4252d6d1a39e6de7c204693d006b92e6db"}}