{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QLD5RZLMSQEVFKZMKTJM6CQMN6","short_pith_number":"pith:QLD5RZLM","schema_version":"1.0","canonical_sha256":"82c7d8e56c940952ab2c54d2cf0a0c6fa0418af0d8e15e2a006a625c4dc5f02e","source":{"kind":"arxiv","id":"2202.03293","version":1},"attestation_state":"computed","paper":{"title":"Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aart J.C. Bik, Albert Cohen, Alexander Belyaev, Diego Caballero, Mahesh Ravishankar, Matthias Springer, Nicolas Vasilache, Oleksandr Zinenko, Stella Laurenzo, Stephan Herhut, Thomas Raoux, Tobias Gysi","submitted_at":"2022-02-07T15:31:59Z","abstract_excerpt":"Despite significant investment in software infrastructure, machine learning systems, runtimes and compilers do not compose properly. We propose a new design aiming at providing unprecedented degrees of modularity, composability and genericity. This paper discusses a structured approach to the construction of domain-specific code generators for tensor compilers, with the stated goal of improving the productivity of both compiler engineers and end-users. The approach leverages the natural structure of tensor algebra. It has been the main driver for the design of progressive lowering paths in \\ML"},"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":"2202.03293","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-02-07T15:31:59Z","cross_cats_sorted":[],"title_canon_sha256":"21cc09ebbdda37f0a74fb79537cd1fdee7634d9f95904b15f14ccdb21b3b881d","abstract_canon_sha256":"56582aeaf9e102d972dbcb06036dcf03dd3b5bd031cdb95eaeec7d687c7b216f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:37.726722Z","signature_b64":"Z82EtwZsiSso4CQKuy3+l9olDfFnLhJPW7HJZ20L5FKGWqjVsxeqNJLtLp2augkSvJja19lN3PXP5wJ8c5UpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82c7d8e56c940952ab2c54d2cf0a0c6fa0418af0d8e15e2a006a625c4dc5f02e","last_reissued_at":"2026-07-05T03:54:37.726229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:37.726229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Construction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Aart J.C. Bik, Albert Cohen, Alexander Belyaev, Diego Caballero, Mahesh Ravishankar, Matthias Springer, Nicolas Vasilache, Oleksandr Zinenko, Stella Laurenzo, Stephan Herhut, Thomas Raoux, Tobias Gysi","submitted_at":"2022-02-07T15:31:59Z","abstract_excerpt":"Despite significant investment in software infrastructure, machine learning systems, runtimes and compilers do not compose properly. We propose a new design aiming at providing unprecedented degrees of modularity, composability and genericity. This paper discusses a structured approach to the construction of domain-specific code generators for tensor compilers, with the stated goal of improving the productivity of both compiler engineers and end-users. The approach leverages the natural structure of tensor algebra. It has been the main driver for the design of progressive lowering paths in \\ML"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03293","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.03293/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2202.03293","created_at":"2026-07-05T03:54:37.726308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.03293v1","created_at":"2026-07-05T03:54:37.726308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03293","created_at":"2026-07-05T03:54:37.726308+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLD5RZLMSQEV","created_at":"2026-07-05T03:54:37.726308+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLD5RZLMSQEVFKZM","created_at":"2026-07-05T03:54:37.726308+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLD5RZLM","created_at":"2026-07-05T03:54:37.726308+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04063","citing_title":"A Multi-level Compiler Backend for Accelerated Micro-kernels Targeting RISC-V ISA Extensions","ref_index":73,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6","json":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6.json","graph_json":"https://pith.science/api/pith-number/QLD5RZLMSQEVFKZMKTJM6CQMN6/graph.json","events_json":"https://pith.science/api/pith-number/QLD5RZLMSQEVFKZMKTJM6CQMN6/events.json","paper":"https://pith.science/paper/QLD5RZLM"},"agent_actions":{"view_html":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6","download_json":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6.json","view_paper":"https://pith.science/paper/QLD5RZLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.03293&json=true","fetch_graph":"https://pith.science/api/pith-number/QLD5RZLMSQEVFKZMKTJM6CQMN6/graph.json","fetch_events":"https://pith.science/api/pith-number/QLD5RZLMSQEVFKZMKTJM6CQMN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6/action/storage_attestation","attest_author":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6/action/author_attestation","sign_citation":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6/action/citation_signature","submit_replication":"https://pith.science/pith/QLD5RZLMSQEVFKZMKTJM6CQMN6/action/replication_record"}},"created_at":"2026-07-05T03:54:37.726308+00:00","updated_at":"2026-07-05T03:54:37.726308+00:00"}