{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CUBGAICPJKKPAGUCBTJFIZDIFS","short_pith_number":"pith:CUBGAICP","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"},"canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","source":{"kind":"arxiv","id":"1307.3224","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3224","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3224v1","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3224","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"CUBGAICPJKKP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CUBGAICPJKKPAGUC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CUBGAICP","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CUBGAICPJKKPAGUCBTJFIZDIFS","target":"record","payload":{"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"},"canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","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"},"source_kind":"arxiv","source_id":"1307.3224","source_version":1,"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:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiUElqZNcRWVcAD2yblKdg955v1M45blg95ysuXUn2GX8RHs/0ibGiCzglehlbKyntOyW63u55C20jV/I+uSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:22.531942Z"},"content_sha256":"bee346e6379332a520968be93d5df640f5ec26a599476525ac7cdf936371a35f","schema_version":"1.0","event_id":"sha256:bee346e6379332a520968be93d5df640f5ec26a599476525ac7cdf936371a35f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CUBGAICPJKKPAGUCBTJFIZDIFS","target":"graph","payload":{"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"},"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:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ojt5ojY5UF7eDqlabACfriPccFzvC6QFBGap3je5UdIM4duNDr8uhNS3O/nl6Mjn80ZGS3SU6/20EPZo6eOMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:32:22.532698Z"},"content_sha256":"2edd4fe8441096f0ef30bc12704bab0f75bde3ad789a1925ceb4da4d511cffba","schema_version":"1.0","event_id":"sha256:2edd4fe8441096f0ef30bc12704bab0f75bde3ad789a1925ceb4da4d511cffba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/bundle.json","state_url":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/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-11T07:32:22Z","links":{"resolver":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS","bundle":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/bundle.json","state":"https://pith.science/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CUBGAICPJKKPAGUCBTJFIZDIFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CUBGAICPJKKPAGUCBTJFIZDIFS","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":"6768ac40682d0a92a8fe808c04775f8164992cb54831dc7d018adbaa23a0b17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-11T19:31:36Z","title_canon_sha256":"f367bed2d1785ff27e47e4d1ca847f48c009dec81d1458bba78268edec4861ea"},"schema_version":"1.0","source":{"id":"1307.3224","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3224","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3224v1","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3224","created_at":"2026-05-18T03:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"CUBGAICPJKKP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CUBGAICPJKKPAGUC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CUBGAICP","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:2edd4fe8441096f0ef30bc12704bab0f75bde3ad789a1925ceb4da4d511cffba","target":"graph","created_at":"2026-05-18T03:18:40Z","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":"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","authors_text":"Calin Belta, Igor Cizelj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-11T19:31:36Z","title":"Negotiating the Probabilistic Satisfaction of Temporal Logic Motion Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3224","kind":"arxiv","version":1},"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:bee346e6379332a520968be93d5df640f5ec26a599476525ac7cdf936371a35f","target":"record","created_at":"2026-05-18T03:18:40Z","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":"6768ac40682d0a92a8fe808c04775f8164992cb54831dc7d018adbaa23a0b17e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-07-11T19:31:36Z","title_canon_sha256":"f367bed2d1785ff27e47e4d1ca847f48c009dec81d1458bba78268edec4861ea"},"schema_version":"1.0","source":{"id":"1307.3224","kind":"arxiv","version":1}},"canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"150260204f4a94f01a820cd25464682c99af080168225a804bdc483d055ec156","first_computed_at":"2026-05-18T03:18:40.785643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:40.785643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IehvCqchlVwwZEbu/18s9B0xgMtu8mJ4W4M7Q1SXOuvsNsMQnphh28agRB1gpeJRB6C3LqjIT9oHWgUf04ehBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:40.786432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3224","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee346e6379332a520968be93d5df640f5ec26a599476525ac7cdf936371a35f","sha256:2edd4fe8441096f0ef30bc12704bab0f75bde3ad789a1925ceb4da4d511cffba"],"state_sha256":"60417c09dc5023769f9d166bb6a564254dc54323c4ba12ec04b141f5f4c3d418"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjg4g0TpBrPTjF9Fp9J+lu1r+jnTq0+erJL7GTFv8QIl90FqnGxq3cP9S0uMKaWpOGWk9f2hKDnu2w49n/PODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:32:22.537081Z","bundle_sha256":"3a3162430ca2d64e7a1135466847243aad35cf26b96d68d4d6320e9af1469c50"}}