{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TMZLSYNS5XU724LWYAOSGG6AYO","short_pith_number":"pith:TMZLSYNS","canonical_record":{"source":{"id":"1411.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-04T09:40:06Z","cross_cats_sorted":["cs.FL","cs.GT","math.OC"],"title_canon_sha256":"f80bc773eaf4e7f9b8ab816450c56a4ace5652fff85958a005846785c603aecb","abstract_canon_sha256":"7a64d85c6adb55ecaa757f3979726d1d709b4cb1c6fadeaa0c17037565d2020a"},"schema_version":"1.0"},"canonical_sha256":"9b32b961b2ede9fd7176c01d231bc0c3a1e9f2cf98d3290e8492442b19dbb4e7","source":{"kind":"arxiv","id":"1411.0835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0835","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0835v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0835","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"TMZLSYNS5XU7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMZLSYNS5XU724LW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMZLSYNS","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TMZLSYNS5XU724LWYAOSGG6AYO","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-04T09:40:06Z","cross_cats_sorted":["cs.FL","cs.GT","math.OC"],"title_canon_sha256":"f80bc773eaf4e7f9b8ab816450c56a4ace5652fff85958a005846785c603aecb","abstract_canon_sha256":"7a64d85c6adb55ecaa757f3979726d1d709b4cb1c6fadeaa0c17037565d2020a"},"schema_version":"1.0"},"canonical_sha256":"9b32b961b2ede9fd7176c01d231bc0c3a1e9f2cf98d3290e8492442b19dbb4e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.127094Z","signature_b64":"6X7O1P0NWCjjhPa2wK4KUvBBcUeAO3pePACI+qoVe78f3cKMwCo+/8oWtT2jfUCVoGgbrUsoY6bv7xpgoM2BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b32b961b2ede9fd7176c01d231bc0c3a1e9f2cf98d3290e8492442b19dbb4e7","last_reissued_at":"2026-05-18T02:38:38.126523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.126523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0835","source_version":1,"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-05-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RcWWuVOa/KYtrXzNylJbaJtKkzgGmpgLsp+4NNPFWXy8fnaZma9RtLgTkrEBSC1KaFbmCzNv4xAczzjxVYvRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:15:47.680829Z"},"content_sha256":"3102f40322c05b9573f64f15ef4016648ae204e628b5cbd52fbd1e508e8a03cb","schema_version":"1.0","event_id":"sha256:3102f40322c05b9573f64f15ef4016648ae204e628b5cbd52fbd1e508e8a03cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TMZLSYNS5XU724LWYAOSGG6AYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variations on the Stochastic Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT","math.OC"],"primary_cat":"cs.LO","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Ocan Sankur","submitted_at":"2014-11-04T09:40:06Z","abstract_excerpt":"In this invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of the length of paths reaching a given target, rather than simply minimizing its expected value. The concepts and algorithms that we propose here are applications of more general results that have been obtained recently for Markov decision processes and that are described in a series of recent papers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0835","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULd2DbYahBtRs39Eh3Bvto/pH6FjM6tduw4Kb11UxGtDG2SWgIcAff4gBV5jUE/HFVVSvwF/gfo4eLeNRP98Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:15:47.681545Z"},"content_sha256":"35948d862a67758b3af8eb9820be84e18d8bce186958fb6e781bcd120b1e3712","schema_version":"1.0","event_id":"sha256:35948d862a67758b3af8eb9820be84e18d8bce186958fb6e781bcd120b1e3712"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMZLSYNS5XU724LWYAOSGG6AYO/bundle.json","state_url":"https://pith.science/pith/TMZLSYNS5XU724LWYAOSGG6AYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMZLSYNS5XU724LWYAOSGG6AYO/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-05-31T22:15:47Z","links":{"resolver":"https://pith.science/pith/TMZLSYNS5XU724LWYAOSGG6AYO","bundle":"https://pith.science/pith/TMZLSYNS5XU724LWYAOSGG6AYO/bundle.json","state":"https://pith.science/pith/TMZLSYNS5XU724LWYAOSGG6AYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMZLSYNS5XU724LWYAOSGG6AYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TMZLSYNS5XU724LWYAOSGG6AYO","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":"7a64d85c6adb55ecaa757f3979726d1d709b4cb1c6fadeaa0c17037565d2020a","cross_cats_sorted":["cs.FL","cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-04T09:40:06Z","title_canon_sha256":"f80bc773eaf4e7f9b8ab816450c56a4ace5652fff85958a005846785c603aecb"},"schema_version":"1.0","source":{"id":"1411.0835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0835","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0835v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0835","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"TMZLSYNS5XU7","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMZLSYNS5XU724LW","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMZLSYNS","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:35948d862a67758b3af8eb9820be84e18d8bce186958fb6e781bcd120b1e3712","target":"graph","created_at":"2026-05-18T02:38:38Z","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 invited contribution, we revisit the stochastic shortest path problem, and show how recent results allow one to improve over the classical solutions: we present algorithms to synthesize strategies with multiple guarantees on the distribution of the length of paths reaching a given target, rather than simply minimizing its expected value. The concepts and algorithms that we propose here are applications of more general results that have been obtained recently for Markov decision processes and that are described in a series of recent papers.","authors_text":"Jean-Fran\\c{c}ois Raskin, Mickael Randour, Ocan Sankur","cross_cats":["cs.FL","cs.GT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-04T09:40:06Z","title":"Variations on the Stochastic Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0835","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:3102f40322c05b9573f64f15ef4016648ae204e628b5cbd52fbd1e508e8a03cb","target":"record","created_at":"2026-05-18T02:38:38Z","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":"7a64d85c6adb55ecaa757f3979726d1d709b4cb1c6fadeaa0c17037565d2020a","cross_cats_sorted":["cs.FL","cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-04T09:40:06Z","title_canon_sha256":"f80bc773eaf4e7f9b8ab816450c56a4ace5652fff85958a005846785c603aecb"},"schema_version":"1.0","source":{"id":"1411.0835","kind":"arxiv","version":1}},"canonical_sha256":"9b32b961b2ede9fd7176c01d231bc0c3a1e9f2cf98d3290e8492442b19dbb4e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b32b961b2ede9fd7176c01d231bc0c3a1e9f2cf98d3290e8492442b19dbb4e7","first_computed_at":"2026-05-18T02:38:38.126523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.126523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6X7O1P0NWCjjhPa2wK4KUvBBcUeAO3pePACI+qoVe78f3cKMwCo+/8oWtT2jfUCVoGgbrUsoY6bv7xpgoM2BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.127094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3102f40322c05b9573f64f15ef4016648ae204e628b5cbd52fbd1e508e8a03cb","sha256:35948d862a67758b3af8eb9820be84e18d8bce186958fb6e781bcd120b1e3712"],"state_sha256":"fa48a6e82829e7ed36c8dbea9a28e7fb44d8edc930d35c09878f616042ecf232"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Oo0LQgG7ovanL121QdsHlH0igaOIlBlHbIZSCvYswHZdhx6lnq4FFZW4n7UYWPOWABDFVea7BlZaD4A1v6NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:15:47.688812Z","bundle_sha256":"badbe2975e778c0982ad2e3b444ecc1f8203ae940deadbd518d85fa535735b87"}}