{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "bellman-routing-successive-approximation-1958",
    "title": "Bellman: improve a route by updating what remains",
    "summary": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.\n\nThe quickest route is not necessarily the shortest in distance or the road that looks best at the first junction. Bellman assigns each city the best remaining travel time to the destination. Updating a city means comparing its outgoing road time plus the currently known remaining time from the next city. Repeating these local comparisons improves the whole route estimate. For the positive travel times of the original finite model, an optimal route does not need a cycle, giving a bound on the necessary iterations. The paper explains initialization and monotone convergence and acknowledges an independently obtained version of the same iteration. Modern negative-edge variants and distributed routing systems are later, separate developments.",
    "boundary": "The original model uses finitely many cities with strictly positive pairwise travel times and a fixed destination. Its initialization, recursion and iteration bound belong to that model. Nonnegative/negative weights, sparse-graph implementations and modern Bellman–Ford variants need their own conditions. The result does not provide a universal routing guarantee under arbitrary changing network conditions.",
    "area": "Finite positive-time routing",
    "topic": "Computing",
    "year": 1958,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "bellman-routing-successive-approximation-1958",
    "target": {
      "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
      "version": 1,
      "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
    },
    "humans": [
      "Richard Bellman"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "dijkstra-shortest-path",
      "bellman-dynamic-programming"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-bellman1958-routing-original",
        "title": "Richard Bellman, On a Routing Problem (1958),87-90",
        "url": "https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf"
      }
    ],
    "points": "75000",
    "published_grade": {
      "id": "bellman-routing-successive-approximation-1958",
      "entry_id": "bellman-routing-successive-approximation-1958",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
        "version": 1,
        "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
      },
      "what_changed": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.",
      "scope": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations. The original model uses finitely many cities with strictly positive pairwise travel times and a fixed destination. Its initialization, recursion and iteration bound belong to that model. Nonnegative/negative weights, sparse-graph implementations and modern Bellman–Ford variants need their own conditions. The result does not provide a universal routing guarantee under arbitrary changing network conditions.",
      "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:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
        "version": 1,
        "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00: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": "Richard Bellman",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Richard Bellman, On a Routing Problem (1958),87-90",
            "url": "https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Richard Bellman, On a Routing Problem (1958),87-90",
            "url": "https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The original model uses finitely many cities with strictly positive pairwise travel times and a fixed destination. Its initialization, recursion and iteration bound belong to that model. Nonnegative/negative weights, sparse-graph implementations and modern Bellman–Ford variants need their own conditions. The result does not provide a universal routing guarantee under arbitrary changing network conditions.",
        "domain": "Finite positive-time routing"
      },
      "sources": [
        {
          "citation": "Richard Bellman, On a Routing Problem (1958),87-90",
          "url": "https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf"
        }
      ],
      "statement": "# Bellman: improve a route by updating what remains\n\nBellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.\n\nThe quickest route is not necessarily the shortest in distance or the road that looks best at the first junction. Bellman assigns each city the best remaining travel time to the destination. Updating a city means comparing its outgoing road time plus the currently known remaining time from the next city. Repeating these local comparisons improves the whole route estimate. For the positive travel times of the original finite model, an optimal route does not need a cycle, giving a bound on the necessary iterations. The paper explains initialization and monotone convergence and acknowledges an independently obtained version of the same iteration. Modern negative-edge variants and distributed routing systems are later, separate developments.\n\n## Scientific scope\n\nThe original model uses finitely many cities with strictly positive pairwise travel times and a fixed destination. Its initialization, recursion and iteration bound belong to that model. Nonnegative/negative weights, sparse-graph implementations and modern Bellman–Ford variants need their own conditions. The result does not provide a universal routing guarantee under arbitrary changing network conditions.\n\n## People and systems\n\nRichard Bellman\n\n\n\n## Original sources\n\n- [Richard Bellman, On a Routing Problem (1958),87-90](https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf)\n",
      "summary": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.\n\nThe quickest route is not necessarily the shortest in distance or the road that looks best at the first junction. Bellman assigns each city the best remaining travel time to the destination. Updating a city means comparing its outgoing road time plus the currently known remaining time from the next city. Repeating these local comparisons improves the whole route estimate. For the positive travel times of the original finite model, an optimal route does not need a cycle, giving a bound on the necessary iterations. The paper explains initialization and monotone convergence and acknowledges an independently obtained version of the same iteration. Modern negative-edge variants and distributed routing systems are later, separate developments.",
      "title": "Bellman: improve a route by updating what remains"
    },
    "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
      "version": 1,
      "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:04751d481fd4b5bc9b7371c9ad7f8ebc104dc4f19596469cf0a514d3f157f8db"
  },
  "target": {
    "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
    "version": 1,
    "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "bellman-routing-successive-approximation-1958",
    "entry_id": "bellman-routing-successive-approximation-1958",
    "revision": 1,
    "title": "Bellman: improve a route by updating what remains",
    "context": "Finite positive-time routing",
    "track": "Finite positive-time routing",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations.",
    "scope": "Bellman applies dynamic-programming cost-to-go equations to positive-time finite routing and gives policy-initialized monotone successive approximations that reach the optimal travel cost after a bounded number of iterations. The original model uses finitely many cities with strictly positive pairwise travel times and a fixed destination. Its initialization, recursion and iteration bound belong to that model. Nonnegative/negative weights, sparse-graph implementations and modern Bellman–Ford variants need their own conditions. The result does not provide a universal routing guarantee under arbitrary changing network conditions.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Richard Bellman, On a Routing Problem (1958),87-90",
        "url": "https://www.cs.yale.edu/homes/lans/readings/routing/bellman-routing-1958.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Richard Bellman",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:812eb85e-b1ec-4d69-a6f8-c4e8f21c54dc",
      "version": 1,
      "content_hash": "sha256:86b6bb4d60e0b7f99c5a8fa332ab68226fa867791e94cf444638625315b4d61f"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "75000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}