{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3MJHCB4CUH64ZUZSQKRNSXYDT5","short_pith_number":"pith:3MJHCB4C","schema_version":"1.0","canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","source":{"kind":"arxiv","id":"1202.4375","version":3},"attestation_state":"computed","paper":{"title":"The Stochastic Reach-Avoid Problem and Set Characterization for Diffusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Debasish Chatterjee, John Lygeros, Peyman Mohajerin Esfahani","submitted_at":"2012-02-20T16:46:09Z","abstract_excerpt":"In this article we approach a class of stochastic reachability problems with state constraints from an optimal control perspective. Preceding approaches to solving these reachability problems are either confined to the deterministic setting or address almost-sure stochastic requirements. In contrast, we propose a methodology to tackle problems with less stringent requirements than almost sure. To this end, we first establish a connection between two distinct stochastic reach-avoid problems and three classes of stochastic optimal control problems involving discontinuous payoff functions. Subseq"},"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":"1202.4375","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-20T16:46:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"b61ef9e7d5eed6d6136452f8f12ca0305f1ab67a0764cb7272632adbd2110637","abstract_canon_sha256":"ec59e059a55f6d30f13bc5211a8cb2569741c0b0a285c4cff8f6bb24c450b955"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.617724Z","signature_b64":"sOhKE/2iyXbULooFLJU29NnlKmSZDbLK44M7IgxaeELuoiu7cegkXpTghhVc0PsM1PKRqWFhSj9b0COxLEdIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","last_reissued_at":"2026-05-18T00:29:49.617089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.617089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Stochastic Reach-Avoid Problem and Set Characterization for Diffusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Debasish Chatterjee, John Lygeros, Peyman Mohajerin Esfahani","submitted_at":"2012-02-20T16:46:09Z","abstract_excerpt":"In this article we approach a class of stochastic reachability problems with state constraints from an optimal control perspective. Preceding approaches to solving these reachability problems are either confined to the deterministic setting or address almost-sure stochastic requirements. In contrast, we propose a methodology to tackle problems with less stringent requirements than almost sure. To this end, we first establish a connection between two distinct stochastic reach-avoid problems and three classes of stochastic optimal control problems involving discontinuous payoff functions. Subseq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4375","kind":"arxiv","version":3},"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":"1202.4375","created_at":"2026-05-18T00:29:49.617188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4375v3","created_at":"2026-05-18T00:29:49.617188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4375","created_at":"2026-05-18T00:29:49.617188+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MJHCB4CUH64","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MJHCB4CUH64ZUZS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MJHCB4C","created_at":"2026-05-18T12:26:50.516681+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/3MJHCB4CUH64ZUZSQKRNSXYDT5","json":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5.json","graph_json":"https://pith.science/api/pith-number/3MJHCB4CUH64ZUZSQKRNSXYDT5/graph.json","events_json":"https://pith.science/api/pith-number/3MJHCB4CUH64ZUZSQKRNSXYDT5/events.json","paper":"https://pith.science/paper/3MJHCB4C"},"agent_actions":{"view_html":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5","download_json":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5.json","view_paper":"https://pith.science/paper/3MJHCB4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4375&json=true","fetch_graph":"https://pith.science/api/pith-number/3MJHCB4CUH64ZUZSQKRNSXYDT5/graph.json","fetch_events":"https://pith.science/api/pith-number/3MJHCB4CUH64ZUZSQKRNSXYDT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/action/storage_attestation","attest_author":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/action/author_attestation","sign_citation":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/action/citation_signature","submit_replication":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/action/replication_record"}},"created_at":"2026-05-18T00:29:49.617188+00:00","updated_at":"2026-05-18T00:29:49.617188+00:00"}