{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GPMTNEBOTFLYUIIWN6UVXUTNXZ","short_pith_number":"pith:GPMTNEBO","canonical_record":{"source":{"id":"1809.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T12:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"afcd2d5f7d293ed8d7d05bab2009393b46d19ae1bf948575bf79587fab4f1292","abstract_canon_sha256":"817377892ae7aa3a5aaecf41eb2bd063ee18b68320d3836eae6ea9ad12c356f9"},"schema_version":"1.0"},"canonical_sha256":"33d936902e99578a21166fa95bd26dbe5d9397df0b076db59985af4fb953a2f6","source":{"kind":"arxiv","id":"1809.05867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05867","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05867v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05867","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"GPMTNEBOTFLY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPMTNEBOTFLYUIIW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPMTNEBO","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GPMTNEBOTFLYUIIWN6UVXUTNXZ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.05867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T12:53:28Z","cross_cats_sorted":[],"title_canon_sha256":"afcd2d5f7d293ed8d7d05bab2009393b46d19ae1bf948575bf79587fab4f1292","abstract_canon_sha256":"817377892ae7aa3a5aaecf41eb2bd063ee18b68320d3836eae6ea9ad12c356f9"},"schema_version":"1.0"},"canonical_sha256":"33d936902e99578a21166fa95bd26dbe5d9397df0b076db59985af4fb953a2f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.266958Z","signature_b64":"G+MIh90HJUuaIgt4Jb6zFjbHNUoKmAij6ytcTEc1b8ZAB+v6QP+5oIJDAlKjNUZwcKX9DA5K9oeMZXrQIZ6HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33d936902e99578a21166fa95bd26dbe5d9397df0b076db59985af4fb953a2f6","last_reissued_at":"2026-05-18T00:05:36.266422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.266422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.05867","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-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UwjwJEDmxP/X/h6JOUFq+oSFxtaV9b9fR2/EztFRRvAzHfacZlK0et7PDjgPR1b+RgoUNBgbs7ZAttXfzdJCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:00:27.709261Z"},"content_sha256":"5b0d078d21c8b9784d4a88c3545433925f48c48fbc4ebcab402f81843365aab3","schema_version":"1.0","event_id":"sha256:5b0d078d21c8b9784d4a88c3545433925f48c48fbc4ebcab402f81843365aab3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GPMTNEBOTFLYUIIWN6UVXUTNXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Continuous-Time Robust Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Tao Bian, Zhong-Ping Jiang","submitted_at":"2018-09-16T12:53:28Z","abstract_excerpt":"This paper presents a new theory, known as robust dynamic pro- gramming, for a class of continuous-time dynamical systems. Different from traditional dynamic programming (DP) methods, this new theory serves as a fundamental tool to analyze the robustness of DP algorithms, and in par- ticular, to develop novel adaptive optimal control and reinforcement learning methods. In order to demonstrate the potential of this new framework, four illustrative applications in the fields of stochastic optimal control and adaptive DP are presented. Three numerical examples arising from both finance and engine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05867","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-18T00:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9se5NgB4TxjCY2kcmr7V7pRALScgDJ93mAg8+UoJF7wav3SBbvdYd7tfylJeQfnThFmKYLzslPfxyMS1PVIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:00:27.709932Z"},"content_sha256":"e0b9f28182ce25f18ccbe40be00eca7e483c96278f5cd480911282524e3ce071","schema_version":"1.0","event_id":"sha256:e0b9f28182ce25f18ccbe40be00eca7e483c96278f5cd480911282524e3ce071"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/bundle.json","state_url":"https://pith.science/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/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-20T00:00:27Z","links":{"resolver":"https://pith.science/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ","bundle":"https://pith.science/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/bundle.json","state":"https://pith.science/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPMTNEBOTFLYUIIWN6UVXUTNXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GPMTNEBOTFLYUIIWN6UVXUTNXZ","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":"817377892ae7aa3a5aaecf41eb2bd063ee18b68320d3836eae6ea9ad12c356f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T12:53:28Z","title_canon_sha256":"afcd2d5f7d293ed8d7d05bab2009393b46d19ae1bf948575bf79587fab4f1292"},"schema_version":"1.0","source":{"id":"1809.05867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05867","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05867v1","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05867","created_at":"2026-05-18T00:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"GPMTNEBOTFLY","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GPMTNEBOTFLYUIIW","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GPMTNEBO","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:e0b9f28182ce25f18ccbe40be00eca7e483c96278f5cd480911282524e3ce071","target":"graph","created_at":"2026-05-18T00:05:36Z","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":"This paper presents a new theory, known as robust dynamic pro- gramming, for a class of continuous-time dynamical systems. Different from traditional dynamic programming (DP) methods, this new theory serves as a fundamental tool to analyze the robustness of DP algorithms, and in par- ticular, to develop novel adaptive optimal control and reinforcement learning methods. In order to demonstrate the potential of this new framework, four illustrative applications in the fields of stochastic optimal control and adaptive DP are presented. Three numerical examples arising from both finance and engine","authors_text":"Tao Bian, Zhong-Ping Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T12:53:28Z","title":"Continuous-Time Robust Dynamic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05867","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:5b0d078d21c8b9784d4a88c3545433925f48c48fbc4ebcab402f81843365aab3","target":"record","created_at":"2026-05-18T00:05:36Z","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":"817377892ae7aa3a5aaecf41eb2bd063ee18b68320d3836eae6ea9ad12c356f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-16T12:53:28Z","title_canon_sha256":"afcd2d5f7d293ed8d7d05bab2009393b46d19ae1bf948575bf79587fab4f1292"},"schema_version":"1.0","source":{"id":"1809.05867","kind":"arxiv","version":1}},"canonical_sha256":"33d936902e99578a21166fa95bd26dbe5d9397df0b076db59985af4fb953a2f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33d936902e99578a21166fa95bd26dbe5d9397df0b076db59985af4fb953a2f6","first_computed_at":"2026-05-18T00:05:36.266422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:36.266422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G+MIh90HJUuaIgt4Jb6zFjbHNUoKmAij6ytcTEc1b8ZAB+v6QP+5oIJDAlKjNUZwcKX9DA5K9oeMZXrQIZ6HCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:36.266958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b0d078d21c8b9784d4a88c3545433925f48c48fbc4ebcab402f81843365aab3","sha256:e0b9f28182ce25f18ccbe40be00eca7e483c96278f5cd480911282524e3ce071"],"state_sha256":"7554b15907fb2575748999ffe61bb4932b577252d502dd853c2f661e30d897f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3dEAEVgJU3X0ny06T/ARMuVQu4FeNde6T7kzwCUtNbbF2PRQpDAfqjX3OTcxcK+AHWUVn0C0OLSWE4YtKQiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:00:27.713578Z","bundle_sha256":"cf4586a2a345ba55eb67a00378123c5443b1bd81e38a1e50f1b16046ad863b62"}}