{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5KZVZK7T5EM6AG7KPYO5NZ4LOM","short_pith_number":"pith:5KZVZK7T","schema_version":"1.0","canonical_sha256":"eab35cabf3e919e01bea7e1dd6e78b7301e1463350a043859df7c969a8836046","source":{"kind":"arxiv","id":"1103.4342","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.4342","created_at":"2026-05-18T04:26:02.197562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.4342v2","created_at":"2026-05-18T04:26:02.197562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4342","created_at":"2026-05-18T04:26:02.197562+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KZVZK7T5EM6","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KZVZK7T5EM6AG7K","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KZVZK7T","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM","json":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM.json","graph_json":"https://pith.science/api/pith-number/5KZVZK7T5EM6AG7KPYO5NZ4LOM/graph.json","events_json":"https://pith.science/api/pith-number/5KZVZK7T5EM6AG7KPYO5NZ4LOM/events.json","paper":"https://pith.science/paper/5KZVZK7T"},"agent_actions":{"view_html":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM","download_json":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM.json","view_paper":"https://pith.science/paper/5KZVZK7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.4342&json=true","fetch_graph":"https://pith.science/api/pith-number/5KZVZK7T5EM6AG7KPYO5NZ4LOM/graph.json","fetch_events":"https://pith.science/api/pith-number/5KZVZK7T5EM6AG7KPYO5NZ4LOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/action/storage_attestation","attest_author":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/action/author_attestation","sign_citation":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/action/citation_signature","submit_replication":"https://pith.science/pith/5KZVZK7T5EM6AG7KPYO5NZ4LOM/action/replication_record"}},"created_at":"2026-05-18T04:26:02.197562+00:00","updated_at":"2026-05-18T04:26:02.197562+00:00"}