{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "ford-fulkerson-maximal-flow-network-1956",
    "title": "Ford and Fulkerson: Maximal flow through a network",
    "summary": "Proved the max-flow/min-cut relation for the paper's network model and supplied an effective augmenting-flow computational scheme.",
    "boundary": "The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.",
    "area": "Algorithms and data structures",
    "topic": "Computing",
    "year": 1956,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "ford-fulkerson-maximal-flow-network-1956",
    "target": {
      "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
      "version": 1,
      "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
    },
    "humans": [
      "Lester R. Ford Jr.",
      "Delbert R. Fulkerson"
    ],
    "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": "cambridge-ford-fulkerson-1956",
        "title": "Cambridge publisher record for Maximal flow through a network",
        "url": "https://doi.org/10.4153/CJM-1956-045-5"
      },
      {
        "id": "yale-ford-fulkerson-fulltext",
        "title": "Yale-hosted Ford-Fulkerson 1956 full text",
        "url": "https://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.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://www.rand.org/pubs/research_memoranda/RM1400.html",
      "target": {
        "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
        "version": 1,
        "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
      },
      "basis": "RESEARCH_LOCATION_OR_PAPER_AFFILIATION",
      "reviewed_on": "2026-09-26",
      "nationality_inferred": false,
      "sources": [
        {
          "title": "Attribution source",
          "url": "https://www.rand.org/pubs/research_memoranda/RM1400.html"
        },
        {
          "title": "Attribution source",
          "url": "https://www.informs.org/Explore/History-of-O.R.-Excellence/Biographical-Profiles/Fulkerson-D.-Ray"
        }
      ],
      "coverage_status": "COMPLETE",
      "country_labels": {
        "US": "United States"
      }
    },
    "points": "310000",
    "published_grade": {
      "id": "ford-fulkerson-maximal-flow-network-1956",
      "entry_id": "ford-fulkerson-maximal-flow-network-1956",
      "band": "S",
      "modifier": "-",
      "target": {
        "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
        "version": 1,
        "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
      },
      "what_changed": "Linked maximum flow to minimum cut and supplied an augmenting-flow scheme for the stated network model.",
      "scope": "The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.",
      "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:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
        "version": 1,
        "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
      },
      "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": "Lester R. Ford Jr.",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cambridge publisher record for Maximal flow through a network",
            "url": "https://doi.org/10.4153/CJM-1956-045-5"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Delbert R. Fulkerson",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cambridge publisher record for Maximal flow through a network",
            "url": "https://doi.org/10.4153/CJM-1956-045-5"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Cambridge publisher record for Maximal flow through a network",
            "url": "https://doi.org/10.4153/CJM-1956-045-5"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Yale-hosted Ford-Fulkerson 1956 full text",
            "url": "https://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.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 the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.",
        "domain": "Algorithms and data structures"
      },
      "sources": [
        {
          "citation": "Cambridge publisher record for Maximal flow through a network",
          "url": "https://doi.org/10.4153/CJM-1956-045-5"
        },
        {
          "citation": "Yale-hosted Ford-Fulkerson 1956 full text",
          "url": "https://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf"
        }
      ],
      "statement": "# Ford and Fulkerson: Maximal flow through a network\n\nProved the max-flow/min-cut relation for the paper's network model and supplied an effective augmenting-flow computational scheme.\n\n## Scientific scope\n\nThe record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.\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\nLester R. Ford Jr.; Delbert R. Fulkerson\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- [Cambridge publisher record for Maximal flow through a network](https://doi.org/10.4153/CJM-1956-045-5)\n- [Yale-hosted Ford-Fulkerson 1956 full text](https://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf)\n",
      "summary": "Proved the max-flow/min-cut relation for the paper's network model and supplied an effective augmenting-flow computational scheme.",
      "title": "Ford and Fulkerson: Maximal flow through a network"
    },
    "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
      "version": 1,
      "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:b1fd4f2a7ff40274dbe2297e43b0cdc4109bfc16f116ed12b3378d624ef9b8e8"
  },
  "target": {
    "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
    "version": 1,
    "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "ford-fulkerson-maximal-flow-network-1956",
    "entry_id": "ford-fulkerson-maximal-flow-network-1956",
    "revision": 1,
    "title": "Ford and Fulkerson: Maximal flow through a network",
    "context": "Algorithms and data structures",
    "track": "ALGORITHM",
    "band": "S",
    "modifier": "-",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-09-25",
    "evidence_cutoff": "2026-09-25",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Linked maximum flow to minimum cut and supplied an augmenting-flow scheme for the stated network model.",
    "scope": "The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.",
    "evidence_summary": "The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1956 Canadian Journal of Mathematics paper. It does not absorb earlier linear-programming formulations, later Edmonds-Karp complexity bounds or every network-flow extension.",
    "references": [
      {
        "title": "Yale-hosted Ford-Fulkerson 1956 full text",
        "url": "https://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf",
        "locator": "Source for the stated contribution; scientific claims remain bounded to the linked work."
      }
    ],
    "roles": [
      {
        "who": "Lester R. Ford Jr.",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      },
      {
        "who": "Delbert R. Fulkerson",
        "credit": "SCIENCE",
        "did": "Named source author of the scoped work; individual effort shares are not measured."
      }
    ],
    "target": {
      "record_id": "urn:uuid:e9904d4d-d4e7-4734-ac01-9c55cc31b46d",
      "version": 1,
      "content_hash": "sha256:fd27f8bcada301f72b93346e0416b9480ba19dc3f94c0a6e375676bd397b0bd3"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "310000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}