{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3FLXMR7CUJHA5OK564GOHB5VNJ","short_pith_number":"pith:3FLXMR7C","schema_version":"1.0","canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","source":{"kind":"arxiv","id":"1503.07193","version":2},"attestation_state":"computed","paper":{"title":"Computational methods for stochastic control with metric interval temporal logic specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Jie Fu, Ufuk Topcu","submitted_at":"2015-03-24T20:40:04Z","abstract_excerpt":"This paper studies an optimal control problem for continuous-time stochastic systems subject to reachability objectives specified in a subclass of metric interval temporal logic specifications, a temporal logic with real-time constraints. We propose a probabilistic method for synthesizing an optimal control policy that maximizes the probability of satisfying a specification based on a discrete approximation of the underlying stochastic system. First, we show that the original problem can be formulated as a stochastic optimal control problem in a state space augmented with finite memory and sta"},"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":"1503.07193","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"35fc12ff3787bf8fa710ee7f0046a6ae6b1bced5bed915e71cbd3875ce2043a4","abstract_canon_sha256":"2b9fb0cd95badeebe458315f1474cbb52e48b88b81960c178a7c000fd58a1bd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.256011Z","signature_b64":"ncOSf+AINNUS77+WzD+2LEvwHl4lA1ccxrn+15QjO6PM1VC7FckF/qOQp9utxMFGkXBF5ooWvuFk22z4olLyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","last_reissued_at":"2026-05-18T02:18:23.255199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.255199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational methods for stochastic control with metric interval temporal logic specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Jie Fu, Ufuk Topcu","submitted_at":"2015-03-24T20:40:04Z","abstract_excerpt":"This paper studies an optimal control problem for continuous-time stochastic systems subject to reachability objectives specified in a subclass of metric interval temporal logic specifications, a temporal logic with real-time constraints. We propose a probabilistic method for synthesizing an optimal control policy that maximizes the probability of satisfying a specification based on a discrete approximation of the underlying stochastic system. First, we show that the original problem can be formulated as a stochastic optimal control problem in a state space augmented with finite memory and sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07193","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":"1503.07193","created_at":"2026-05-18T02:18:23.255311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07193v2","created_at":"2026-05-18T02:18:23.255311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07193","created_at":"2026-05-18T02:18:23.255311+00:00"},{"alias_kind":"pith_short_12","alias_value":"3FLXMR7CUJHA","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3FLXMR7CUJHA5OK5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3FLXMR7C","created_at":"2026-05-18T12:29:02.477457+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/3FLXMR7CUJHA5OK564GOHB5VNJ","json":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ.json","graph_json":"https://pith.science/api/pith-number/3FLXMR7CUJHA5OK564GOHB5VNJ/graph.json","events_json":"https://pith.science/api/pith-number/3FLXMR7CUJHA5OK564GOHB5VNJ/events.json","paper":"https://pith.science/paper/3FLXMR7C"},"agent_actions":{"view_html":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ","download_json":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ.json","view_paper":"https://pith.science/paper/3FLXMR7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07193&json=true","fetch_graph":"https://pith.science/api/pith-number/3FLXMR7CUJHA5OK564GOHB5VNJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3FLXMR7CUJHA5OK564GOHB5VNJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/action/storage_attestation","attest_author":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/action/author_attestation","sign_citation":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/action/citation_signature","submit_replication":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/action/replication_record"}},"created_at":"2026-05-18T02:18:23.255311+00:00","updated_at":"2026-05-18T02:18:23.255311+00:00"}