{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "lattner-et-al-mlir-infrastructure-2020",
    "title": "MLIR: extensible dialects and multi-level compiler infrastructure",
    "summary": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.",
    "boundary": "Reuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.",
    "area": "Machine-learning compiler infrastructure",
    "topic": "Artificial intelligence",
    "year": 2020,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "lattner-et-al-mlir-infrastructure-2020",
    "target": {
      "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
      "version": 1,
      "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
    },
    "humans": [
      "Chris Lattner",
      "Mehdi Amini",
      "Uday Bondhugula",
      "Albert Cohen",
      "Andy Davis",
      "Jacques Pienaar",
      "River Riddle",
      "Tatiana Shpeisman",
      "Nicolas Vasilache",
      "Oleksandr Zinenko"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261015-arxiv-2002-11054v1",
        "title": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
        "url": "https://arxiv.org/abs/2002.11054v1"
      }
    ],
    "points": "180000",
    "published_grade": {
      "id": "lattner-et-al-mlir-infrastructure-2020",
      "entry_id": "lattner-et-al-mlir-infrastructure-2020",
      "band": "A",
      "modifier": "+",
      "target": {
        "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
        "version": 1,
        "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
      },
      "what_changed": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.",
      "scope": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers. Reuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
        "version": 1,
        "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-16T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Chris Lattner",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Mehdi Amini",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Uday Bondhugula",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Albert Cohen",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Andy Davis",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Jacques Pienaar",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "River Riddle",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Tatiana Shpeisman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Nicolas Vasilache",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Oleksandr Zinenko",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
            "url": "https://arxiv.org/abs/2002.11054v1"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Reuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.",
        "domain": "Machine-learning compiler infrastructure"
      },
      "sources": [
        {
          "citation": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
          "url": "https://arxiv.org/abs/2002.11054v1"
        }
      ],
      "statement": "# MLIR: extensible dialects and multi-level compiler infrastructure\n\nCombined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.\n\n## Scientific scope\n\nReuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.\n\n## People and systems\n\nChris Lattner; Mehdi Amini; Uday Bondhugula; Albert Cohen; Andy Davis; Jacques Pienaar; River Riddle; Tatiana Shpeisman; Nicolas Vasilache; Oleksandr Zinenko\n\n\n\n## Original sources\n\n- [MLIR: A Compiler Infrastructure for the End of Moore's Law](https://arxiv.org/abs/2002.11054v1)\n",
      "summary": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.",
      "title": "MLIR: extensible dialects and multi-level compiler infrastructure"
    },
    "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
      "version": 1,
      "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:ffc0dfc3c679aec8ea470630032d56fae848be6b712c053185141f4c841dcdc5"
  },
  "target": {
    "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
    "version": 1,
    "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "lattner-et-al-mlir-infrastructure-2020",
    "entry_id": "lattner-et-al-mlir-infrastructure-2020",
    "revision": 1,
    "title": "MLIR: extensible dialects and multi-level compiler infrastructure",
    "context": "Machine-learning compiler infrastructure",
    "track": "Human-designed research method or resource",
    "band": "A",
    "modifier": "+",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-16",
    "evidence_cutoff": "2026-10-16",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers.",
    "scope": "Combined extensible intermediate-representation dialects with shared SSA-based infrastructure and progressive lowering to support heterogeneous domain-specific compilers. Reuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.",
    "evidence_summary": "The linked original sources describe this contribution and its evidence limits. WRS has not independently reconstructed the full scientific claims. Reuses established compiler algorithms rather than inventing SSA or every optimization. Extensibility and case studies are not proofs that arbitrary dialect combinations preserve semantics or globally optimize code.",
    "references": [
      {
        "title": "MLIR: A Compiler Infrastructure for the End of Moore's Law",
        "url": "https://arxiv.org/abs/2002.11054v1",
        "locator": "Original contribution and stated assumptions, evaluation scope and limitations; source-linked assessment, not independent execution or proof certification."
      }
    ],
    "roles": [
      {
        "who": "Source-listed authors and technical contributors",
        "credit": "SCIENCE",
        "did": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities."
      }
    ],
    "target": {
      "record_id": "urn:uuid:2ab03915-73d5-4011-a141-454fce48e4d9",
      "version": 1,
      "content_hash": "sha256:7cce6e84a83f2e7f73b060a6b2d06ff2d5cadebb211099b7ff02fca8e8935ea7"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "180000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}