{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "karp-reducibility-combinatorial-problems-1972",
    "title": "Karp: Reducibility Among Combinatorial Problems",
    "summary": "Used polynomial-time reducibility, building on Cook's theorem, to establish NP-completeness for a linked family of twenty-one combinatorial problems.",
    "boundary": "The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.",
    "area": "Computability and complexity",
    "topic": "Computing",
    "year": 1972,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "karp-reducibility-combinatorial-problems-1972",
    "target": {
      "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
      "version": 1,
      "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
    },
    "humans": [
      "Richard M. Karp"
    ],
    "human_identities": [
      {
        "author_position": 0,
        "source_name": "Richard M. Karp",
        "person_id": "wrs-person-5a059f1c7e03cc0d75a1dc36",
        "display_name": "Richard M. Karp",
        "status": "SOURCE_LINKED_IDENTITY",
        "sources": [
          {
            "title": "Attribution source",
            "url": "https://www2.eecs.berkeley.edu/Faculty/Homepages/karp.html"
          }
        ]
      }
    ],
    "authors_complete": true,
    "human_role_note": "The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "springer-karp-reducibility-1972",
        "title": "Springer record for Reducibility Among Combinatorial Problems",
        "url": "https://doi.org/10.1007/978-1-4684-2001-2_9"
      },
      {
        "id": "gwu-karp-reducibility-fulltext",
        "title": "GWU-hosted copy of Karp reducibility chapter",
        "url": "https://www2.seas.gwu.edu/~simhaweb/champalg/tsp/papers/KarpOriginal.pdf"
      }
    ],
    "geography": {
      "country_codes": [
        "US"
      ],
      "location_basis": "Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.",
      "source_url": "https://simons.berkeley.edu/people/richard-karp",
      "target": {
        "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
        "version": 1,
        "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://simons.berkeley.edu/people/richard-karp"
        },
        {
          "title": "Attribution source",
          "url": "https://www2.eecs.berkeley.edu/Faculty/Homepages/karp.html"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "355000",
    "published_grade": {
      "id": "karp-reducibility-combinatorial-problems-1972",
      "entry_id": "karp-reducibility-combinatorial-problems-1972",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
        "version": 1,
        "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
      },
      "what_changed": "Established polynomial-time reductions showing twenty-one specified combinatorial problems NP-complete.",
      "scope": "The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.",
      "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:2abb8dff-52ad-4f49-a099-a5475a152a40",
        "version": 1,
        "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-09-25T00: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": "Richard M. Karp",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Springer record for Reducibility Among Combinatorial Problems",
            "url": "https://doi.org/10.1007/978-1-4684-2001-2_9"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Springer record for Reducibility Among Combinatorial Problems",
            "url": "https://doi.org/10.1007/978-1-4684-2001-2_9"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "GWU-hosted copy of Karp reducibility chapter",
            "url": "https://www2.seas.gwu.edu/~simhaweb/champalg/tsp/papers/KarpOriginal.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.",
        "domain": "Computability and complexity"
      },
      "sources": [
        {
          "citation": "Springer record for Reducibility Among Combinatorial Problems",
          "url": "https://doi.org/10.1007/978-1-4684-2001-2_9"
        },
        {
          "citation": "GWU-hosted copy of Karp reducibility chapter",
          "url": "https://www2.seas.gwu.edu/~simhaweb/champalg/tsp/papers/KarpOriginal.pdf"
        }
      ],
      "statement": "# Karp: Reducibility Among Combinatorial Problems\n\nUsed polynomial-time reducibility, building on Cook's theorem, to establish NP-completeness for a linked family of twenty-one combinatorial problems.\n\n## Scientific scope\n\nThe record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.\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\nRichard M. Karp\n\nThe named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.\n\n\n\n## Original sources\n\n- [Springer record for Reducibility Among Combinatorial Problems](https://doi.org/10.1007/978-1-4684-2001-2_9)\n- [GWU-hosted copy of Karp reducibility chapter](https://www2.seas.gwu.edu/~simhaweb/champalg/tsp/papers/KarpOriginal.pdf)\n",
      "summary": "Used polynomial-time reducibility, building on Cook's theorem, to establish NP-completeness for a linked family of twenty-one combinatorial problems.",
      "title": "Karp: Reducibility Among Combinatorial Problems"
    },
    "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
      "version": 1,
      "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:6680e5a0df9ea7afe49c76b295c4077d9858c4fe81c4c0c89533be3b9f437e34"
  },
  "target": {
    "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
    "version": 1,
    "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "karp-reducibility-combinatorial-problems-1972",
    "entry_id": "karp-reducibility-combinatorial-problems-1972",
    "revision": 1,
    "title": "Karp: Reducibility Among Combinatorial Problems",
    "context": "Computability and complexity",
    "track": "THEOREM",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Established polynomial-time reductions showing twenty-one specified combinatorial problems NP-complete.",
    "scope": "The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Karp's sole-author 1972 chapter and its specified reductions. It is not Cook's theorem itself, does not prove P differs from NP, and does not absorb every later NP-completeness result.",
    "references": [
      {
        "title": "GWU-hosted copy of Karp reducibility chapter",
        "url": "https://www2.seas.gwu.edu/~simhaweb/champalg/tsp/papers/KarpOriginal.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "Richard M. Karp",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:2abb8dff-52ad-4f49-a099-a5475a152a40",
      "version": 1,
      "content_hash": "sha256:0550a3f55c0469d4a534b3e0c29573a65c05c3509bb45120f20cf584c86d1435"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "355000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}