{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PZKCKUUTVUQG4GN3OQI5UXQT4E","short_pith_number":"pith:PZKCKUUT","schema_version":"1.0","canonical_sha256":"7e54255293ad206e19bb7411da5e13e1136e8341c15fd5d46e9e674bc69b1293","source":{"kind":"arxiv","id":"1205.5975","version":1},"attestation_state":"computed","paper":{"title":"A Domain-Specific Compiler for Linear Algebra Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SC"],"primary_cat":"cs.MS","authors_text":"((1) AICES, Diego Fabregat-Traver (1), Paolo Bientinesi (1), RWTH Aachen)","submitted_at":"2012-05-27T15:22:23Z","abstract_excerpt":"We present a prototypical linear algebra compiler that automatically exploits domain-specific knowledge to generate high-performance algorithms. The input to the compiler is a target equation together with knowledge of both the structure of the problem and the properties of the operands. The output is a variety of high-performance algorithms, and the corresponding source code, to solve the target equation. Our approach consists in the decomposition of the input equation into a sequence of library-supported kernels. Since in general such a decomposition is not unique, our compiler returns not o"},"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":"1205.5975","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2012-05-27T15:22:23Z","cross_cats_sorted":["cs.PL","cs.SC"],"title_canon_sha256":"3fc7da7b7c35a40a292f37ee3e0303a98e75d61ac021c943b4c31aa5f8ad6743","abstract_canon_sha256":"9ce7c15bb6dfe66de35d483381604c00faed1ebc9f2dd39befd3e5711a7f342e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:48.633406Z","signature_b64":"WKQ2OU0WYKgwZgMG11hwODhI1kfFpjbTfzyt3jPLsFCvCe/QIV0kWrNQ4KnMo0Of8fbPwJRZz3Urvw3X0I3qAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e54255293ad206e19bb7411da5e13e1136e8341c15fd5d46e9e674bc69b1293","last_reissued_at":"2026-05-18T03:54:48.632725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:48.632725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Domain-Specific Compiler for Linear Algebra Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SC"],"primary_cat":"cs.MS","authors_text":"((1) AICES, Diego Fabregat-Traver (1), Paolo Bientinesi (1), RWTH Aachen)","submitted_at":"2012-05-27T15:22:23Z","abstract_excerpt":"We present a prototypical linear algebra compiler that automatically exploits domain-specific knowledge to generate high-performance algorithms. The input to the compiler is a target equation together with knowledge of both the structure of the problem and the properties of the operands. The output is a variety of high-performance algorithms, and the corresponding source code, to solve the target equation. Our approach consists in the decomposition of the input equation into a sequence of library-supported kernels. Since in general such a decomposition is not unique, our compiler returns not o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5975","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":"1205.5975","created_at":"2026-05-18T03:54:48.632832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.5975v1","created_at":"2026-05-18T03:54:48.632832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5975","created_at":"2026-05-18T03:54:48.632832+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZKCKUUTVUQG","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZKCKUUTVUQG4GN3","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZKCKUUT","created_at":"2026-05-18T12:27:18.751474+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/PZKCKUUTVUQG4GN3OQI5UXQT4E","json":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E.json","graph_json":"https://pith.science/api/pith-number/PZKCKUUTVUQG4GN3OQI5UXQT4E/graph.json","events_json":"https://pith.science/api/pith-number/PZKCKUUTVUQG4GN3OQI5UXQT4E/events.json","paper":"https://pith.science/paper/PZKCKUUT"},"agent_actions":{"view_html":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E","download_json":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E.json","view_paper":"https://pith.science/paper/PZKCKUUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.5975&json=true","fetch_graph":"https://pith.science/api/pith-number/PZKCKUUTVUQG4GN3OQI5UXQT4E/graph.json","fetch_events":"https://pith.science/api/pith-number/PZKCKUUTVUQG4GN3OQI5UXQT4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E/action/storage_attestation","attest_author":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E/action/author_attestation","sign_citation":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E/action/citation_signature","submit_replication":"https://pith.science/pith/PZKCKUUTVUQG4GN3OQI5UXQT4E/action/replication_record"}},"created_at":"2026-05-18T03:54:48.632832+00:00","updated_at":"2026-05-18T03:54:48.632832+00:00"}