{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LYH2JIAXADUEOVTDXLR4TAAYLO","short_pith_number":"pith:LYH2JIAX","schema_version":"1.0","canonical_sha256":"5e0fa4a01700e8475663bae3c980185b9db7086acc146bcb351254c66535e2bc","source":{"kind":"arxiv","id":"1811.08768","version":3},"attestation_state":"computed","paper":{"title":"Practical Sparse Matrices in C++ with Hybrid Storage and Template-Based Expression Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Conrad Sanderson, Ryan Curtin","submitted_at":"2018-11-20T06:47:37Z","abstract_excerpt":"Despite the importance of sparse matrices in numerous fields of science, software implementations remain difficult to use for non-expert users, generally requiring the understanding of underlying details of the chosen sparse matrix storage format. In addition, to achieve good performance, several formats may need to be used in one program, requiring explicit selection and conversion between the formats. This can be both tedious and error-prone, especially for non-expert users. Motivated by these issues, we present a user-friendly and open-source sparse matrix class for the C++ language, with 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":"1811.08768","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-11-20T06:47:37Z","cross_cats_sorted":[],"title_canon_sha256":"86eb29eea75f28615c6e6b2e61ed2fc132b3209c2c320f0e84598751196ee7c6","abstract_canon_sha256":"c931eeff3bf470b88b20b046f67421f51e32ed0ede3d51f77cbe2194c250b298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:04.062894Z","signature_b64":"h0vSwoPMPk0ryf5vojeFHs9ZwJgXPdnDkD5IcPu0sob5gsOuUaO93EEhLEm3Br0NMOnhnIFCqDf5J8a0AnCSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0fa4a01700e8475663bae3c980185b9db7086acc146bcb351254c66535e2bc","last_reissued_at":"2026-05-17T23:40:04.062228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:04.062228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical Sparse Matrices in C++ with Hybrid Storage and Template-Based Expression Optimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Conrad Sanderson, Ryan Curtin","submitted_at":"2018-11-20T06:47:37Z","abstract_excerpt":"Despite the importance of sparse matrices in numerous fields of science, software implementations remain difficult to use for non-expert users, generally requiring the understanding of underlying details of the chosen sparse matrix storage format. In addition, to achieve good performance, several formats may need to be used in one program, requiring explicit selection and conversion between the formats. This can be both tedious and error-prone, especially for non-expert users. Motivated by these issues, we present a user-friendly and open-source sparse matrix class for the C++ language, with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08768","kind":"arxiv","version":3},"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":"1811.08768","created_at":"2026-05-17T23:40:04.062331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08768v3","created_at":"2026-05-17T23:40:04.062331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08768","created_at":"2026-05-17T23:40:04.062331+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYH2JIAXADUE","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYH2JIAXADUEOVTD","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYH2JIAX","created_at":"2026-05-18T12:32:37.024351+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/LYH2JIAXADUEOVTDXLR4TAAYLO","json":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO.json","graph_json":"https://pith.science/api/pith-number/LYH2JIAXADUEOVTDXLR4TAAYLO/graph.json","events_json":"https://pith.science/api/pith-number/LYH2JIAXADUEOVTDXLR4TAAYLO/events.json","paper":"https://pith.science/paper/LYH2JIAX"},"agent_actions":{"view_html":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO","download_json":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO.json","view_paper":"https://pith.science/paper/LYH2JIAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08768&json=true","fetch_graph":"https://pith.science/api/pith-number/LYH2JIAXADUEOVTDXLR4TAAYLO/graph.json","fetch_events":"https://pith.science/api/pith-number/LYH2JIAXADUEOVTDXLR4TAAYLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO/action/storage_attestation","attest_author":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO/action/author_attestation","sign_citation":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO/action/citation_signature","submit_replication":"https://pith.science/pith/LYH2JIAXADUEOVTDXLR4TAAYLO/action/replication_record"}},"created_at":"2026-05-17T23:40:04.062331+00:00","updated_at":"2026-05-17T23:40:04.062331+00:00"}