{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CUBGAICPJKKPAGUCBTJFIZDIFS","short_pith_number":"pith:CUBGAICP","schema_version":"1.0","canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","source":{"kind":"arxiv","id":"1307.3224","version":1},"attestation_state":"computed","paper":{"title":"Negotiating the Probabilistic Satisfaction of Temporal Logic Motion Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Igor Cizelj","submitted_at":"2013-07-11T19:31:36Z","abstract_excerpt":"We propose a human-supervised control synthesis method for a stochastic Dubins vehicle such that the probability of satisfying a specification given as a formula in a fragment of Probabilistic Computational Tree Logic (PCTL) over a set of environmental properties is maximized. Under some mild assumptions, we construct a finite approximation for the motion of the vehicle in the form of a tree-structured Markov Decision Process (MDP). We introduce an efficient algorithm, which exploits the tree structure of the MDP, for synthesizing a control policy that maximizes the probability of satisfaction"},"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":"1307.3224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-11T19:31:36Z","cross_cats_sorted":[],"title_canon_sha256":"f367bed2d1785ff27e47e4d1ca847f48c009dec81d1458bba78268edec4861ea","abstract_canon_sha256":"6768ac40682d0a92a8fe808c04775f8164992cb54831dc7d018adbaa23a0b17e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:40.786432Z","signature_b64":"IehvCqchlVwwZEbu/18s9B0xgMtu8mJ4W4M7Q1SXOuvsNsMQnphh28agRB1gpeJRB6C3LqjIT9oHWgUf04ehBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","last_reissued_at":"2026-05-18T03:18:40.785643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:40.785643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Negotiating the Probabilistic Satisfaction of Temporal Logic Motion Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Igor Cizelj","submitted_at":"2013-07-11T19:31:36Z","abstract_excerpt":"We propose a human-supervised control synthesis method for a stochastic Dubins vehicle such that the probability of satisfying a specification given as a formula in a fragment of Probabilistic Computational Tree Logic (PCTL) over a set of environmental properties is maximized. Under some mild assumptions, we construct a finite approximation for the motion of the vehicle in the form of a tree-structured Markov Decision Process (MDP). We introduce an efficient algorithm, which exploits the tree structure of the MDP, for synthesizing a control policy that maximizes the probability of satisfaction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3224","kind":"arxiv","version":1},"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":"1307.3224","created_at":"2026-05-18T03:18:40.785793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.3224v1","created_at":"2026-05-18T03:18:40.785793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3224","created_at":"2026-05-18T03:18:40.785793+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUBGAICPJKKP","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUBGAICPJKKPAGUC","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUBGAICP","created_at":"2026-05-18T12:27:40.988391+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/CUBGAICPJKKPAGUCBTJFIZDIFS","json":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS.json","graph_json":"https://pith.science/api/pith-number/CUBGAICPJKKPAGUCBTJFIZDIFS/graph.json","events_json":"https://pith.science/api/pith-number/CUBGAICPJKKPAGUCBTJFIZDIFS/events.json","paper":"https://pith.science/paper/CUBGAICP"},"agent_actions":{"view_html":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS","download_json":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS.json","view_paper":"https://pith.science/paper/CUBGAICP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.3224&json=true","fetch_graph":"https://pith.science/api/pith-number/CUBGAICPJKKPAGUCBTJFIZDIFS/graph.json","fetch_events":"https://pith.science/api/pith-number/CUBGAICPJKKPAGUCBTJFIZDIFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/action/storage_attestation","attest_author":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/action/author_attestation","sign_citation":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/action/citation_signature","submit_replication":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/action/replication_record"}},"created_at":"2026-05-18T03:18:40.785793+00:00","updated_at":"2026-05-18T03:18:40.785793+00:00"}