{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:66IGA2PAWKN26IQWZW4BG3NHEN","short_pith_number":"pith:66IGA2PA","canonical_record":{"source":{"id":"1906.09094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-21T12:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"122a9d9a0183afc4f26c4eed114e75380b83dcaf4cee4102c24a222dc9bc3b42","abstract_canon_sha256":"e632f9a8eb29184eaab91f6c9454fe3d65d0435113dc3a3c3abe8a7f175b3a85"},"schema_version":"1.0"},"canonical_sha256":"f7906069e0b29baf2216cdb8136da72361268f52f79cf680d7a2ef5c8f611b94","source":{"kind":"arxiv","id":"1906.09094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09094","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09094v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09094","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"66IGA2PAWKN2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"66IGA2PAWKN26IQW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"66IGA2PA","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:66IGA2PAWKN26IQWZW4BG3NHEN","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-21T12:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"122a9d9a0183afc4f26c4eed114e75380b83dcaf4cee4102c24a222dc9bc3b42","abstract_canon_sha256":"e632f9a8eb29184eaab91f6c9454fe3d65d0435113dc3a3c3abe8a7f175b3a85"},"schema_version":"1.0"},"canonical_sha256":"f7906069e0b29baf2216cdb8136da72361268f52f79cf680d7a2ef5c8f611b94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.589732Z","signature_b64":"mASA7bUf/UcNIPeWK92RJwDWhQMkIpR9c9XWuNVkSKZ666f+7bO5MMyLE+TlaP7J++jqYtenqem1OSJmX8BtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7906069e0b29baf2216cdb8136da72361268f52f79cf680d7a2ef5c8f611b94","last_reissued_at":"2026-05-17T23:42:44.589158Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:44.589158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09094","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-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwzVN04CWv3lB6x0+FjZ2nGtlRubl1xCvqGXgFUvFr2IMybbh9J2TbMbSe6tC6QyKmuA0lnjJiwjdHp2mulBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:03:51.694497Z"},"content_sha256":"c55affe3745a136fc6196bb34b677118b8a2c11c133f0d3d8f2b65dc3eb1b805","schema_version":"1.0","event_id":"sha256:c55affe3745a136fc6196bb34b677118b8a2c11c133f0d3d8f2b65dc3eb1b805"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:66IGA2PAWKN26IQWZW4BG3NHEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mykel J. Kochenderfer, Shushman Choudhury","submitted_at":"2019-06-21T12:41:19Z","abstract_excerpt":"Sequential decision problems in applications such as manipulation in warehouses, multi-step meal preparation, and routing in autonomous vehicle networks often involve reasoning about uncertainty, planning over discrete modes as well as continuous states, and reacting to dynamic updates. To formalize such problems generally, we introduce a class of Markov Decision Processes (MDPs) called Dynamic Multimodal Stochastic Shortest Paths (DMSSPs). Much of the work in these domains solves deterministic variants, which can yield poor results when the uncertainty has downstream effects. We develop a Hyb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09094","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-17T23:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/7Ziy+S4296OykjxYqAZyEnJKt4h2Y7S1OGCuVAT6u/kp0KRc4hjQm2j/Pu0DPXntXgXvZFAvU05iZVR3alECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:03:51.694832Z"},"content_sha256":"daa1fe8c44ed818d768619ccd48c79844241673e573996abefd387cfe6512fb6","schema_version":"1.0","event_id":"sha256:daa1fe8c44ed818d768619ccd48c79844241673e573996abefd387cfe6512fb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66IGA2PAWKN26IQWZW4BG3NHEN/bundle.json","state_url":"https://pith.science/pith/66IGA2PAWKN26IQWZW4BG3NHEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66IGA2PAWKN26IQWZW4BG3NHEN/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-01T23:03:51Z","links":{"resolver":"https://pith.science/pith/66IGA2PAWKN26IQWZW4BG3NHEN","bundle":"https://pith.science/pith/66IGA2PAWKN26IQWZW4BG3NHEN/bundle.json","state":"https://pith.science/pith/66IGA2PAWKN26IQWZW4BG3NHEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66IGA2PAWKN26IQWZW4BG3NHEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:66IGA2PAWKN26IQWZW4BG3NHEN","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":"e632f9a8eb29184eaab91f6c9454fe3d65d0435113dc3a3c3abe8a7f175b3a85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-21T12:41:19Z","title_canon_sha256":"122a9d9a0183afc4f26c4eed114e75380b83dcaf4cee4102c24a222dc9bc3b42"},"schema_version":"1.0","source":{"id":"1906.09094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09094","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09094v1","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09094","created_at":"2026-05-17T23:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"66IGA2PAWKN2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"66IGA2PAWKN26IQW","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"66IGA2PA","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:daa1fe8c44ed818d768619ccd48c79844241673e573996abefd387cfe6512fb6","target":"graph","created_at":"2026-05-17T23:42: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":"Sequential decision problems in applications such as manipulation in warehouses, multi-step meal preparation, and routing in autonomous vehicle networks often involve reasoning about uncertainty, planning over discrete modes as well as continuous states, and reacting to dynamic updates. To formalize such problems generally, we introduce a class of Markov Decision Processes (MDPs) called Dynamic Multimodal Stochastic Shortest Paths (DMSSPs). Much of the work in these domains solves deterministic variants, which can yield poor results when the uncertainty has downstream effects. We develop a Hyb","authors_text":"Mykel J. Kochenderfer, Shushman Choudhury","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-21T12:41:19Z","title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09094","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:c55affe3745a136fc6196bb34b677118b8a2c11c133f0d3d8f2b65dc3eb1b805","target":"record","created_at":"2026-05-17T23:42: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":"e632f9a8eb29184eaab91f6c9454fe3d65d0435113dc3a3c3abe8a7f175b3a85","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-06-21T12:41:19Z","title_canon_sha256":"122a9d9a0183afc4f26c4eed114e75380b83dcaf4cee4102c24a222dc9bc3b42"},"schema_version":"1.0","source":{"id":"1906.09094","kind":"arxiv","version":1}},"canonical_sha256":"f7906069e0b29baf2216cdb8136da72361268f52f79cf680d7a2ef5c8f611b94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7906069e0b29baf2216cdb8136da72361268f52f79cf680d7a2ef5c8f611b94","first_computed_at":"2026-05-17T23:42:44.589158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:44.589158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mASA7bUf/UcNIPeWK92RJwDWhQMkIpR9c9XWuNVkSKZ666f+7bO5MMyLE+TlaP7J++jqYtenqem1OSJmX8BtBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:44.589732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c55affe3745a136fc6196bb34b677118b8a2c11c133f0d3d8f2b65dc3eb1b805","sha256:daa1fe8c44ed818d768619ccd48c79844241673e573996abefd387cfe6512fb6"],"state_sha256":"915a0146a1d9ec5d50c1f3df5f02b4dae02cfd16b4257ba58cf84c271266f6b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wCVgFA4xdZ7lthdlcon/GbX1YEd2k2neafCwViNhqzq5tBu7MXfbxHFG+T/j9U2eyxPhieCwmFoCm0RyrNjnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:03:51.696670Z","bundle_sha256":"7a358105bc5bcf8403480c5cfab87e438d05c6309a37809a9b9e56913a479d00"}}