{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:63H574GFA6XGDI73DFBNHW7BRV","short_pith_number":"pith:63H574GF","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"},"canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","source":{"kind":"arxiv","id":"2607.01427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01427","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01427v1","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01427","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"63H574GFA6XG","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"63H574GFA6XGDI73","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"63H574GF","created_at":"2026-07-03T00:16:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:63H574GFA6XGDI73DFBNHW7BRV","target":"record","payload":{"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"},"canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","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"},"source_kind":"arxiv","source_id":"2607.01427","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-07-03T00:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LRtUKkYuXVS5Qgugc0/Qmguyr3DRrm35jPPKTNj9Jwm0M+gRHJF3rz+KdrO/Vug2ircUwtp1RF6KJNiEerhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:49:35.404416Z"},"content_sha256":"055b5c05f4c8cc27e0576c0deeec29dc57e42ea4dc1222328d55e222c461e163","schema_version":"1.0","event_id":"sha256:055b5c05f4c8cc27e0576c0deeec29dc57e42ea4dc1222328d55e222c461e163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:63H574GFA6XGDI73DFBNHW7BRV","target":"graph","payload":{"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"},"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-07-03T00:16:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m4JtGZQA71ma7SmlKvRGgscDzBLbPMBZByYxu5iz8qMCYsFSgBW0SGUxKYA2vpCH7NeWG9b2+bAtLP37BVHJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:49:35.404930Z"},"content_sha256":"4acb8149dc54736b35a888228f0b148e7dc717793da950f86c34c307b57fec6c","schema_version":"1.0","event_id":"sha256:4acb8149dc54736b35a888228f0b148e7dc717793da950f86c34c307b57fec6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/bundle.json","state_url":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63H574GFA6XGDI73DFBNHW7BRV/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-07-31T15:49:35Z","links":{"resolver":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV","bundle":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/bundle.json","state":"https://pith.science/pith/63H574GFA6XGDI73DFBNHW7BRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63H574GFA6XGDI73DFBNHW7BRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:63H574GFA6XGDI73DFBNHW7BRV","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":"6d2d89ffb9ede783f599600ed730738074799eaa1c5c3a3231f02bf8fc6e906a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T19:44:56Z","title_canon_sha256":"01ed793cd8d6b1fb4d8e8af5d4a4d43f473778e1b68efd13ff8f431e9daf2666"},"schema_version":"1.0","source":{"id":"2607.01427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01427","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01427v1","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01427","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_12","alias_value":"63H574GFA6XG","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_16","alias_value":"63H574GFA6XGDI73","created_at":"2026-07-03T00:16:59Z"},{"alias_kind":"pith_short_8","alias_value":"63H574GF","created_at":"2026-07-03T00:16:59Z"}],"graph_snapshots":[{"event_id":"sha256:4acb8149dc54736b35a888228f0b148e7dc717793da950f86c34c307b57fec6c","target":"graph","created_at":"2026-07-03T00:16:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.01427/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Karl Bringmann, Nick Fischer, Vasileios Nakos","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T19:44:56Z","title":"Robustifying Sparse Matrix Multiplication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01427","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:055b5c05f4c8cc27e0576c0deeec29dc57e42ea4dc1222328d55e222c461e163","target":"record","created_at":"2026-07-03T00:16:59Z","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":"6d2d89ffb9ede783f599600ed730738074799eaa1c5c3a3231f02bf8fc6e906a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T19:44:56Z","title_canon_sha256":"01ed793cd8d6b1fb4d8e8af5d4a4d43f473778e1b68efd13ff8f431e9daf2666"},"schema_version":"1.0","source":{"id":"2607.01427","kind":"arxiv","version":1}},"canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6cfdff0c507ae61a3fb1942d3dbe18d60c98a26704dccacaf515495700a4127","first_computed_at":"2026-07-03T00:16:59.994795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T00:16:59.994795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/iCiV3DPgSW+D6edkZVd+ikcxhpsMPI9MRHVcAvYPfWXG3TDBKWniM4DVXO+Cf1P+5UeYU0L4sp4Z1E0TdadDQ==","signature_status":"signed_v1","signed_at":"2026-07-03T00:16:59.995228Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:055b5c05f4c8cc27e0576c0deeec29dc57e42ea4dc1222328d55e222c461e163","sha256:4acb8149dc54736b35a888228f0b148e7dc717793da950f86c34c307b57fec6c"],"state_sha256":"b915db3b366c5bc520efbc373b0cf6827dcc975644ab4fbf73f347992f59dac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yErI3dqJErWM7b42GA+o02ZeI5dXtmJmm3YQwU5bWFKGnFqp6rk/uFxLaDv/lhSuPBk2yZJN02HCWd095hcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T15:49:35.420263Z","bundle_sha256":"063ce5d81c694324b8ba49892cde84c08661850d4210b1a3a8d4b2664bc628b8"}}