{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3MJHCB4CUH64ZUZSQKRNSXYDT5","short_pith_number":"pith:3MJHCB4C","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"},"canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","source":{"kind":"arxiv","id":"1202.4375","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4375","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4375v3","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4375","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"3MJHCB4CUH64","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3MJHCB4CUH64ZUZS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3MJHCB4C","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3MJHCB4CUH64ZUZSQKRNSXYDT5","target":"record","payload":{"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"},"canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","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"},"source_kind":"arxiv","source_id":"1202.4375","source_version":3,"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-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53JYqsnenGPCwqy5ZadRD1nYGFU332R4sbpPkX8QtpN4he26A78y3wsxS81n8e1eYFzD0+X5bMAQTrPXPhwSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:01:07.154792Z"},"content_sha256":"c0d04753650dac23a8dc45d787544306a3218bd48b06ae6d5ae539e1f06b9aa4","schema_version":"1.0","event_id":"sha256:c0d04753650dac23a8dc45d787544306a3218bd48b06ae6d5ae539e1f06b9aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3MJHCB4CUH64ZUZSQKRNSXYDT5","target":"graph","payload":{"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"},"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-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4Ev/QXG6w+ryEzYF0xH9wNfK95DCC0X3PvzRpK9jPwb/7Zmk91+aA+D+AF6gao2fiDGTONRthS22aWap6+PCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:01:07.155527Z"},"content_sha256":"ab49a99a8ac1e737883583dde7848612d4b95c22bb23544ec9a7a2aed9d6c2f3","schema_version":"1.0","event_id":"sha256:ab49a99a8ac1e737883583dde7848612d4b95c22bb23544ec9a7a2aed9d6c2f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/bundle.json","state_url":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/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-28T22:01:07Z","links":{"resolver":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5","bundle":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/bundle.json","state":"https://pith.science/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MJHCB4CUH64ZUZSQKRNSXYDT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3MJHCB4CUH64ZUZSQKRNSXYDT5","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":"ec59e059a55f6d30f13bc5211a8cb2569741c0b0a285c4cff8f6bb24c450b955","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-20T16:46:09Z","title_canon_sha256":"b61ef9e7d5eed6d6136452f8f12ca0305f1ab67a0764cb7272632adbd2110637"},"schema_version":"1.0","source":{"id":"1202.4375","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4375","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4375v3","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4375","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"3MJHCB4CUH64","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3MJHCB4CUH64ZUZS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3MJHCB4C","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:ab49a99a8ac1e737883583dde7848612d4b95c22bb23544ec9a7a2aed9d6c2f3","target":"graph","created_at":"2026-05-18T00:29:49Z","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 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","authors_text":"Debasish Chatterjee, John Lygeros, Peyman Mohajerin Esfahani","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-20T16:46:09Z","title":"The Stochastic Reach-Avoid Problem and Set Characterization for Diffusions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4375","kind":"arxiv","version":3},"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:c0d04753650dac23a8dc45d787544306a3218bd48b06ae6d5ae539e1f06b9aa4","target":"record","created_at":"2026-05-18T00:29:49Z","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":"ec59e059a55f6d30f13bc5211a8cb2569741c0b0a285c4cff8f6bb24c450b955","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-20T16:46:09Z","title_canon_sha256":"b61ef9e7d5eed6d6136452f8f12ca0305f1ab67a0764cb7272632adbd2110637"},"schema_version":"1.0","source":{"id":"1202.4375","kind":"arxiv","version":3}},"canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db12710782a1fdccd33282a2d95f039f4ec8e1d35246db00de0ca235e2786754","first_computed_at":"2026-05-18T00:29:49.617089Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:49.617089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sOhKE/2iyXbULooFLJU29NnlKmSZDbLK44M7IgxaeELuoiu7cegkXpTghhVc0PsM1PKRqWFhSj9b0COxLEdIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:49.617724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4375","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0d04753650dac23a8dc45d787544306a3218bd48b06ae6d5ae539e1f06b9aa4","sha256:ab49a99a8ac1e737883583dde7848612d4b95c22bb23544ec9a7a2aed9d6c2f3"],"state_sha256":"33a86abbe0218911d796c4bca6c84b78dcd0599d95e6f3e5cbf85501ff29780e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/hkFtlN2aFTvZyoBmwAxjF58nuBq3NzW83A8TgVFt5dAFzCfWd8E/t/zjPhcOA4V7pWnwSha8LkL2zqtyUrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:01:07.159383Z","bundle_sha256":"54fc4ce8ec74350462787950ea4939e388eb2ba96afdc46c6511d6ee6ddc0395"}}