{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:ZX7OAKL3KWOEBM263KQANRB2N7","short_pith_number":"pith:ZX7OAKL3","canonical_record":{"source":{"id":"0707.0335","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2007-07-03T03:29:57Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"140f18e7f59bd43e77e72fc9efb52d764b1a32448690f79dfda921a568101911","abstract_canon_sha256":"ff0e9638aa370e6425373cc566a6642093273ce38a18dce75a88109475775a7c"},"schema_version":"1.0"},"canonical_sha256":"cdfee0297b559c40b35edaa006c43a6fe8cb5a40e1c0b0a1ae4d26ea38b5ffbf","source":{"kind":"arxiv","id":"0707.0335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0335","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0335v2","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0335","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZX7OAKL3KWOE","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"ZX7OAKL3KWOEBM26","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"ZX7OAKL3","created_at":"2026-06-03T22:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:ZX7OAKL3KWOEBM263KQANRB2N7","target":"record","payload":{"canonical_record":{"source":{"id":"0707.0335","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2007-07-03T03:29:57Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"140f18e7f59bd43e77e72fc9efb52d764b1a32448690f79dfda921a568101911","abstract_canon_sha256":"ff0e9638aa370e6425373cc566a6642093273ce38a18dce75a88109475775a7c"},"schema_version":"1.0"},"canonical_sha256":"cdfee0297b559c40b35edaa006c43a6fe8cb5a40e1c0b0a1ae4d26ea38b5ffbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:01.422982Z","signature_b64":"4gwa9xqqXGdr8khp5j4mBedCpuNUFVjFAHcXCKcEnLXAFNYOoO1FBvNyQOrA+0J6pcq1X7P+8Mfnah0JspZmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdfee0297b559c40b35edaa006c43a6fe8cb5a40e1c0b0a1ae4d26ea38b5ffbf","last_reissued_at":"2026-06-03T22:06:01.422601Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:01.422601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.0335","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T22:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uinSFhCtM+H9LtR2oe/cHAhWCVzAEzTElVthnpy0a4FVsdBd6BkTDkmUaIWguysvGuOgusjSz2p3eCMRwE7/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:57:54.869637Z"},"content_sha256":"bb49df2db7ea186d4365988ee6da7ac225217ed0becbf960fcfb31d5a723cfec","schema_version":"1.0","event_id":"sha256:bb49df2db7ea186d4365988ee6da7ac225217ed0becbf960fcfb31d5a723cfec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:ZX7OAKL3KWOEBM263KQANRB2N7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Label-setting methods for Multimode Stochastic Shortest Path problems on graphs","license":"","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Alexander Vladimirsky","submitted_at":"2007-07-03T03:29:57Z","abstract_excerpt":"Stochastic shortest path (SSP) problems arise in a variety of discrete stochastic control contexts. An optimal solutions to such a problem is typically computed using the value function, which can be found by solving the corresponding dynamic programming equations. In the deterministic case, these equations can be often solved by the highly efficient label-setting methods (such as Dijkstra's and Dial's algorithms). In this paper we define and study a class of Multimode Stochastic Shortest Path problems and develop sufficient conditions for the applicability of label-setting methods. We illustr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0335","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0707.0335/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T22:06:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ful3NuX/37sYx4pZkF2T3HK/xAItMeGU/g8kwn8lZh0qI3vDc1DDHOwxqNWa2EcjFX6krcAjtHOwhMp+fVo0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:57:54.870007Z"},"content_sha256":"0bd8bf3bc50bcfcd31774c3930be5b8a79e8fd04878463647d86be600f04ed43","schema_version":"1.0","event_id":"sha256:0bd8bf3bc50bcfcd31774c3930be5b8a79e8fd04878463647d86be600f04ed43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZX7OAKL3KWOEBM263KQANRB2N7/bundle.json","state_url":"https://pith.science/pith/ZX7OAKL3KWOEBM263KQANRB2N7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZX7OAKL3KWOEBM263KQANRB2N7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T09:57:54Z","links":{"resolver":"https://pith.science/pith/ZX7OAKL3KWOEBM263KQANRB2N7","bundle":"https://pith.science/pith/ZX7OAKL3KWOEBM263KQANRB2N7/bundle.json","state":"https://pith.science/pith/ZX7OAKL3KWOEBM263KQANRB2N7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZX7OAKL3KWOEBM263KQANRB2N7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ZX7OAKL3KWOEBM263KQANRB2N7","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":"ff0e9638aa370e6425373cc566a6642093273ce38a18dce75a88109475775a7c","cross_cats_sorted":["cs.NA","math.NA"],"license":"","primary_cat":"math.OC","submitted_at":"2007-07-03T03:29:57Z","title_canon_sha256":"140f18e7f59bd43e77e72fc9efb52d764b1a32448690f79dfda921a568101911"},"schema_version":"1.0","source":{"id":"0707.0335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.0335","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"0707.0335v2","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.0335","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZX7OAKL3KWOE","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"ZX7OAKL3KWOEBM26","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"ZX7OAKL3","created_at":"2026-06-03T22:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:0bd8bf3bc50bcfcd31774c3930be5b8a79e8fd04878463647d86be600f04ed43","target":"graph","created_at":"2026-06-03T22:06:01Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0707.0335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic shortest path (SSP) problems arise in a variety of discrete stochastic control contexts. An optimal solutions to such a problem is typically computed using the value function, which can be found by solving the corresponding dynamic programming equations. In the deterministic case, these equations can be often solved by the highly efficient label-setting methods (such as Dijkstra's and Dial's algorithms). In this paper we define and study a class of Multimode Stochastic Shortest Path problems and develop sufficient conditions for the applicability of label-setting methods. We illustr","authors_text":"Alexander Vladimirsky","cross_cats":["cs.NA","math.NA"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2007-07-03T03:29:57Z","title":"Label-setting methods for Multimode Stochastic Shortest Path problems on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.0335","kind":"arxiv","version":2},"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:bb49df2db7ea186d4365988ee6da7ac225217ed0becbf960fcfb31d5a723cfec","target":"record","created_at":"2026-06-03T22:06:01Z","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":"ff0e9638aa370e6425373cc566a6642093273ce38a18dce75a88109475775a7c","cross_cats_sorted":["cs.NA","math.NA"],"license":"","primary_cat":"math.OC","submitted_at":"2007-07-03T03:29:57Z","title_canon_sha256":"140f18e7f59bd43e77e72fc9efb52d764b1a32448690f79dfda921a568101911"},"schema_version":"1.0","source":{"id":"0707.0335","kind":"arxiv","version":2}},"canonical_sha256":"cdfee0297b559c40b35edaa006c43a6fe8cb5a40e1c0b0a1ae4d26ea38b5ffbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdfee0297b559c40b35edaa006c43a6fe8cb5a40e1c0b0a1ae4d26ea38b5ffbf","first_computed_at":"2026-06-03T22:06:01.422601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:01.422601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4gwa9xqqXGdr8khp5j4mBedCpuNUFVjFAHcXCKcEnLXAFNYOoO1FBvNyQOrA+0J6pcq1X7P+8Mfnah0JspZmCA==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:01.422982Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.0335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb49df2db7ea186d4365988ee6da7ac225217ed0becbf960fcfb31d5a723cfec","sha256:0bd8bf3bc50bcfcd31774c3930be5b8a79e8fd04878463647d86be600f04ed43"],"state_sha256":"6f87883c0085673c0736cc7199dcf1b915f1507dec6b308c4d2de164e7abdfa5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s/vqU7vkaXa4HSfJgHMbmYRJBBcVkz0uah7Dcwp+E7ZOZem6rmNKDh9QrpJ0ClOaFG6mdns6/uHtKBGIESs5AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:57:54.872099Z","bundle_sha256":"4b2c1f49c73507de8c22c25db0f006cca09ae0865dacdccb8d00b47df7659266"}}