{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CJTLBR54H5QPJNULJHBKG2TBNX","short_pith_number":"pith:CJTLBR54","canonical_record":{"source":{"id":"1512.08734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-29T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"4c4a81e6d3be756c82af060b2a752727f06caaf2d9484118d8b874d77a495236","abstract_canon_sha256":"7831d206fc3cec393c1b6ac19e5cdc0cf9d7d146eb74e6721d4b0958dfbb50d0"},"schema_version":"1.0"},"canonical_sha256":"1266b0c7bc3f60f4b68b49c2a36a616dcb3d2548c9ec46f07c88df4d077cae40","source":{"kind":"arxiv","id":"1512.08734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08734","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08734v1","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08734","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"CJTLBR54H5QP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJTLBR54H5QPJNUL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJTLBR54","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CJTLBR54H5QPJNULJHBKG2TBNX","target":"record","payload":{"canonical_record":{"source":{"id":"1512.08734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-29T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"4c4a81e6d3be756c82af060b2a752727f06caaf2d9484118d8b874d77a495236","abstract_canon_sha256":"7831d206fc3cec393c1b6ac19e5cdc0cf9d7d146eb74e6721d4b0958dfbb50d0"},"schema_version":"1.0"},"canonical_sha256":"1266b0c7bc3f60f4b68b49c2a36a616dcb3d2548c9ec46f07c88df4d077cae40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:35.024417Z","signature_b64":"rC8G/0Ez3cjtu65dWw2aGSwyR3VDXK0/XCQzB4m0Xk1vb2TSG52Q7Z7HPrKyapDllcPjclV5yhEgayD3rOEuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1266b0c7bc3f60f4b68b49c2a36a616dcb3d2548c9ec46f07c88df4d077cae40","last_reissued_at":"2026-05-18T01:23:35.023671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:35.023671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.08734","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-18T01:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoqIbNsw9MciWtVFSPDmVRzMn0RWWoFASkeu0I8qPfocRNCMzY8lu6Fqwh8xsvrxahGCeOernhToeFU2qd7jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:54:52.649627Z"},"content_sha256":"5df3a66aca89a702e5ff7c5a6bfa045c5071f98d63a4f82779a13dec174642a0","schema_version":"1.0","event_id":"sha256:5df3a66aca89a702e5ff7c5a6bfa045c5071f98d63a4f82779a13dec174642a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CJTLBR54H5QPJNULJHBKG2TBNX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Piecewise-Deterministic Optimal Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Vladimirsky, Zhengdi Shen","submitted_at":"2015-12-29T17:24:05Z","abstract_excerpt":"We consider piecewise-deterministic optimal control problems in which the environment randomly switches among several deterministic modes, and the goal is to optimize the expected cost up to the termination while taking the likelihood of future mode-switches into account. The dynamic programming approach yields a weakly-coupled system of Hamilton-Jacobi-Bellman PDEs satisfied by the value functions of individual modes. We derive and implement semi-Lagrangian and Eulerian numerical schemes for that system. We further recover simpler, \"asymptotically optimal\" controls and test their performance "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08734","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-18T01:23:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gy9WlnaUiQJcG9CxwNoN6VCKfKcbWIDd+8jIg2SnmVZd5M48tQ8Lq75aJ2VN3yRsqbhWVEdQMfhUn/bJcVgkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:54:52.650265Z"},"content_sha256":"5adaddd2c1c69deb94d8d1dfde943692b682b786b6839f2f33271f78dfa3b29c","schema_version":"1.0","event_id":"sha256:5adaddd2c1c69deb94d8d1dfde943692b682b786b6839f2f33271f78dfa3b29c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJTLBR54H5QPJNULJHBKG2TBNX/bundle.json","state_url":"https://pith.science/pith/CJTLBR54H5QPJNULJHBKG2TBNX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJTLBR54H5QPJNULJHBKG2TBNX/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-29T21:54:52Z","links":{"resolver":"https://pith.science/pith/CJTLBR54H5QPJNULJHBKG2TBNX","bundle":"https://pith.science/pith/CJTLBR54H5QPJNULJHBKG2TBNX/bundle.json","state":"https://pith.science/pith/CJTLBR54H5QPJNULJHBKG2TBNX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJTLBR54H5QPJNULJHBKG2TBNX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CJTLBR54H5QPJNULJHBKG2TBNX","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":"7831d206fc3cec393c1b6ac19e5cdc0cf9d7d146eb74e6721d4b0958dfbb50d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-29T17:24:05Z","title_canon_sha256":"4c4a81e6d3be756c82af060b2a752727f06caaf2d9484118d8b874d77a495236"},"schema_version":"1.0","source":{"id":"1512.08734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08734","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08734v1","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08734","created_at":"2026-05-18T01:23:35Z"},{"alias_kind":"pith_short_12","alias_value":"CJTLBR54H5QP","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CJTLBR54H5QPJNUL","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CJTLBR54","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:5adaddd2c1c69deb94d8d1dfde943692b682b786b6839f2f33271f78dfa3b29c","target":"graph","created_at":"2026-05-18T01:23:35Z","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":"We consider piecewise-deterministic optimal control problems in which the environment randomly switches among several deterministic modes, and the goal is to optimize the expected cost up to the termination while taking the likelihood of future mode-switches into account. The dynamic programming approach yields a weakly-coupled system of Hamilton-Jacobi-Bellman PDEs satisfied by the value functions of individual modes. We derive and implement semi-Lagrangian and Eulerian numerical schemes for that system. We further recover simpler, \"asymptotically optimal\" controls and test their performance ","authors_text":"Alexander Vladimirsky, Zhengdi Shen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-29T17:24:05Z","title":"Piecewise-Deterministic Optimal Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08734","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:5df3a66aca89a702e5ff7c5a6bfa045c5071f98d63a4f82779a13dec174642a0","target":"record","created_at":"2026-05-18T01:23:35Z","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":"7831d206fc3cec393c1b6ac19e5cdc0cf9d7d146eb74e6721d4b0958dfbb50d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-29T17:24:05Z","title_canon_sha256":"4c4a81e6d3be756c82af060b2a752727f06caaf2d9484118d8b874d77a495236"},"schema_version":"1.0","source":{"id":"1512.08734","kind":"arxiv","version":1}},"canonical_sha256":"1266b0c7bc3f60f4b68b49c2a36a616dcb3d2548c9ec46f07c88df4d077cae40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1266b0c7bc3f60f4b68b49c2a36a616dcb3d2548c9ec46f07c88df4d077cae40","first_computed_at":"2026-05-18T01:23:35.023671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:35.023671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rC8G/0Ez3cjtu65dWw2aGSwyR3VDXK0/XCQzB4m0Xk1vb2TSG52Q7Z7HPrKyapDllcPjclV5yhEgayD3rOEuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:35.024417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5df3a66aca89a702e5ff7c5a6bfa045c5071f98d63a4f82779a13dec174642a0","sha256:5adaddd2c1c69deb94d8d1dfde943692b682b786b6839f2f33271f78dfa3b29c"],"state_sha256":"66f09b5998d4ba9ce08061c2221b716b033fb75a51151a660913fa73356245d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tAcqezc1BePSE7ef9k8WU2NlC/Al0qEgrWOCVNj82JLDFicEY0GauRwzJXze8w5KDMmnsdxND7v1yH3MvXjGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:54:52.653976Z","bundle_sha256":"27c45b24815c9d20453eb4103add3eea43e4b62f5b91fec588ac19bc433a4d09"}}