{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZEWGHESDXK6WPENVJGMJLNNP57","short_pith_number":"pith:ZEWGHESD","schema_version":"1.0","canonical_sha256":"c92c639243babd6791b5499895b5afeffad19202cdf9c7bf7484621ab029f2da","source":{"kind":"arxiv","id":"1203.1692","version":5},"attestation_state":"computed","paper":{"title":"An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.NA","authors_text":"Matt Challacombe, Nicolas Bock","submitted_at":"2012-03-08T05:33:01Z","abstract_excerpt":"We present an optimized single-precision implementation of the Sparse Approximate Matrix Multiply (\\SpAMM{}) [M. Challacombe and N. Bock, arXiv {\\bf 1011.3534} (2010)], a fast algorithm for matrix-matrix multiplication for matrices with decay that achieves an $\\mathcal{O} (n \\log n)$ computational complexity with respect to matrix dimension $n$. We find that the max norm of the error achieved with a \\SpAMM{} tolerance below $2 \\times 10^{-8}$ is lower than that of the single-precision {\\tt SGEMM} for dense quantum chemical matrices, while outperforming {\\tt SGEMM} with a cross-over already for"},"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":"1203.1692","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-03-08T05:33:01Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"4a0d29adfe4b35e5709bc5b9358e452b1f2c57a62e843018a69883f796da0bbb","abstract_canon_sha256":"cf1a8533fe1bb7e1da4ce1c8e612ca5c1d16826bd99c1718f1958e56b3db2409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:18.366446Z","signature_b64":"hFyAlGb4zkUK+BV8iPiUXjAdY9xnWdS4eL0Fe3jnxvSIx+mmcGodHrloIT6ttR+XLEO3hFurEl3CyZHXq9ucBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c92c639243babd6791b5499895b5afeffad19202cdf9c7bf7484621ab029f2da","last_reissued_at":"2026-05-18T03:46:18.365954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:18.365954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimized Sparse Approximate Matrix Multiply for Matrices with Decay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"cs.NA","authors_text":"Matt Challacombe, Nicolas Bock","submitted_at":"2012-03-08T05:33:01Z","abstract_excerpt":"We present an optimized single-precision implementation of the Sparse Approximate Matrix Multiply (\\SpAMM{}) [M. Challacombe and N. Bock, arXiv {\\bf 1011.3534} (2010)], a fast algorithm for matrix-matrix multiplication for matrices with decay that achieves an $\\mathcal{O} (n \\log n)$ computational complexity with respect to matrix dimension $n$. We find that the max norm of the error achieved with a \\SpAMM{} tolerance below $2 \\times 10^{-8}$ is lower than that of the single-precision {\\tt SGEMM} for dense quantum chemical matrices, while outperforming {\\tt SGEMM} with a cross-over already for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1692","kind":"arxiv","version":5},"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":"1203.1692","created_at":"2026-05-18T03:46:18.366008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.1692v5","created_at":"2026-05-18T03:46:18.366008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1692","created_at":"2026-05-18T03:46:18.366008+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEWGHESDXK6W","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEWGHESDXK6WPENV","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEWGHESD","created_at":"2026-05-18T12:27:30.460161+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/ZEWGHESDXK6WPENVJGMJLNNP57","json":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57.json","graph_json":"https://pith.science/api/pith-number/ZEWGHESDXK6WPENVJGMJLNNP57/graph.json","events_json":"https://pith.science/api/pith-number/ZEWGHESDXK6WPENVJGMJLNNP57/events.json","paper":"https://pith.science/paper/ZEWGHESD"},"agent_actions":{"view_html":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57","download_json":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57.json","view_paper":"https://pith.science/paper/ZEWGHESD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.1692&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEWGHESDXK6WPENVJGMJLNNP57/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEWGHESDXK6WPENVJGMJLNNP57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57/action/storage_attestation","attest_author":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57/action/author_attestation","sign_citation":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57/action/citation_signature","submit_replication":"https://pith.science/pith/ZEWGHESDXK6WPENVJGMJLNNP57/action/replication_record"}},"created_at":"2026-05-18T03:46:18.366008+00:00","updated_at":"2026-05-18T03:46:18.366008+00:00"}