{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:63H574GFA6XGDI73DFBNHW7BRV","short_pith_number":"pith:63H574GF","schema_version":"1.0","canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","source":{"kind":"arxiv","id":"2607.01427","version":1},"attestation_state":"computed","paper":{"title":"Robustifying Sparse Matrix Multiplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Nick Fischer, Vasileios Nakos","submitted_at":"2026-07-01T19:44:56Z","abstract_excerpt":"In the seminal sparse matrix multiplication problem the goal is to compute the product of two $n \\times n$ matrices when the matrices are sparse, i.e., when the number of nonzeros in the input matrices $m_{in}$ and/or the number of nonzeros in the output matrix $m_{out}$ are much smaller than $n^2$. In this paper, we explore the generalized problem of (approximately) computing the $k$ largest output entries, with an approximation error dependent solely on the smaller entries -- from the viewpoint of sparse recovery, this can be seen as a robust variant of sparse matrix multiplication. Despite "},"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":"2607.01427","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T19:44:56Z","cross_cats_sorted":[],"title_canon_sha256":"01ed793cd8d6b1fb4d8e8af5d4a4d43f473778e1b68efd13ff8f431e9daf2666","abstract_canon_sha256":"6d2d89ffb9ede783f599600ed730738074799eaa1c5c3a3231f02bf8fc6e906a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T00:16:59.995228Z","signature_b64":"/iCiV3DPgSW+D6edkZVd+ikcxhpsMPI9MRHVcAvYPfWXG3TDBKWniM4DVXO+Cf1P+5UeYU0L4sp4Z1E0TdadDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","last_reissued_at":"2026-07-03T00:16:59.994795Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T00:16:59.994795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robustifying Sparse Matrix Multiplication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Karl Bringmann, Nick Fischer, Vasileios Nakos","submitted_at":"2026-07-01T19:44:56Z","abstract_excerpt":"In the seminal sparse matrix multiplication problem the goal is to compute the product of two $n \\times n$ matrices when the matrices are sparse, i.e., when the number of nonzeros in the input matrices $m_{in}$ and/or the number of nonzeros in the output matrix $m_{out}$ are much smaller than $n^2$. In this paper, we explore the generalized problem of (approximately) computing the $k$ largest output entries, with an approximation error dependent solely on the smaller entries -- from the viewpoint of sparse recovery, this can be seen as a robust variant of sparse matrix multiplication. Despite "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01427","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.01427/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.01427","created_at":"2026-07-03T00:16:59.994851+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01427v1","created_at":"2026-07-03T00:16:59.994851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01427","created_at":"2026-07-03T00:16:59.994851+00:00"},{"alias_kind":"pith_short_12","alias_value":"63H574GFA6XG","created_at":"2026-07-03T00:16:59.994851+00:00"},{"alias_kind":"pith_short_16","alias_value":"63H574GFA6XGDI73","created_at":"2026-07-03T00:16:59.994851+00:00"},{"alias_kind":"pith_short_8","alias_value":"63H574GF","created_at":"2026-07-03T00:16:59.994851+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/63H574GFA6XGDI73DFBNHW7BRV","json":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV.json","graph_json":"https://pith.science/api/pith-number/63H574GFA6XGDI73DFBNHW7BRV/graph.json","events_json":"https://pith.science/api/pith-number/63H574GFA6XGDI73DFBNHW7BRV/events.json","paper":"https://pith.science/paper/63H574GF"},"agent_actions":{"view_html":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV","download_json":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV.json","view_paper":"https://pith.science/paper/63H574GF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01427&json=true","fetch_graph":"https://pith.science/api/pith-number/63H574GFA6XGDI73DFBNHW7BRV/graph.json","fetch_events":"https://pith.science/api/pith-number/63H574GFA6XGDI73DFBNHW7BRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/action/storage_attestation","attest_author":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/action/author_attestation","sign_citation":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/action/citation_signature","submit_replication":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/action/replication_record"}},"created_at":"2026-07-03T00:16:59.994851+00:00","updated_at":"2026-07-03T00:16:59.994851+00:00"}