{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MA7V5X7UFJHSTRSHJWNEVGJFXG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2f10f4390ebcc72372a19e7ce6e024ac94edb8477e2f75932005eb7766fb2436","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T23:07:24Z","title_canon_sha256":"c90841bf9a76581750fa1253043a1a97ca221a2a389962abe11deec02427b762"},"schema_version":"1.0","source":{"id":"1608.01670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01670","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01670v1","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01670","created_at":"2026-05-18T01:09:44Z"},{"alias_kind":"pith_short_12","alias_value":"MA7V5X7UFJHS","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MA7V5X7UFJHSTRSH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MA7V5X7U","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8590a161ee87d537a35a8d483d94389f7f484f90f92767661fe0cfd7e45b04d0","target":"graph","created_at":"2026-05-18T01:09:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit-evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and unique","authors_text":"Dimitri Bertsekas","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T23:07:24Z","title":"Robust Shortest Path Planning and Semicontractive Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01670","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f3bb8ddae66703e1d6abfccac23c0e874227c12058390a573a191403b9b015e","target":"record","created_at":"2026-05-18T01:09:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2f10f4390ebcc72372a19e7ce6e024ac94edb8477e2f75932005eb7766fb2436","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-03T23:07:24Z","title_canon_sha256":"c90841bf9a76581750fa1253043a1a97ca221a2a389962abe11deec02427b762"},"schema_version":"1.0","source":{"id":"1608.01670","kind":"arxiv","version":1}},"canonical_sha256":"603f5edff42a4f29c6474d9a4a9925b9bf09246b8785cede258dbf4118aac90a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"603f5edff42a4f29c6474d9a4a9925b9bf09246b8785cede258dbf4118aac90a","first_computed_at":"2026-05-18T01:09:44.863661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:44.863661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PMalop/bOae8mt6IEgqNhSn/Z9yUuKNclF2XFhiwIZ5byvrowGvB19ZfpUGkqkYjE23pGinhY9GmWYPutjYOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:44.864213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f3bb8ddae66703e1d6abfccac23c0e874227c12058390a573a191403b9b015e","sha256:8590a161ee87d537a35a8d483d94389f7f484f90f92767661fe0cfd7e45b04d0"],"state_sha256":"95d5c4cbe106a4acb16200331d5dc61cf8a87d2d8ca57803a9a8c431e8a833a9"}