{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VRL2T2VJ72PSOGSQCWGGHO26FS","short_pith_number":"pith:VRL2T2VJ","schema_version":"1.0","canonical_sha256":"ac57a9eaa9fe9f271a50158c63bb5e2cbd06623bcc4f10ceae3113aba8ee1263","source":{"kind":"arxiv","id":"1702.02017","version":2},"attestation_state":"computed","paper":{"title":"A Tight I/O Lower Bound for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bradley Lowery, Julien Langou, Robert A. van de Geijn, Tyler Michael Smith","submitted_at":"2017-02-03T22:34:34Z","abstract_excerpt":"A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of segments needed to perform $C:=AB$, for distinct matrices $A$, $B$, and $C$, where each segment is a series of operations involving $M$ reads and writes to and from fast memory, and $M$ is the size of fast memory. A lower bound on the number of segments was then determined by obtaining an upper bound on the number of elementary multiplications performed per segment. This pap"},"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":"1702.02017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-03T22:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"617f4153cf802bb830d188bd0ccab088a37282126b18fa98acdb028128f1ae02","abstract_canon_sha256":"757b8bd4d1ea0861f236fd82584b205da600482af5d5f1d40cd9b9ce658f1b80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:41.880412Z","signature_b64":"AEGzJnMwz7Ss0fn92HUHjDw3xRaAPBrIcvkXb6Xf/ncBZK76Tik25ysW3mHFgyyDVZ+mBlsppJTZxp8HCHbdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac57a9eaa9fe9f271a50158c63bb5e2cbd06623bcc4f10ceae3113aba8ee1263","last_reissued_at":"2026-05-17T23:54:41.879726Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:41.879726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight I/O Lower Bound for Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Bradley Lowery, Julien Langou, Robert A. van de Geijn, Tyler Michael Smith","submitted_at":"2017-02-03T22:34:34Z","abstract_excerpt":"A tight lower bound for required I/O when computing an ordinary matrix-matrix multiplication on a processor with two layers of memory is established. Prior work obtained weaker lower bounds by reasoning about the number of segments needed to perform $C:=AB$, for distinct matrices $A$, $B$, and $C$, where each segment is a series of operations involving $M$ reads and writes to and from fast memory, and $M$ is the size of fast memory. A lower bound on the number of segments was then determined by obtaining an upper bound on the number of elementary multiplications performed per segment. This pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02017","kind":"arxiv","version":2},"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":"1702.02017","created_at":"2026-05-17T23:54:41.879848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02017v2","created_at":"2026-05-17T23:54:41.879848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02017","created_at":"2026-05-17T23:54:41.879848+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRL2T2VJ72PS","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRL2T2VJ72PSOGSQ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRL2T2VJ","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07311","citing_title":"A Proposed Framework for Advanced (Multi)Linear Infrastructure in Engineering and Science (FAMLIES)","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS","json":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS.json","graph_json":"https://pith.science/api/pith-number/VRL2T2VJ72PSOGSQCWGGHO26FS/graph.json","events_json":"https://pith.science/api/pith-number/VRL2T2VJ72PSOGSQCWGGHO26FS/events.json","paper":"https://pith.science/paper/VRL2T2VJ"},"agent_actions":{"view_html":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS","download_json":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS.json","view_paper":"https://pith.science/paper/VRL2T2VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02017&json=true","fetch_graph":"https://pith.science/api/pith-number/VRL2T2VJ72PSOGSQCWGGHO26FS/graph.json","fetch_events":"https://pith.science/api/pith-number/VRL2T2VJ72PSOGSQCWGGHO26FS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS/action/storage_attestation","attest_author":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS/action/author_attestation","sign_citation":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS/action/citation_signature","submit_replication":"https://pith.science/pith/VRL2T2VJ72PSOGSQCWGGHO26FS/action/replication_record"}},"created_at":"2026-05-17T23:54:41.879848+00:00","updated_at":"2026-05-17T23:54:41.879848+00:00"}