{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JXALZLG3VG6S7SXYQV4BBTBTL3","short_pith_number":"pith:JXALZLG3","canonical_record":{"source":{"id":"1810.02199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T13:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"badc6053b93bfd84525c9319276c9e88922041cf8f319dcc3e6ddbe9807fec38","abstract_canon_sha256":"b1e78789e753968183ab32ca30fa9c8ddf9fdad62592c2bd8ff4dcf33b8dde33"},"schema_version":"1.0"},"canonical_sha256":"4dc0bcacdba9bd2fcaf8857810cc335ecd8988670e3db3d3bf151edfc3d55ae0","source":{"kind":"arxiv","id":"1810.02199","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02199","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02199v2","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02199","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"JXALZLG3VG6S","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JXALZLG3VG6S7SXY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JXALZLG3","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JXALZLG3VG6S7SXYQV4BBTBTL3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02199","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T13:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"badc6053b93bfd84525c9319276c9e88922041cf8f319dcc3e6ddbe9807fec38","abstract_canon_sha256":"b1e78789e753968183ab32ca30fa9c8ddf9fdad62592c2bd8ff4dcf33b8dde33"},"schema_version":"1.0"},"canonical_sha256":"4dc0bcacdba9bd2fcaf8857810cc335ecd8988670e3db3d3bf151edfc3d55ae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:02.142859Z","signature_b64":"Hq1IDmRALGn8EOw6+mGsflwwzIqbSm2lG9E0kNYp0h7F3EA/Gf6x/UNJjp94T8Z85XvFQlTaPYHr739wPjFcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4dc0bcacdba9bd2fcaf8857810cc335ecd8988670e3db3d3bf151edfc3d55ae0","last_reissued_at":"2026-05-18T00:04:02.142119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:02.142119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02199","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-05-18T00:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQ1ku6ex1oeaW61igL4qRCAus8r3FXB4Dam2DHQ6f7JO0lmlFMhyFt64NMIWDj557ZRGKWMnDlMnAGfDuJTuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:44:10.015929Z"},"content_sha256":"6be52cc3d09e92582fd2688014e66dc42b699da4f6ff44225c696aa4f586da39","schema_version":"1.0","event_id":"sha256:6be52cc3d09e92582fd2688014e66dc42b699da4f6ff44225c696aa4f586da39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JXALZLG3VG6S7SXYQV4BBTBTL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Fu, Lening Li","submitted_at":"2018-10-04T13:19:26Z","abstract_excerpt":"In this paper, we develop approximate dynamic programming methods for stochastic systems modeled as Markov Decision Processes, given both soft performance criteria and hard constraints in a class of probabilistic temporal logic called Probabilistic Computation Tree Logic (PCTL). Our approach consists of two steps: First, we show how to transform a class of PCTL formulas into chance constraints that can be enforced during planning in stochastic systems. Second, by integrating randomized optimization and entropy-regulated dynamic programming, we devise a novel trajectory sampling-based approxima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02199","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":""},"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:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UppdIMzjC1LhzhHAy+y29EKuPPMt3sViZl/G7EHyR7ipaMxbEE/bQy1WpK7/U5CW1/JzejKc6sP8FDs0dU+oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:44:10.016275Z"},"content_sha256":"04a788a22de9bad6cbd5ba975afb98090c19a357cf00910aee0b860fd493fb10","schema_version":"1.0","event_id":"sha256:04a788a22de9bad6cbd5ba975afb98090c19a357cf00910aee0b860fd493fb10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/bundle.json","state_url":"https://pith.science/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/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-08T13:44:10Z","links":{"resolver":"https://pith.science/pith/JXALZLG3VG6S7SXYQV4BBTBTL3","bundle":"https://pith.science/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/bundle.json","state":"https://pith.science/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JXALZLG3VG6S7SXYQV4BBTBTL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JXALZLG3VG6S7SXYQV4BBTBTL3","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":"b1e78789e753968183ab32ca30fa9c8ddf9fdad62592c2bd8ff4dcf33b8dde33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T13:19:26Z","title_canon_sha256":"badc6053b93bfd84525c9319276c9e88922041cf8f319dcc3e6ddbe9807fec38"},"schema_version":"1.0","source":{"id":"1810.02199","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02199","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02199v2","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02199","created_at":"2026-05-18T00:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"JXALZLG3VG6S","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JXALZLG3VG6S7SXY","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JXALZLG3","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:04a788a22de9bad6cbd5ba975afb98090c19a357cf00910aee0b860fd493fb10","target":"graph","created_at":"2026-05-18T00:04:02Z","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 paper, we develop approximate dynamic programming methods for stochastic systems modeled as Markov Decision Processes, given both soft performance criteria and hard constraints in a class of probabilistic temporal logic called Probabilistic Computation Tree Logic (PCTL). Our approach consists of two steps: First, we show how to transform a class of PCTL formulas into chance constraints that can be enforced during planning in stochastic systems. Second, by integrating randomized optimization and entropy-regulated dynamic programming, we devise a novel trajectory sampling-based approxima","authors_text":"Jie Fu, Lening Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T13:19:26Z","title":"Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02199","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:6be52cc3d09e92582fd2688014e66dc42b699da4f6ff44225c696aa4f586da39","target":"record","created_at":"2026-05-18T00:04:02Z","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":"b1e78789e753968183ab32ca30fa9c8ddf9fdad62592c2bd8ff4dcf33b8dde33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-04T13:19:26Z","title_canon_sha256":"badc6053b93bfd84525c9319276c9e88922041cf8f319dcc3e6ddbe9807fec38"},"schema_version":"1.0","source":{"id":"1810.02199","kind":"arxiv","version":2}},"canonical_sha256":"4dc0bcacdba9bd2fcaf8857810cc335ecd8988670e3db3d3bf151edfc3d55ae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4dc0bcacdba9bd2fcaf8857810cc335ecd8988670e3db3d3bf151edfc3d55ae0","first_computed_at":"2026-05-18T00:04:02.142119Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:02.142119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hq1IDmRALGn8EOw6+mGsflwwzIqbSm2lG9E0kNYp0h7F3EA/Gf6x/UNJjp94T8Z85XvFQlTaPYHr739wPjFcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:02.142859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02199","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6be52cc3d09e92582fd2688014e66dc42b699da4f6ff44225c696aa4f586da39","sha256:04a788a22de9bad6cbd5ba975afb98090c19a357cf00910aee0b860fd493fb10"],"state_sha256":"6557e56df96c292cedd4a6099febaefc7ca7e84f1b75285a89518814e424d041"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGuxU+Wvd8AUnbmqpoesSdBJPs6aA270Jp7nXTd1IXDyOH02qq08Ai7mLUCxhDsI6XzSaFpvos7jFjSH1IsHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:44:10.018345Z","bundle_sha256":"0bc924b87c42e26aa89ac60c8291a9fcd068ec2fcbdf739f1685b2aab2a60823"}}