{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XC2W2SJM3SXLDDLCBLF3AR5JOI","short_pith_number":"pith:XC2W2SJM","canonical_record":{"source":{"id":"1303.3533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"cd332b77667432ec42721d9e79f6d70f0b27f860385cdb6538a66bce83f0b103","abstract_canon_sha256":"97c83f72d3a5857eb31553e3f57a3bc25b574da2287100ed9c6e0a003c3ae620"},"schema_version":"1.0"},"canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","source":{"kind":"arxiv","id":"1303.3533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3533","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3533v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3533","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"XC2W2SJM3SXL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XC2W2SJM3SXLDDLC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XC2W2SJM","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XC2W2SJM3SXLDDLCBLF3AR5JOI","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"cd332b77667432ec42721d9e79f6d70f0b27f860385cdb6538a66bce83f0b103","abstract_canon_sha256":"97c83f72d3a5857eb31553e3f57a3bc25b574da2287100ed9c6e0a003c3ae620"},"schema_version":"1.0"},"canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.326607Z","signature_b64":"qIfTVBdWM7WgA7BC9VfHuEO/dRLYmXFuNIori66sJm6nrSsEFKLGdT6hNQ7b4Jy+zWK6l8hafeE4OoDO9BaTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","last_reissued_at":"2026-05-18T03:30:54.325776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.325776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3533","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:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYQy4KuuvE/Z/EIBkqFzODTXN+HLluNAUd/ELBJh0fv5ELRXM6m3Doy8tMdLDfiKdTwF7zPD7A2m0HYRNUeODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:33.858451Z"},"content_sha256":"31218d2956d10779297e75a4d45c37c52db84c61db7b3cc39d79cadcf952b15a","schema_version":"1.0","event_id":"sha256:31218d2956d10779297e75a4d45c37c52db84c61db7b3cc39d79cadcf952b15a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XC2W2SJM3SXLDDLCBLF3AR5JOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Ivana \\v{C}ern\\'a, M\\'aria Svore\\v{n}ov\\'a","submitted_at":"2013-03-14T17:57:13Z","abstract_excerpt":"In this paper, we develop a provably correct optimal control strategy for a finite deterministic transition system. By assuming that penalties with known probabilities of occurrence and dynamics can be sensed locally at the states of the system, we derive a receding horizon strategy that minimizes the expected average cumulative penalty incurred between two consecutive satisfactions of a desired property. At the same time, we guarantee the satisfaction of correctness specifications expressed as Linear Temporal Logic formulas. We illustrate the approach with a persistent surveillance robotics a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3533","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:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvV++kzMFCLQoBIYVWr5SRAOhYQP9Fz0VwnYa7de6YX4KfXS+KaJiw8Kd2reBUvxtiRZhPGagq08KDQ7cUilAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:33.858898Z"},"content_sha256":"0a3c4c1d5561d92239a2545ec554a3b0ec36600eaa70efd980559ff06c01977d","schema_version":"1.0","event_id":"sha256:0a3c4c1d5561d92239a2545ec554a3b0ec36600eaa70efd980559ff06c01977d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/bundle.json","state_url":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/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-05-31T02:49:33Z","links":{"resolver":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI","bundle":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/bundle.json","state":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XC2W2SJM3SXLDDLCBLF3AR5JOI","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":"97c83f72d3a5857eb31553e3f57a3bc25b574da2287100ed9c6e0a003c3ae620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","title_canon_sha256":"cd332b77667432ec42721d9e79f6d70f0b27f860385cdb6538a66bce83f0b103"},"schema_version":"1.0","source":{"id":"1303.3533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3533","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3533v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3533","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"XC2W2SJM3SXL","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XC2W2SJM3SXLDDLC","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XC2W2SJM","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:0a3c4c1d5561d92239a2545ec554a3b0ec36600eaa70efd980559ff06c01977d","target":"graph","created_at":"2026-05-18T03:30:54Z","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 develop a provably correct optimal control strategy for a finite deterministic transition system. By assuming that penalties with known probabilities of occurrence and dynamics can be sensed locally at the states of the system, we derive a receding horizon strategy that minimizes the expected average cumulative penalty incurred between two consecutive satisfactions of a desired property. At the same time, we guarantee the satisfaction of correctness specifications expressed as Linear Temporal Logic formulas. We illustrate the approach with a persistent surveillance robotics a","authors_text":"Calin Belta, Ivana \\v{C}ern\\'a, M\\'aria Svore\\v{n}ov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","title":"Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3533","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:31218d2956d10779297e75a4d45c37c52db84c61db7b3cc39d79cadcf952b15a","target":"record","created_at":"2026-05-18T03:30:54Z","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":"97c83f72d3a5857eb31553e3f57a3bc25b574da2287100ed9c6e0a003c3ae620","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","title_canon_sha256":"cd332b77667432ec42721d9e79f6d70f0b27f860385cdb6538a66bce83f0b103"},"schema_version":"1.0","source":{"id":"1303.3533","kind":"arxiv","version":1}},"canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","first_computed_at":"2026-05-18T03:30:54.325776Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:54.325776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qIfTVBdWM7WgA7BC9VfHuEO/dRLYmXFuNIori66sJm6nrSsEFKLGdT6hNQ7b4Jy+zWK6l8hafeE4OoDO9BaTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:54.326607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31218d2956d10779297e75a4d45c37c52db84c61db7b3cc39d79cadcf952b15a","sha256:0a3c4c1d5561d92239a2545ec554a3b0ec36600eaa70efd980559ff06c01977d"],"state_sha256":"ab4cf3d1fbb5b45b692b49b3f1ea3442f6ea8037842a905e3804543938b155b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OUp4xUYqbmCy3iIFeMGXdwTKe7jyLoikx/U7dTp00Ox5oUQhNzb8uWsqLSOziqj1XAAhOMz2QhGgz1BldS7cBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:49:33.861470Z","bundle_sha256":"e7745333dfbfa252abaa77d50c788b6936b205bc22661c562946e76fd8fcf71e"}}