{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PQ5YUVDD57GIKV7JWMN66SDJ5K","short_pith_number":"pith:PQ5YUVDD","schema_version":"1.0","canonical_sha256":"7c3b8a5463efcc8557e9b31bef4869ea9942cb76a47cf03610d71cf291065f7e","source":{"kind":"arxiv","id":"2606.19213","version":1},"attestation_state":"computed","paper":{"title":"Evaluating Rust for Sparse Matrix Kernels in Scientific Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Fabio Durastante, Luca Lombardo","submitted_at":"2026-06-17T15:49:34Z","abstract_excerpt":"Sparse matrix kernels form the computational backbone of scientific computing, traditionally relying on C/C++ and Fortran implementations that prioritize performance over memory safety. This work evaluates Rust as a systems-level alternative for sparse linear algebra by implementing and benchmarking three core workloads: sparse matrix-vector multiplication (SpMV), Lanczos-based Krylov methods, and matrix-exponential evaluation. We compare native Rust code against established baselines (Intel oneMKL, Eigen, PETSc, and PSBLAS) across a suite of representative matrices. Our results show that Rust"},"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":"2606.19213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2026-06-17T15:49:34Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"98e2ce562d3e2dbe1b163b7a3a457abf59181149413fd4c20851fccce210421d","abstract_canon_sha256":"b898d0e7d6e9a159ac98fadcf830b3c5aaa52718f8601d5cee6077f509ed0e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:07.936758Z","signature_b64":"Q+UDYSJ14gOxu+/4naq96FhVjKAG6zHLF5LMMu/quWb/vd4JkCQr9+KLbNaR5bXIjc4NY0ABIdw+ohbXlJgKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c3b8a5463efcc8557e9b31bef4869ea9942cb76a47cf03610d71cf291065f7e","last_reissued_at":"2026-06-19T16:12:07.936411Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:07.936411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Rust for Sparse Matrix Kernels in Scientific Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.MS","authors_text":"Fabio Durastante, Luca Lombardo","submitted_at":"2026-06-17T15:49:34Z","abstract_excerpt":"Sparse matrix kernels form the computational backbone of scientific computing, traditionally relying on C/C++ and Fortran implementations that prioritize performance over memory safety. This work evaluates Rust as a systems-level alternative for sparse linear algebra by implementing and benchmarking three core workloads: sparse matrix-vector multiplication (SpMV), Lanczos-based Krylov methods, and matrix-exponential evaluation. We compare native Rust code against established baselines (Intel oneMKL, Eigen, PETSc, and PSBLAS) across a suite of representative matrices. Our results show that Rust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19213","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/2606.19213/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":"2606.19213","created_at":"2026-06-19T16:12:07.936475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19213v1","created_at":"2026-06-19T16:12:07.936475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19213","created_at":"2026-06-19T16:12:07.936475+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQ5YUVDD57GI","created_at":"2026-06-19T16:12:07.936475+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQ5YUVDD57GIKV7J","created_at":"2026-06-19T16:12:07.936475+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQ5YUVDD","created_at":"2026-06-19T16:12:07.936475+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/PQ5YUVDD57GIKV7JWMN66SDJ5K","json":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K.json","graph_json":"https://pith.science/api/pith-number/PQ5YUVDD57GIKV7JWMN66SDJ5K/graph.json","events_json":"https://pith.science/api/pith-number/PQ5YUVDD57GIKV7JWMN66SDJ5K/events.json","paper":"https://pith.science/paper/PQ5YUVDD"},"agent_actions":{"view_html":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K","download_json":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K.json","view_paper":"https://pith.science/paper/PQ5YUVDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19213&json=true","fetch_graph":"https://pith.science/api/pith-number/PQ5YUVDD57GIKV7JWMN66SDJ5K/graph.json","fetch_events":"https://pith.science/api/pith-number/PQ5YUVDD57GIKV7JWMN66SDJ5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K/action/storage_attestation","attest_author":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K/action/author_attestation","sign_citation":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K/action/citation_signature","submit_replication":"https://pith.science/pith/PQ5YUVDD57GIKV7JWMN66SDJ5K/action/replication_record"}},"created_at":"2026-06-19T16:12:07.936475+00:00","updated_at":"2026-06-19T16:12:07.936475+00:00"}