{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2R4IKJPMJSMLNTMHMCMVHSSAGA","short_pith_number":"pith:2R4IKJPM","schema_version":"1.0","canonical_sha256":"d4788525ec4c98b6cd87609953ca403007c02f87a1bc32b944b6c6fc4f8512bc","source":{"kind":"arxiv","id":"1805.04775","version":1},"attestation_state":"computed","paper":{"title":"Program Generation for Small-Scale Linear Algebra Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.PL","authors_text":"((1) ETH Zurich, (2) RWTH Aachen University), Daniele G. Spampinato (1), Diego Fabregat-Traver (2), Markus Pueschel (1), Paolo Bientinesi (2)","submitted_at":"2018-05-12T20:21:40Z","abstract_excerpt":"We present SLinGen, a program generation system for linear algebra. The input to SLinGen is an application expressed mathematically in a linear-algebra-inspired language (LA) that we define. LA provides basic scalar/vector/matrix additions/multiplications and higher level operations including linear systems solvers, Cholesky and LU factorizations. The output of SLinGen is performance-optimized single-source C code, optionally vectorized with intrinsics. The target of SLinGen are small-scale computations on fixed-size operands, for which a straightforward implementation using optimized librarie"},"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":"1805.04775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-05-12T20:21:40Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"ec21de05879f827ea1b8adf7df506662a7eb85e61d2d50afaab4910a792f9d0e","abstract_canon_sha256":"9f4df961ec03d334802f4705edb43387f85e18a3a2d10009d892d4099608cb77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.609052Z","signature_b64":"h82Y7g1JVaB6sSsI/9Xy+C+xLTKkTx9k9UGuqIm+Y+cMt8FIwFXeibJuK7X3DwawNryB5v+jlD9TQx0EHsv5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4788525ec4c98b6cd87609953ca403007c02f87a1bc32b944b6c6fc4f8512bc","last_reissued_at":"2026-05-18T00:16:04.608667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.608667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Generation for Small-Scale Linear Algebra Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.PL","authors_text":"((1) ETH Zurich, (2) RWTH Aachen University), Daniele G. Spampinato (1), Diego Fabregat-Traver (2), Markus Pueschel (1), Paolo Bientinesi (2)","submitted_at":"2018-05-12T20:21:40Z","abstract_excerpt":"We present SLinGen, a program generation system for linear algebra. The input to SLinGen is an application expressed mathematically in a linear-algebra-inspired language (LA) that we define. LA provides basic scalar/vector/matrix additions/multiplications and higher level operations including linear systems solvers, Cholesky and LU factorizations. The output of SLinGen is performance-optimized single-source C code, optionally vectorized with intrinsics. The target of SLinGen are small-scale computations on fixed-size operands, for which a straightforward implementation using optimized librarie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04775","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":""},"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":"1805.04775","created_at":"2026-05-18T00:16:04.608731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04775v1","created_at":"2026-05-18T00:16:04.608731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04775","created_at":"2026-05-18T00:16:04.608731+00:00"},{"alias_kind":"pith_short_12","alias_value":"2R4IKJPMJSML","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2R4IKJPMJSMLNTMH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2R4IKJPM","created_at":"2026-05-18T12:32:02.567920+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/2R4IKJPMJSMLNTMHMCMVHSSAGA","json":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA.json","graph_json":"https://pith.science/api/pith-number/2R4IKJPMJSMLNTMHMCMVHSSAGA/graph.json","events_json":"https://pith.science/api/pith-number/2R4IKJPMJSMLNTMHMCMVHSSAGA/events.json","paper":"https://pith.science/paper/2R4IKJPM"},"agent_actions":{"view_html":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA","download_json":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA.json","view_paper":"https://pith.science/paper/2R4IKJPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04775&json=true","fetch_graph":"https://pith.science/api/pith-number/2R4IKJPMJSMLNTMHMCMVHSSAGA/graph.json","fetch_events":"https://pith.science/api/pith-number/2R4IKJPMJSMLNTMHMCMVHSSAGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA/action/storage_attestation","attest_author":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA/action/author_attestation","sign_citation":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA/action/citation_signature","submit_replication":"https://pith.science/pith/2R4IKJPMJSMLNTMHMCMVHSSAGA/action/replication_record"}},"created_at":"2026-05-18T00:16:04.608731+00:00","updated_at":"2026-05-18T00:16:04.608731+00:00"}