{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "dijkstra-shortest-path",
    "title": "Dijkstra: the shortest-path algorithm",
    "summary": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.",
    "boundary": "This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.",
    "area": "Algorithms and graph theory",
    "topic": "Computing & AI",
    "year": 1959,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "dijkstra-shortest-path",
    "target": {
      "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
      "version": 2,
      "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
    },
    "humans": [
      "Edsger W. Dijkstra"
    ],
    "authors_complete": true,
    "human_role_note": "Listed source contributors; individual labor shares are not measured",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "dijkstra-1959",
        "title": "Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)",
        "url": "https://link.springer.com/article/10.1007/BF01386390"
      },
      {
        "id": "dijkstra-retrospective",
        "title": "Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive",
        "url": "https://www.cs.utexas.edu/~EWD/ewd08xx/EWD841a.PDF"
      }
    ],
    "geography": {
      "country_codes": [
        "NL"
      ],
      "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://link.springer.com/article/10.1007/BF01386390",
      "target": {
        "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
        "version": 2,
        "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://link.springer.com/article/10.1007/BF01386390"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "NL": "Netherlands"
      }
    },
    "points": "80000",
    "published_grade": {
      "id": "dijkstra-shortest-path",
      "entry_id": "dijkstra-shortest-path",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
        "version": 2,
        "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
      },
      "what_changed": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.",
      "scope": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree. Scope limitation: This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.",
      "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:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
        "version": 2,
        "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": {
      "content_hash": "sha256:ed35fa2ab5964791cae121f4999f11d13430814612ac20263daf2225cf3c05c6",
      "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
      "version": 1
    },
    "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": "Edsger W. Dijkstra",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)",
            "url": "https://link.springer.com/article/10.1007/BF01386390"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)",
            "url": "https://link.springer.com/article/10.1007/BF01386390"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive",
            "url": "https://www.cs.utexas.edu/~EWD/ewd08xx/EWD841a.PDF"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.",
        "domain": "算法与图论"
      },
      "sources": [
        {
          "citation": "Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)",
          "url": "https://link.springer.com/article/10.1007/BF01386390"
        },
        {
          "citation": "Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive",
          "url": "https://www.cs.utexas.edu/~EWD/ewd08xx/EWD841a.PDF"
        }
      ],
      "statement": "# Dijkstra: the shortest-path algorithm\n\nGave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.\n\n## Scientific scope\n\nThis record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.\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\nEdsger W. Dijkstra\n\nListed source contributors; individual labor shares are not measured\n\n\n\n## Original sources\n\n- [Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)](https://link.springer.com/article/10.1007/BF01386390)\n- [Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive](https://www.cs.utexas.edu/~EWD/ewd08xx/EWD841a.PDF)\n",
      "summary": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.",
      "title": "Dijkstra: the shortest-path algorithm"
    },
    "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
    "version": 2,
    "source_ref": {
      "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
      "version": 2,
      "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:27cd3e576f1bc430cbc478ccff53736dbc9cfe1e9b32e7f9605d1fb9960ce67e"
  },
  "target": {
    "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
    "version": 2,
    "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "dijkstra-shortest-path",
    "entry_id": "dijkstra-shortest-path",
    "revision": 1,
    "title": "Dijkstra: the shortest-path algorithm",
    "context": "Algorithms and graph 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": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.",
    "scope": "Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree. Scope limitation: This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.",
    "evidence_summary": "Assessment uses the catalogue-linked source evidence for the stated contribution. This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.",
    "references": [
      {
        "title": "Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)",
        "url": "https://link.springer.com/article/10.1007/BF01386390",
        "locator": "Retained catalogue source evidence; Publisher author, date, pages and bibliography; paywalled body not read"
      },
      {
        "title": "Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive",
        "url": "https://www.cs.utexas.edu/~EWD/ewd08xx/EWD841a.PDF",
        "locator": "Retained catalogue source evidence; Author retrospective and reproduced abstract: positive edge lengths, minimum-length tree and shortest path; no full 1959 proof replay"
      }
    ],
    "roles": [
      {
        "who": "Edsger W. Dijkstra",
        "credit": "SCIENCE",
        "did": "Named source contributor; exact labor shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:bcb77dc5-605e-4594-a9ec-2c6e2f99826f",
      "version": 2,
      "content_hash": "sha256:3198098443614ab577ef2cbc97abeca61540a283e10b46d4c172ed3c460bef95"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "80000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}