{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5KZVZK7T5EM6AG7KPYO5NZ4LOM","short_pith_number":"pith:5KZVZK7T","canonical_record":{"source":{"id":"1103.4342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-03-22T18:36:36Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"e0827fd9343d5cace49f7aac1aee144eddf537ce3da1fa70727b8ab1e6bf74df","abstract_canon_sha256":"360ce9f807e40ab52c2d46e513b9980cd22cb30e4b80bfaa25efe7831a0d9ab6"},"schema_version":"1.0"},"canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","source":{"kind":"arxiv","id":"1103.4342","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4342","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4342v2","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4342","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"5KZVZK7T5EM6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5KZVZK7T5EM6AG7K","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5KZVZK7T","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5KZVZK7T5EM6AG7KPYO5NZ4LOM","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4342","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-03-22T18:36:36Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"e0827fd9343d5cace49f7aac1aee144eddf537ce3da1fa70727b8ab1e6bf74df","abstract_canon_sha256":"360ce9f807e40ab52c2d46e513b9980cd22cb30e4b80bfaa25efe7831a0d9ab6"},"schema_version":"1.0"},"canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:02.198071Z","signature_b64":"0UUkWHt88XvZnRhMxS84SnLUk4TNagTiEIo6xwYr4KRczPL++QGtAS4FooVE5iOzTJg/UtYLQdo34CdQ9nfGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","last_reissued_at":"2026-05-18T04:26:02.197479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:02.197479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4342","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-18T04:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xYVZrTBBZdTmdfkmNFQff/GymUyGCJk4SVuLp2Av2xGgfGLYqSjg2C2mz169YV7sKOo1RWVFri/vz0Mfm6hBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:38:25.639470Z"},"content_sha256":"280b94db60e56c885a514313429d382585c89cc7254e3378606656cfad142188","schema_version":"1.0","event_id":"sha256:280b94db60e56c885a514313429d382585c89cc7254e3378606656cfad142188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5KZVZK7T5EM6AG7KPYO5NZ4LOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MDP Optimal Control under Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Calin Belta, Daniela Rus, Stephen L. Smith, Xu Chu Ding","submitted_at":"2011-03-22T18:36:36Z","abstract_excerpt":"In this paper, we develop a method to automatically generate a control policy for a dynamical system modeled as a Markov Decision Process (MDP). The control specification is given as a Linear Temporal Logic (LTL) formula over a set of propositions defined on the states of the MDP. We synthesize a control policy such that the MDP satisfies the given specification almost surely, if such a policy exists. In addition, we designate an \"optimizing proposition\" to be repeatedly satisfied, and we formulate a novel optimization criterion in terms of minimizing the expected cost in between satisfactions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4342","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-18T04:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XL/u/n/474BxxmyhsPuzsefz2d6kSHFGADUcb1CvD/Cb0eph0ZGuYMgEy4yICLA4Q8Wb6Jioxq1+3A5I3g1JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:38:25.639814Z"},"content_sha256":"080801830334f1ce064504035cece7984ee21a375549c864230e9461396c664a","schema_version":"1.0","event_id":"sha256:080801830334f1ce064504035cece7984ee21a375549c864230e9461396c664a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/bundle.json","state_url":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/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-05T04:38:25Z","links":{"resolver":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM","bundle":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/bundle.json","state":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5KZVZK7T5EM6AG7KPYO5NZ4LOM","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":"360ce9f807e40ab52c2d46e513b9980cd22cb30e4b80bfaa25efe7831a0d9ab6","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-03-22T18:36:36Z","title_canon_sha256":"e0827fd9343d5cace49f7aac1aee144eddf537ce3da1fa70727b8ab1e6bf74df"},"schema_version":"1.0","source":{"id":"1103.4342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4342","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4342v2","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4342","created_at":"2026-05-18T04:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"5KZVZK7T5EM6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5KZVZK7T5EM6AG7K","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5KZVZK7T","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:080801830334f1ce064504035cece7984ee21a375549c864230e9461396c664a","target":"graph","created_at":"2026-05-18T04:26: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 a method to automatically generate a control policy for a dynamical system modeled as a Markov Decision Process (MDP). The control specification is given as a Linear Temporal Logic (LTL) formula over a set of propositions defined on the states of the MDP. We synthesize a control policy such that the MDP satisfies the given specification almost surely, if such a policy exists. In addition, we designate an \"optimizing proposition\" to be repeatedly satisfied, and we formulate a novel optimization criterion in terms of minimizing the expected cost in between satisfactions","authors_text":"Calin Belta, Daniela Rus, Stephen L. Smith, Xu Chu Ding","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-03-22T18:36:36Z","title":"MDP Optimal Control under Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4342","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:280b94db60e56c885a514313429d382585c89cc7254e3378606656cfad142188","target":"record","created_at":"2026-05-18T04:26: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":"360ce9f807e40ab52c2d46e513b9980cd22cb30e4b80bfaa25efe7831a0d9ab6","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-03-22T18:36:36Z","title_canon_sha256":"e0827fd9343d5cace49f7aac1aee144eddf537ce3da1fa70727b8ab1e6bf74df"},"schema_version":"1.0","source":{"id":"1103.4342","kind":"arxiv","version":2}},"canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","first_computed_at":"2026-05-18T04:26:02.197479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:02.197479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0UUkWHt88XvZnRhMxS84SnLUk4TNagTiEIo6xwYr4KRczPL++QGtAS4FooVE5iOzTJg/UtYLQdo34CdQ9nfGAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:02.198071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:280b94db60e56c885a514313429d382585c89cc7254e3378606656cfad142188","sha256:080801830334f1ce064504035cece7984ee21a375549c864230e9461396c664a"],"state_sha256":"f627d6efec23d397eca5ecc6affe16dff55470e4798e4ee55d42c7d2be71cd12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+p77gM+JVpEPpiMwOdAfbq6LVSk7TJeMj7XjFAOYrql/jG/4OOyEATehDsvKAtIx8b7Ru8G7P4driBiC5BnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:38:25.641862Z","bundle_sha256":"97e22b575120e923fba972275786b2b4efa4100058550b0f8589abd2a327cc2b"}}