{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TCIQVIK7V35KXD3I77JVFWYD5O","short_pith_number":"pith:TCIQVIK7","schema_version":"1.0","canonical_sha256":"98910aa15faefaab8f68ffd352db03eb9bf2078b4ba88a052658a7d2dcbd5883","source":{"kind":"arxiv","id":"1403.3551","version":1},"attestation_state":"computed","paper":{"title":"The Input/Output Complexity of Sparse Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morten St\\\"ockel, Rasmus Pagh","submitted_at":"2014-03-14T12:18:26Z","abstract_excerpt":"We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC '81) it was shown that to compute a product of dense $U \\times U$ matrices, $\\Theta \\left(U^3 / (B \\sqrt{M}) \\right)$ I/Os are necessary and sufficient in the I/O model with internal memory size $M$ and memory block size $B$.\n  In this paper we generalize the upper and lower bounds of Hong and Kung to the sparse case. Our bounds depend of the number $N = \\mathtt{nnz}(A)+\\mathtt{nnz}(C)$ of nonzero entries in $A$ "},"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":"1403.3551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-14T12:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"0f1eb0cb1d93f3297f2d1ee484b541945ec8d6f4be4b342b353e305ef18701ba","abstract_canon_sha256":"ea6152934f55dbaee8a9d81d45f0bb6ecb29833bbdcf8cb592e9da945e3cc5a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:20.158329Z","signature_b64":"Cu/7eXyhWImEwNw1+L2FqPMPF3TN6WHO+oRYfckCyXNafeS2BdTdX+GWE1FW8xSfpW4m0D2EIyOu/l4aSHb2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98910aa15faefaab8f68ffd352db03eb9bf2078b4ba88a052658a7d2dcbd5883","last_reissued_at":"2026-05-18T02:56:20.157616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:20.157616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Input/Output Complexity of Sparse Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morten St\\\"ockel, Rasmus Pagh","submitted_at":"2014-03-14T12:18:26Z","abstract_excerpt":"We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC '81) it was shown that to compute a product of dense $U \\times U$ matrices, $\\Theta \\left(U^3 / (B \\sqrt{M}) \\right)$ I/Os are necessary and sufficient in the I/O model with internal memory size $M$ and memory block size $B$.\n  In this paper we generalize the upper and lower bounds of Hong and Kung to the sparse case. Our bounds depend of the number $N = \\mathtt{nnz}(A)+\\mathtt{nnz}(C)$ of nonzero entries in $A$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3551","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":"1403.3551","created_at":"2026-05-18T02:56:20.157727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3551v1","created_at":"2026-05-18T02:56:20.157727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3551","created_at":"2026-05-18T02:56:20.157727+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCIQVIK7V35K","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCIQVIK7V35KXD3I","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCIQVIK7","created_at":"2026-05-18T12:28:49.207871+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/TCIQVIK7V35KXD3I77JVFWYD5O","json":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O.json","graph_json":"https://pith.science/api/pith-number/TCIQVIK7V35KXD3I77JVFWYD5O/graph.json","events_json":"https://pith.science/api/pith-number/TCIQVIK7V35KXD3I77JVFWYD5O/events.json","paper":"https://pith.science/paper/TCIQVIK7"},"agent_actions":{"view_html":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O","download_json":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O.json","view_paper":"https://pith.science/paper/TCIQVIK7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3551&json=true","fetch_graph":"https://pith.science/api/pith-number/TCIQVIK7V35KXD3I77JVFWYD5O/graph.json","fetch_events":"https://pith.science/api/pith-number/TCIQVIK7V35KXD3I77JVFWYD5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O/action/storage_attestation","attest_author":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O/action/author_attestation","sign_citation":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O/action/citation_signature","submit_replication":"https://pith.science/pith/TCIQVIK7V35KXD3I77JVFWYD5O/action/replication_record"}},"created_at":"2026-05-18T02:56:20.157727+00:00","updated_at":"2026-05-18T02:56:20.157727+00:00"}