{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZILLUJUSUGFHQJJCI457EIMUXD","short_pith_number":"pith:ZILLUJUS","schema_version":"1.0","canonical_sha256":"ca16ba2692a18a782522473bf22194b8f03aa1244404062a4fbf7a950faccd8f","source":{"kind":"arxiv","id":"2002.11054","version":2},"attestation_state":"computed","paper":{"title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Albert Cohen, Andy Davis, Chris Lattner, Jacques Pienaar, Mehdi Amini, Nicolas Vasilache, Oleksandr Zinenko, River Riddle, Tatiana Shpeisman, Uday Bondhugula","submitted_at":"2020-02-25T17:24:50Z","abstract_excerpt":"This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and also across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a resear"},"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":"2002.11054","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2020-02-25T17:24:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"344ac817e72828d920c11eee68539af8df841d1e6c15ad0b0a5810199c898bc7","abstract_canon_sha256":"cf1f0ace2a27f5e3a8b664378ec0cb347260cbb762675b2841890f67a14f1ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:43.035879Z","signature_b64":"wVTqiMkmKlbreVXITgkqzZ1UVMfhPugIfj0eeiL8thQHht1KdM43eeOP0AO7HiQflpiz2C5T9SVQHHK63kX5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca16ba2692a18a782522473bf22194b8f03aa1244404062a4fbf7a950faccd8f","last_reissued_at":"2026-07-05T00:44:43.035440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:43.035440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Albert Cohen, Andy Davis, Chris Lattner, Jacques Pienaar, Mehdi Amini, Nicolas Vasilache, Oleksandr Zinenko, River Riddle, Tatiana Shpeisman, Uday Bondhugula","submitted_at":"2020-02-25T17:24:50Z","abstract_excerpt":"This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR aims to address software fragmentation, improve compilation for heterogeneous hardware, significantly reduce the cost of building domain specific compilers, and aid in connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and also across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a resear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11054","kind":"arxiv","version":2},"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/2002.11054/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":"2002.11054","created_at":"2026-07-05T00:44:43.035512+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.11054v2","created_at":"2026-07-05T00:44:43.035512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11054","created_at":"2026-07-05T00:44:43.035512+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZILLUJUSUGFH","created_at":"2026-07-05T00:44:43.035512+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZILLUJUSUGFHQJJC","created_at":"2026-07-05T00:44:43.035512+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZILLUJUS","created_at":"2026-07-05T00:44:43.035512+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20917","citing_title":"NektarIR: A Domain-Specific Compiler for High-Order Finite Element Operations on Heterogeneous Hardware","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09312","citing_title":"Toward Compiler World Models: Learning Latent Dynamics for Efficient Tensor Program Search","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2505.04080","citing_title":"MojoFrame: Dataframe Library in Mojo Language","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14690","citing_title":"Integrated photonic computing: towards high-dimensional information processing","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17923","citing_title":"AdaptiveLoad: Towards Efficient Video Diffusion Transformer Training","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2509.16248","citing_title":"GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07526","citing_title":"From LLM to Silicon: RL-Driven ASIC Architecture Exploration for On-Device AI Inference","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.12618","citing_title":"CODO: An Automated Compiler for Comprehensive Dataflow Optimization","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14825","citing_title":"Nautilus: An Auto-Scheduling Tensor Compiler for Efficient Tiled GPU Kernels","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20912","citing_title":"Quantum-HPC Software Stacks and the openQSE Reference Architecture: A Survey","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD","json":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD.json","graph_json":"https://pith.science/api/pith-number/ZILLUJUSUGFHQJJCI457EIMUXD/graph.json","events_json":"https://pith.science/api/pith-number/ZILLUJUSUGFHQJJCI457EIMUXD/events.json","paper":"https://pith.science/paper/ZILLUJUS"},"agent_actions":{"view_html":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD","download_json":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD.json","view_paper":"https://pith.science/paper/ZILLUJUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.11054&json=true","fetch_graph":"https://pith.science/api/pith-number/ZILLUJUSUGFHQJJCI457EIMUXD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZILLUJUSUGFHQJJCI457EIMUXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD/action/storage_attestation","attest_author":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD/action/author_attestation","sign_citation":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD/action/citation_signature","submit_replication":"https://pith.science/pith/ZILLUJUSUGFHQJJCI457EIMUXD/action/replication_record"}},"created_at":"2026-07-05T00:44:43.035512+00:00","updated_at":"2026-07-05T00:44:43.035512+00:00"}