{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
    "title": "Chudnovsky, Robertson, Seymour and Thomas: the strong perfect graph theorem",
    "summary": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.",
    "boundary": "Perfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.",
    "area": "Structural graph theory",
    "topic": "Mathematics",
    "year": 2002,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
    "target": {
      "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
      "version": 1,
      "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
    },
    "humans": [
      "Maria Chudnovsky",
      "Neil Robertson",
      "Paul Seymour",
      "Robin Thomas"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261020-arxiv-math-0212070v1",
        "title": "The strong perfect graph theorem",
        "url": "https://arxiv.org/abs/math/0212070v1",
        "date": "2002-12-04"
      },
      {
        "id": "cur20261020-spg-author2004",
        "title": "The Strong Perfect Graph Theorem (author-hosted revised manuscript)",
        "url": "https://web.math.princeton.edu/~pds/papers/perfect/perfect.pdf",
        "date": "2004-06-04"
      }
    ],
    "points": "360000",
    "published_grade": {
      "id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
      "entry_id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
        "version": 1,
        "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
      },
      "what_changed": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.",
      "scope": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization. Perfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.",
      "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:311a327d-b435-4fa6-a7b3-c551531492e7",
        "version": 1,
        "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-23T00: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": "Maria Chudnovsky",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "The strong perfect graph theorem",
            "url": "https://arxiv.org/abs/math/0212070v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Neil Robertson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "The strong perfect graph theorem",
            "url": "https://arxiv.org/abs/math/0212070v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Paul Seymour",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "The strong perfect graph theorem",
            "url": "https://arxiv.org/abs/math/0212070v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Robin Thomas",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "The strong perfect graph theorem",
            "url": "https://arxiv.org/abs/math/0212070v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "The strong perfect graph theorem",
            "url": "https://arxiv.org/abs/math/0212070v1"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "The Strong Perfect Graph Theorem (author-hosted revised manuscript)",
            "url": "https://web.math.princeton.edu/~pds/papers/perfect/perfect.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Perfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.",
        "domain": "Structural graph theory"
      },
      "sources": [
        {
          "citation": "The strong perfect graph theorem",
          "url": "https://arxiv.org/abs/math/0212070v1"
        },
        {
          "citation": "The Strong Perfect Graph Theorem (author-hosted revised manuscript)",
          "url": "https://web.math.princeton.edu/~pds/papers/perfect/perfect.pdf"
        }
      ],
      "statement": "# Chudnovsky, Robertson, Seymour and Thomas: the strong perfect graph theorem\n\nA finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.\n\n## Scientific scope\n\nPerfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nMaria Chudnovsky; Neil Robertson; Paul Seymour; Robin Thomas\n\nSource-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.\n\n\n\n## Original sources\n\n- [The strong perfect graph theorem](https://arxiv.org/abs/math/0212070v1)\n- [The Strong Perfect Graph Theorem (author-hosted revised manuscript)](https://web.math.princeton.edu/~pds/papers/perfect/perfect.pdf)\n",
      "summary": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.",
      "title": "Chudnovsky, Robertson, Seymour and Thomas: the strong perfect graph theorem"
    },
    "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
      "version": 1,
      "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:964cac28d99eec37adaa5ad804b95a274f623f4d4264ad0aee714752b1345915"
  },
  "target": {
    "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
    "version": 1,
    "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
    "entry_id": "chudnovsky-robertson-seymour-thomas-strong-perfect-graph-2002",
    "revision": 1,
    "title": "Chudnovsky, Robertson, Seymour and Thomas: the strong perfect graph theorem",
    "context": "Structural graph theory",
    "track": "Exact theorem and reusable mathematical method",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-23",
    "evidence_cutoff": "2026-10-23",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization.",
    "scope": "A finite simple graph is perfect exactly when it has neither an induced odd cycle of length at least five nor the complement of such a cycle. A structural decomposition of Berge graphs, together with exclusions for a minimal imperfect graph, yields the characterization. Perfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.",
    "evidence_summary": "The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. Perfection concerns every induced subgraph, not only the original graph's chromatic and clique numbers. This contribution is the structural theorem, not automatically a new optimal recognition or coloring algorithm.",
    "references": [
      {
        "title": "The strong perfect graph theorem",
        "url": "https://arxiv.org/abs/math/0212070v1",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      },
      {
        "title": "The Strong Perfect Graph Theorem (author-hosted revised manuscript)",
        "url": "https://web.math.princeton.edu/~pds/papers/perfect/perfect.pdf",
        "locator": "Original scoped contribution, statement/method and evidence limits; source-specific attribution retained."
      }
    ],
    "roles": [
      {
        "who": "The named authors in the research record",
        "credit": "SCIENCE",
        "did": "Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred."
      }
    ],
    "target": {
      "record_id": "urn:uuid:311a327d-b435-4fa6-a7b3-c551531492e7",
      "version": 1,
      "content_hash": "sha256:532f15131c304c4b3160d75136d2969392c9d51825059ee2ba8454c0c58eada6"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "360000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}