{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "levin-universal-search",
    "title": "Levin: universal search problems",
    "summary": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.",
    "boundary": "The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.",
    "area": "Complexity theory",
    "topic": "Computing & AI",
    "year": 1973,
    "lane": "HUMAN",
    "result": "THEOREM",
    "package_id": "levin-universal-search",
    "target": {
      "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
      "version": 1,
      "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
    },
    "humans": [
      "L. A. Levin"
    ],
    "authors_complete": true,
    "human_role_note": "Listed source contributors; individual labor shares are not measured",
    "agents": [],
    "related": [
      "cook-completeness",
      "p-vs-np",
      "turing"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "levin-1973",
        "title": "Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan",
        "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf"
      }
    ],
    "geography": {
      "country_codes": [
        "RU"
      ],
      "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://www.cs.bu.edu/fac/lnd/research/curv.htm",
      "target": {
        "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
        "version": 1,
        "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://www.cs.bu.edu/fac/lnd/research/curv.htm"
        },
        {
          "title": "Attribution source",
          "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "RU": "Russia"
      }
    },
    "points": "110000",
    "published_grade": {
      "id": "levin-universal-search",
      "entry_id": "levin-universal-search",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
        "version": 1,
        "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
      },
      "what_changed": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.",
      "scope": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model. Scope limitation: The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.",
      "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:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
        "version": 1,
        "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-09-12T00: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": "L. A. Levin",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "prover"
          ],
          "source": {
            "citation": "Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan",
            "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan",
            "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.",
        "domain": "Complexity theory"
      },
      "sources": [
        {
          "citation": "Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan",
          "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf"
        }
      ],
      "statement": "# Levin: universal search problems\n\nDefined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.\n\n## Scientific scope\n\nThe result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.\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\nL. A. Levin\n\nListed source contributors; individual labor shares are not measured\n\n\n\n## Original sources\n\n- [Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan](https://uvatoc.github.io/f19/docs/universalsearch.pdf)\n",
      "summary": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.",
      "title": "Levin: universal search problems"
    },
    "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
      "version": 1,
      "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:bce701b246d23fd85d0f0879a3f927e253b68c6bddbcfc10541aea8711d42f09"
  },
  "target": {
    "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
    "version": 1,
    "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "levin-universal-search",
    "entry_id": "levin-universal-search",
    "revision": 1,
    "title": "Levin: universal search problems",
    "context": "Complexity theory",
    "track": "Scoped scientific or research-capability contribution",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-14",
    "evidence_cutoff": "2026-09-14",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model.",
    "scope": "Defined efficiently checkable witness-search problems and reductions between them, identified universal examples and stated an optimal-search construction in the specified computation model. Scope limitation: The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.",
    "evidence_summary": "Assessment uses the catalogue-linked source evidence for the stated contribution. The result does not prove P differs from NP. Its original search formulation and resource convention must be retained. The listed graph-embedding problem concerns a subgraph; it must not be misreported as a proof that ordinary graph isomorphism is NP-complete.",
    "references": [
      {
        "title": "Levin, Universal Sequential Search Problems, Problems of Information Transmission 9(3), 115–116 (1973), original Russian scan",
        "url": "https://uvatoc.github.io/f19/docs/universalsearch.pdf",
        "locator": "Retained catalogue source evidence; Both original pages: polynomially comparable resource definition, witness-search reductions, six universal problems and optimal-search theorem; portal cover excluded"
      }
    ],
    "roles": [
      {
        "who": "L. A. Levin",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:4fefb20a-9199-43e5-a16b-36bc0fd457e0",
      "version": 1,
      "content_hash": "sha256:a00a3741b9a67e37418bd800888cb2baa0e457701ccc9146faa0a88de5a47b34"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "110000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}