{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "floyd-algorithm-97-shortest-path-1962",
    "title": "Floyd: Algorithm 97, Shortest Path",
    "summary": "Published a concise dynamic-programming procedure for computing shortest-path distances between all pairs of vertices in a weighted network.",
    "boundary": "The record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.",
    "area": "Algorithms and data structures",
    "topic": "Computing",
    "year": 1962,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "floyd-algorithm-97-shortest-path-1962",
    "target": {
      "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
      "version": 1,
      "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
    },
    "humans": [
      "Robert W. Floyd"
    ],
    "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": "acm-floyd-algorithm-97-1962",
        "title": "ACM DOI for Algorithm 97: Shortest Path",
        "url": "https://doi.org/10.1145/367766.368168"
      },
      {
        "id": "dblp-floyd-shortest-path-1962",
        "title": "DBLP record for Floyd Algorithm 97",
        "url": "https://dblp.org/rec/journals/cacm/Floyd62a.html"
      }
    ],
    "points": "100000",
    "published_grade": {
      "id": "floyd-algorithm-97-shortest-path-1962",
      "entry_id": "floyd-algorithm-97-shortest-path-1962",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
        "version": 1,
        "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
      },
      "what_changed": "Published Algorithm 97 for all-pairs shortest-path computation via intermediate-vertex updates.",
      "scope": "The record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.",
      "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:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
        "version": 1,
        "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
      },
      "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": "Robert W. Floyd",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "ACM DOI for Algorithm 97: Shortest Path",
            "url": "https://doi.org/10.1145/367766.368168"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "ACM DOI for Algorithm 97: Shortest Path",
            "url": "https://doi.org/10.1145/367766.368168"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "DBLP record for Floyd Algorithm 97",
            "url": "https://dblp.org/rec/journals/cacm/Floyd62a.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.",
        "domain": "Algorithms and data structures"
      },
      "sources": [
        {
          "citation": "ACM DOI for Algorithm 97: Shortest Path",
          "url": "https://doi.org/10.1145/367766.368168"
        },
        {
          "citation": "DBLP record for Floyd Algorithm 97",
          "url": "https://dblp.org/rec/journals/cacm/Floyd62a.html"
        }
      ],
      "statement": "# Floyd: Algorithm 97, Shortest Path\n\nPublished a concise dynamic-programming procedure for computing shortest-path distances between all pairs of vertices in a weighted network.\n\n## Scientific scope\n\nThe record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.\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\nRobert W. Floyd\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- [ACM DOI for Algorithm 97: Shortest Path](https://doi.org/10.1145/367766.368168)\n- [DBLP record for Floyd Algorithm 97](https://dblp.org/rec/journals/cacm/Floyd62a.html)\n",
      "summary": "Published a concise dynamic-programming procedure for computing shortest-path distances between all pairs of vertices in a weighted network.",
      "title": "Floyd: Algorithm 97, Shortest Path"
    },
    "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
      "version": 1,
      "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:43ac4e60e664608d45ee83d24fc49e462dc7b060dfb9af84f3c5b735d5f548f8"
  },
  "target": {
    "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
    "version": 1,
    "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "floyd-algorithm-97-shortest-path-1962",
    "entry_id": "floyd-algorithm-97-shortest-path-1962",
    "revision": 1,
    "title": "Floyd: Algorithm 97, Shortest Path",
    "context": "Algorithms and data structures",
    "track": "ALGORITHM",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Published Algorithm 97 for all-pairs shortest-path computation via intermediate-vertex updates.",
    "scope": "The record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is Floyd's sole-author 1962 Algorithm 97 note. It remains distinct from Warshall's Boolean transitive-closure recurrence, later negative-cycle handling and subsequent implementation refinements.",
    "references": [
      {
        "title": "Floyd: Algorithm 97, Shortest Path",
        "url": "https://www.algol60-org.hlevkin.com/acm/097.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "Robert W. Floyd",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:7734e4e8-cdbd-4a98-a320-cf46332a7efb",
      "version": 1,
      "content_hash": "sha256:bee4098febd9ec2d2b6cd101394c84e038e83e1774c8b14bf796e83aa5871020"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "100000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}