{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3FLXMR7CUJHA5OK564GOHB5VNJ","short_pith_number":"pith:3FLXMR7C","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"},"canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","source":{"kind":"arxiv","id":"1503.07193","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07193","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07193v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07193","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"3FLXMR7CUJHA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FLXMR7CUJHA5OK5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FLXMR7C","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3FLXMR7CUJHA5OK564GOHB5VNJ","target":"record","payload":{"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"},"canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","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"},"source_kind":"arxiv","source_id":"1503.07193","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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CS8N3GwYV29HBhTVVwB3qV0JQHLHGNwf1jQhWWQijqlsjtLrI7NQfBD5RevojpdBFvGJtj8ftnQTUm8XyRbxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:27.769104Z"},"content_sha256":"d35c921b43e82bae75e703f3c1828cd9f8c5ba6afce4e54ebf4cc61c10592d30","schema_version":"1.0","event_id":"sha256:d35c921b43e82bae75e703f3c1828cd9f8c5ba6afce4e54ebf4cc61c10592d30"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3FLXMR7CUJHA5OK564GOHB5VNJ","target":"graph","payload":{"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"},"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-18T02:18:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S61BMdlj1iZR6xDXUgOoN1bHJWC2ouNoMJiZPh1gieGH7ER2GkP/yfw6shJD4S2j2cDBWlrOMCGUhMo2OOdPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:18:27.769673Z"},"content_sha256":"574eb958e805e4a14eb5e041a3c013077c7c055bf946689c0033321434ede941","schema_version":"1.0","event_id":"sha256:574eb958e805e4a14eb5e041a3c013077c7c055bf946689c0033321434ede941"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/bundle.json","state_url":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/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-07T16:18:27Z","links":{"resolver":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ","bundle":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/bundle.json","state":"https://pith.science/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FLXMR7CUJHA5OK564GOHB5VNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3FLXMR7CUJHA5OK564GOHB5VNJ","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":"2b9fb0cd95badeebe458315f1474cbb52e48b88b81960c178a7c000fd58a1bd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:40:04Z","title_canon_sha256":"35fc12ff3787bf8fa710ee7f0046a6ae6b1bced5bed915e71cbd3875ce2043a4"},"schema_version":"1.0","source":{"id":"1503.07193","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07193","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07193v2","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07193","created_at":"2026-05-18T02:18:23Z"},{"alias_kind":"pith_short_12","alias_value":"3FLXMR7CUJHA","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FLXMR7CUJHA5OK5","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FLXMR7C","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:574eb958e805e4a14eb5e041a3c013077c7c055bf946689c0033321434ede941","target":"graph","created_at":"2026-05-18T02:18:23Z","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 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","authors_text":"Jie Fu, Ufuk Topcu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:40:04Z","title":"Computational methods for stochastic control with metric interval temporal logic specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07193","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:d35c921b43e82bae75e703f3c1828cd9f8c5ba6afce4e54ebf4cc61c10592d30","target":"record","created_at":"2026-05-18T02:18:23Z","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":"2b9fb0cd95badeebe458315f1474cbb52e48b88b81960c178a7c000fd58a1bd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-03-24T20:40:04Z","title_canon_sha256":"35fc12ff3787bf8fa710ee7f0046a6ae6b1bced5bed915e71cbd3875ce2043a4"},"schema_version":"1.0","source":{"id":"1503.07193","kind":"arxiv","version":2}},"canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9577647e2a24e0eb95df70ce387b56a67c50dd6dbcc693762a1f54e27573114","first_computed_at":"2026-05-18T02:18:23.255199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:23.255199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ncOSf+AINNUS77+WzD+2LEvwHl4lA1ccxrn+15QjO6PM1VC7FckF/qOQp9utxMFGkXBF5ooWvuFk22z4olLyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:23.256011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07193","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d35c921b43e82bae75e703f3c1828cd9f8c5ba6afce4e54ebf4cc61c10592d30","sha256:574eb958e805e4a14eb5e041a3c013077c7c055bf946689c0033321434ede941"],"state_sha256":"bd1b50d9db5f86f4e5532469ee75748703ef6de95427dbd86ce6da23f0971fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahLe9nx8l+j116gX0Gx9NjKF7sHHzLEBQI91o2rFwu7OTxbBDp9nAdOXdsBpLTaB+/r7PEu3OZtm+oTUCDVlBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:18:27.773123Z","bundle_sha256":"c61d7d1f1f7b257cf3d3c0d570b68dae4aa64c12d7e63f95ff2fff32fca16e70"}}