{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6RWQPB62JKEPYLGYAOZMPGNI2U","short_pith_number":"pith:6RWQPB62","schema_version":"1.0","canonical_sha256":"f46d0787da4a88fc2cd803b2c799a8d5201278d7b1911e9e95036bf2123a9dbf","source":{"kind":"arxiv","id":"1906.08613","version":1},"attestation_state":"computed","paper":{"title":"Program Generation for Linear Algebra Using Multiple Layers of DSLs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"(2) RWTH Aachen University), Daniele G. Spampinato (1), Diego Fabregat-Traver (2), Markus P\\\"uschel (1), Paolo Bientinesi (2) ((1) ETH Zurich","submitted_at":"2019-06-20T13:44:41Z","abstract_excerpt":"Numerical software in computational science and engineering often relies on highly-optimized building blocks from libraries such as BLAS and LAPACK, and while such libraries provide portable performance for a wide range of computing architectures, they still present limitations in terms of flexibility. We advocate a domain-specific program generator capable of producing library routines tailored to the specific needs of the application in terms of sizes, interface, and target architecture."},"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":"1906.08613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2019-06-20T13:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"0f9f27d67343b3c7fc5270f5c3d3fde6b24454342149691f51fd2b1a3deaaebf","abstract_canon_sha256":"82ff2da977036ca2a5773107149475797b034f820a5893221145a3ad6940d8d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:51.939967Z","signature_b64":"yVVRxL9asbES0sCJJUh4n4rC8MIxwb+9GcpEhkbyuKKJCROPEYo8SDxJe6ftZ57I62SGZZ0XO+AiEIlmDyq7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f46d0787da4a88fc2cd803b2c799a8d5201278d7b1911e9e95036bf2123a9dbf","last_reissued_at":"2026-05-17T23:42:51.939380Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:51.939380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Program Generation for Linear Algebra Using Multiple Layers of DSLs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"(2) RWTH Aachen University), Daniele G. Spampinato (1), Diego Fabregat-Traver (2), Markus P\\\"uschel (1), Paolo Bientinesi (2) ((1) ETH Zurich","submitted_at":"2019-06-20T13:44:41Z","abstract_excerpt":"Numerical software in computational science and engineering often relies on highly-optimized building blocks from libraries such as BLAS and LAPACK, and while such libraries provide portable performance for a wide range of computing architectures, they still present limitations in terms of flexibility. We advocate a domain-specific program generator capable of producing library routines tailored to the specific needs of the application in terms of sizes, interface, and target architecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08613","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":"1906.08613","created_at":"2026-05-17T23:42:51.939470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08613v1","created_at":"2026-05-17T23:42:51.939470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08613","created_at":"2026-05-17T23:42:51.939470+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RWQPB62JKEP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RWQPB62JKEPYLGY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RWQPB62","created_at":"2026-05-18T12:33:10.108867+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/6RWQPB62JKEPYLGYAOZMPGNI2U","json":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U.json","graph_json":"https://pith.science/api/pith-number/6RWQPB62JKEPYLGYAOZMPGNI2U/graph.json","events_json":"https://pith.science/api/pith-number/6RWQPB62JKEPYLGYAOZMPGNI2U/events.json","paper":"https://pith.science/paper/6RWQPB62"},"agent_actions":{"view_html":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U","download_json":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U.json","view_paper":"https://pith.science/paper/6RWQPB62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08613&json=true","fetch_graph":"https://pith.science/api/pith-number/6RWQPB62JKEPYLGYAOZMPGNI2U/graph.json","fetch_events":"https://pith.science/api/pith-number/6RWQPB62JKEPYLGYAOZMPGNI2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U/action/storage_attestation","attest_author":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U/action/author_attestation","sign_citation":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U/action/citation_signature","submit_replication":"https://pith.science/pith/6RWQPB62JKEPYLGYAOZMPGNI2U/action/replication_record"}},"created_at":"2026-05-17T23:42:51.939470+00:00","updated_at":"2026-05-17T23:42:51.939470+00:00"}