{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MCQVPOUDZ73J553SI5WXTUBROW","short_pith_number":"pith:MCQVPOUD","canonical_record":{"source":{"id":"1209.0136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-09-01T21:55:03Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3c86a6637c976d4e0b9eb1318252d5b06e8ccc236cd5677351404f371fb90093","abstract_canon_sha256":"58ff57d00c3d57905829e957f9d076d48ca07af824a3c32cd6d0fc6cfe1a11d5"},"schema_version":"1.0"},"canonical_sha256":"60a157ba83cff69ef772476d79d031759caf455c66c2504862f8b9b2144cf20a","source":{"kind":"arxiv","id":"1209.0136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0136","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0136v2","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0136","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"MCQVPOUDZ73J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MCQVPOUDZ73J553S","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MCQVPOUD","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MCQVPOUDZ73J553SI5WXTUBROW","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-09-01T21:55:03Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"3c86a6637c976d4e0b9eb1318252d5b06e8ccc236cd5677351404f371fb90093","abstract_canon_sha256":"58ff57d00c3d57905829e957f9d076d48ca07af824a3c32cd6d0fc6cfe1a11d5"},"schema_version":"1.0"},"canonical_sha256":"60a157ba83cff69ef772476d79d031759caf455c66c2504862f8b9b2144cf20a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:16.312361Z","signature_b64":"jUCe2oTKjq2Z6z85ZYnmnWOdVnBdCY/surnf8MkYHNonOd2Ebn4kofYa0rj59Qu8HrE0lVIjG8wQoEa/ZXMIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a157ba83cff69ef772476d79d031759caf455c66c2504862f8b9b2144cf20a","last_reissued_at":"2026-05-18T03:46:16.311412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:16.311412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0136","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-18T03:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzJ+SGbGRHUMfSpq5/E8SGNpY+V9wXZXHFNQrJZ3jf0cy4A1uMQ4dQC7iXFWdu+TTlK8ltY0HAX7gQEqs1yFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:18:20.244887Z"},"content_sha256":"4d7da7d0ccc31407f03734c3e97e7f8cc6a198740c6231a9509615a4d5f149b7","schema_version":"1.0","event_id":"sha256:4d7da7d0ccc31407f03734c3e97e7f8cc6a198740c6231a9509615a4d5f149b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MCQVPOUDZ73J553SI5WXTUBROW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.RO","authors_text":"Alphan Ulusoy, Calin Belta, Tichakorn Wongpiromsarn","submitted_at":"2012-09-01T21:55:03Z","abstract_excerpt":"In this paper, we present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is assumed to be deterministic, while the agents are probabilistic Markov models. The goal is to control the plant such that the probability of satisfying a syntactically co-safe Linear Temporal Logic formula is maximized. We propose a computationally efficient incremental approach based on the fact that temporal l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0136","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-18T03:46:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PjJzqme4i6S9MqTPh6Dz0c8RENHYSG8Q733ADSg4qw40U19UqLATUA2+MMCi9k+7KuDZs+bMIZgjtqX454cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:18:20.245360Z"},"content_sha256":"a9d48eaa75cd4eca3a9f08824169ef0f4593d523d696b94d630eb7e1f54fb861","schema_version":"1.0","event_id":"sha256:a9d48eaa75cd4eca3a9f08824169ef0f4593d523d696b94d630eb7e1f54fb861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCQVPOUDZ73J553SI5WXTUBROW/bundle.json","state_url":"https://pith.science/pith/MCQVPOUDZ73J553SI5WXTUBROW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCQVPOUDZ73J553SI5WXTUBROW/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-24T06:18:20Z","links":{"resolver":"https://pith.science/pith/MCQVPOUDZ73J553SI5WXTUBROW","bundle":"https://pith.science/pith/MCQVPOUDZ73J553SI5WXTUBROW/bundle.json","state":"https://pith.science/pith/MCQVPOUDZ73J553SI5WXTUBROW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCQVPOUDZ73J553SI5WXTUBROW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MCQVPOUDZ73J553SI5WXTUBROW","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":"58ff57d00c3d57905829e957f9d076d48ca07af824a3c32cd6d0fc6cfe1a11d5","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-09-01T21:55:03Z","title_canon_sha256":"3c86a6637c976d4e0b9eb1318252d5b06e8ccc236cd5677351404f371fb90093"},"schema_version":"1.0","source":{"id":"1209.0136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0136","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0136v2","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0136","created_at":"2026-05-18T03:46:16Z"},{"alias_kind":"pith_short_12","alias_value":"MCQVPOUDZ73J","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MCQVPOUDZ73J553S","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MCQVPOUD","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:a9d48eaa75cd4eca3a9f08824169ef0f4593d523d696b94d630eb7e1f54fb861","target":"graph","created_at":"2026-05-18T03:46:16Z","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 present a method for optimal control synthesis of a plant that interacts with a set of agents in a graph-like environment. The control specification is given as a temporal logic statement about some properties that hold at the vertices of the environment. The plant is assumed to be deterministic, while the agents are probabilistic Markov models. The goal is to control the plant such that the probability of satisfying a syntactically co-safe Linear Temporal Logic formula is maximized. We propose a computationally efficient incremental approach based on the fact that temporal l","authors_text":"Alphan Ulusoy, Calin Belta, Tichakorn Wongpiromsarn","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-09-01T21:55:03Z","title":"Incremental Control Synthesis in Probabilistic Environments with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0136","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:4d7da7d0ccc31407f03734c3e97e7f8cc6a198740c6231a9509615a4d5f149b7","target":"record","created_at":"2026-05-18T03:46:16Z","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":"58ff57d00c3d57905829e957f9d076d48ca07af824a3c32cd6d0fc6cfe1a11d5","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2012-09-01T21:55:03Z","title_canon_sha256":"3c86a6637c976d4e0b9eb1318252d5b06e8ccc236cd5677351404f371fb90093"},"schema_version":"1.0","source":{"id":"1209.0136","kind":"arxiv","version":2}},"canonical_sha256":"60a157ba83cff69ef772476d79d031759caf455c66c2504862f8b9b2144cf20a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60a157ba83cff69ef772476d79d031759caf455c66c2504862f8b9b2144cf20a","first_computed_at":"2026-05-18T03:46:16.311412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:16.311412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jUCe2oTKjq2Z6z85ZYnmnWOdVnBdCY/surnf8MkYHNonOd2Ebn4kofYa0rj59Qu8HrE0lVIjG8wQoEa/ZXMIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:16.312361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d7da7d0ccc31407f03734c3e97e7f8cc6a198740c6231a9509615a4d5f149b7","sha256:a9d48eaa75cd4eca3a9f08824169ef0f4593d523d696b94d630eb7e1f54fb861"],"state_sha256":"b49ff64fd719bdda1f65ec512a19ee916b19dceb71d80eee388f8c7524f56888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aj3k+S+xkSuJzfBVdHiEV08Kq6bG4GcV2S/lj5UAon2hsvCWDr4AL9WTTxyih/ZBfw38Nn7OBCrOuWHxN7wKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:18:20.247838Z","bundle_sha256":"7218040773fb66407639208454cd906dd2039a50056b8110d06309e72c069038"}}