{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CFHHIISZFFO2FJAWXJP4FBGP2J","short_pith_number":"pith:CFHHIISZ","schema_version":"1.0","canonical_sha256":"114e742259295da2a416ba5fc284cfd2625665a025892069552b9b56b5e11d2f","source":{"kind":"arxiv","id":"1409.0553","version":2},"attestation_state":"computed","paper":{"title":"Sampling-based Approximations with Quantitative Performance for the Probabilistic Reach-Avoid Problem over General Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SY","authors_text":"Alessandro Abate, Robert Babuska, Sofie Haesaert","submitted_at":"2014-09-01T20:03:48Z","abstract_excerpt":"This article deals with stochastic processes endowed with the Markov (memoryless) property and evolving over general (uncountable) state spaces. The models further depend on a non-deterministic quantity in the form of a control input, which can be selected to affect the probabilistic dynamics. We address the computation of maximal reach-avoid specifications, together with the synthesis of the corresponding optimal controllers. The reach-avoid specification deals with assessing the likelihood that any finite-horizon trajectory of the model enters a given goal set, while avoiding a given set of "},"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":"1409.0553","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-09-01T20:03:48Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8f7aad98bfb14a6d506ae1d8ae2e4c90ce5a4aeb28f520131172d7289d278e9d","abstract_canon_sha256":"9bdafdcb4433dcd24bfbfe69c89908a777e81d3b8243a8233a14e159a9519296"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:32.529926Z","signature_b64":"NEavS0/s/NZ9hzWMHA6uXIES5RFoxBuBy/p9cbhksC+mrFGkHrx7rX6RmMVeWbA99XoExEfJrEVvGGqpvfqOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114e742259295da2a416ba5fc284cfd2625665a025892069552b9b56b5e11d2f","last_reissued_at":"2026-05-18T01:33:32.529237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:32.529237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-based Approximations with Quantitative Performance for the Probabilistic Reach-Avoid Problem over General Markov Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SY","authors_text":"Alessandro Abate, Robert Babuska, Sofie Haesaert","submitted_at":"2014-09-01T20:03:48Z","abstract_excerpt":"This article deals with stochastic processes endowed with the Markov (memoryless) property and evolving over general (uncountable) state spaces. The models further depend on a non-deterministic quantity in the form of a control input, which can be selected to affect the probabilistic dynamics. We address the computation of maximal reach-avoid specifications, together with the synthesis of the corresponding optimal controllers. The reach-avoid specification deals with assessing the likelihood that any finite-horizon trajectory of the model enters a given goal set, while avoiding a given set of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0553","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0553","created_at":"2026-05-18T01:33:32.529358+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0553v2","created_at":"2026-05-18T01:33:32.529358+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0553","created_at":"2026-05-18T01:33:32.529358+00:00"},{"alias_kind":"pith_short_12","alias_value":"CFHHIISZFFO2","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CFHHIISZFFO2FJAW","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CFHHIISZ","created_at":"2026-05-18T12:28:22.404517+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/CFHHIISZFFO2FJAWXJP4FBGP2J","json":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J.json","graph_json":"https://pith.science/api/pith-number/CFHHIISZFFO2FJAWXJP4FBGP2J/graph.json","events_json":"https://pith.science/api/pith-number/CFHHIISZFFO2FJAWXJP4FBGP2J/events.json","paper":"https://pith.science/paper/CFHHIISZ"},"agent_actions":{"view_html":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J","download_json":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J.json","view_paper":"https://pith.science/paper/CFHHIISZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0553&json=true","fetch_graph":"https://pith.science/api/pith-number/CFHHIISZFFO2FJAWXJP4FBGP2J/graph.json","fetch_events":"https://pith.science/api/pith-number/CFHHIISZFFO2FJAWXJP4FBGP2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J/action/storage_attestation","attest_author":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J/action/author_attestation","sign_citation":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J/action/citation_signature","submit_replication":"https://pith.science/pith/CFHHIISZFFO2FJAWXJP4FBGP2J/action/replication_record"}},"created_at":"2026-05-18T01:33:32.529358+00:00","updated_at":"2026-05-18T01:33:32.529358+00:00"}