{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "hart-nilsson-raphael-a-star",
    "title": "Hart, Nilsson and Raphael: formal heuristic minimum-cost search",
    "summary": "Placed heuristic graph search in a formal minimum-cost framework and analysed conditions under which the A* class returns minimum-cost paths.",
    "boundary": "The 1968 paper’s stronger optimality claim was corrected in 1972. This entry retains the admissibility/minimum-cost contribution without repeating the unqualified original theorem.",
    "area": "Heuristic search",
    "year": 1968,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "hart-nilsson-raphael-a-star",
    "target": {
      "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
      "version": 1,
      "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
    },
    "humans": [
      "Peter E. Hart",
      "Nils J. Nilsson",
      "Bertram Raphael"
    ],
    "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": "auckland-astar-1968",
        "title": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
        "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
      },
      {
        "id": "astar-correction-1972",
        "title": "Hart, Nilsson and Raphael: correction to the 1968 minimum-cost paths paper",
        "url": "https://cse.sc.edu/~MGV/csce580f12/astarHNR1972.pdf"
      },
      {
        "id": "stanford-nilsson-publications",
        "title": "Nils J. Nilsson publication archive",
        "url": "https://ai.stanford.edu/~nilsson/publications.html"
      }
    ],
    "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://people.stfx.ca/jdelamer/courses/csci-564/_downloads/b2220c66675ddde471ca1795147b8e86/A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths.pdf",
      "target": {
        "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
        "version": 1,
        "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://people.stfx.ca/jdelamer/courses/csci-564/_downloads/b2220c66675ddde471ca1795147b8e86/A_Formal_Basis_for_the_Heuristic_Determination_of_Minimum_Cost_Paths.pdf"
        },
        {
          "title": "Attribution source",
          "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "170000",
    "published_grade": {
      "id": "hart-nilsson-raphael-a-star",
      "entry_id": "hart-nilsson-raphael-a-star",
      "band": "A",
      "modifier": "+",
      "target": {
        "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
        "version": 1,
        "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
      },
      "what_changed": "Heuristic search gained a systematic method for minimum-cost paths under stated conditions.",
      "scope": "The 1968 paper read with its 1972 correction; later planning systems and invalid unqualified optimality language are excluded.",
      "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:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
        "version": 1,
        "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
      },
      "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": "Peter E. Hart",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
            "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Nils J. Nilsson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
            "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Bertram Raphael",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
            "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
            "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Hart, Nilsson and Raphael: correction to the 1968 minimum-cost paths paper",
            "url": "https://cse.sc.edu/~MGV/csce580f12/astarHNR1972.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Nils J. Nilsson publication archive",
            "url": "https://ai.stanford.edu/~nilsson/publications.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The 1968 paper’s stronger optimality claim was corrected in 1972. This entry retains the admissibility/minimum-cost contribution without repeating the unqualified original theorem.",
        "domain": "Heuristic search"
      },
      "sources": [
        {
          "citation": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
          "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf"
        },
        {
          "citation": "Hart, Nilsson and Raphael: correction to the 1968 minimum-cost paths paper",
          "url": "https://cse.sc.edu/~MGV/csce580f12/astarHNR1972.pdf"
        },
        {
          "citation": "Nils J. Nilsson publication archive",
          "url": "https://ai.stanford.edu/~nilsson/publications.html"
        }
      ],
      "statement": "# Hart, Nilsson and Raphael: formal heuristic minimum-cost search\n\nPlaced heuristic graph search in a formal minimum-cost framework and analysed conditions under which the A* class returns minimum-cost paths.\n\n## Scientific scope\n\nThe 1968 paper’s stronger optimality claim was corrected in 1972. This entry retains the admissibility/minimum-cost contribution without repeating the unqualified original theorem.\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\nPeter E. Hart; Nils J. Nilsson; Bertram Raphael\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- [Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths](https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf)\n- [Hart, Nilsson and Raphael: correction to the 1968 minimum-cost paths paper](https://cse.sc.edu/~MGV/csce580f12/astarHNR1972.pdf)\n- [Nils J. Nilsson publication archive](https://ai.stanford.edu/~nilsson/publications.html)\n",
      "summary": "Placed heuristic graph search in a formal minimum-cost framework and analysed conditions under which the A* class returns minimum-cost paths.",
      "title": "Hart, Nilsson and Raphael: formal heuristic minimum-cost search"
    },
    "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
      "version": 1,
      "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:c45a4edf090f8fa0f517c7792dff0af8ea8f47cf819881cb3d0ad965a769e089"
  },
  "target": {
    "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
    "version": 1,
    "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "hart-nilsson-raphael-a-star",
    "entry_id": "hart-nilsson-raphael-a-star",
    "revision": 1,
    "title": "Hart, Nilsson and Raphael: formal heuristic minimum-cost search",
    "context": "Heuristic search",
    "track": "search algorithm and conditional optimality",
    "band": "A",
    "modifier": "+",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Heuristic search gained a systematic method for minimum-cost paths under stated conditions.",
    "scope": "The 1968 paper read with its 1972 correction; later planning systems and invalid unqualified optimality language are excluded.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The 1968 paper’s stronger optimality claim was corrected in 1972. This entry retains the admissibility/minimum-cost contribution without repeating the unqualified original theorem.",
    "references": [
      {
        "title": "Hart, Nilsson and Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths",
        "url": "https://www.cs.auckland.ac.nz/courses/compsci709s2c/resources/Mike.d/astarNilsson.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      },
      {
        "title": "Hart, Nilsson and Raphael: correction to the 1968 minimum-cost paths paper",
        "url": "https://cse.sc.edu/~MGV/csce580f12/astarHNR1972.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      },
      {
        "title": "Nils J. Nilsson publication archive",
        "url": "https://ai.stanford.edu/~nilsson/publications.html",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "Peter E. Hart",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      },
      {
        "who": "Nils J. Nilsson",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      },
      {
        "who": "Bertram Raphael",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:4b06c2f4-71ce-4380-a79f-bcf20f6d9b0a",
      "version": 1,
      "content_hash": "sha256:1e8963459f2a13bb886854b316de880f0dc743c59c25d15cf44604a3bb895fff"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "170000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}