{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:D7UPKUUIKGLINTUB2J3FSUSQ6N","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":"805b5a89324c0f781faa2ff7ce58d20ed781f1546b3f4c8100eb3150a7d2c56a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-06-07T06:24:58Z","title_canon_sha256":"2357c991b9f873d446dd0380c212dc75d595d0af7ef4fe090cd9db68e251dcb1"},"schema_version":"1.0","source":{"id":"2506.06679","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06679","created_at":"2026-07-05T11:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06679v1","created_at":"2026-07-05T11:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06679","created_at":"2026-07-05T11:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"D7UPKUUIKGLI","created_at":"2026-07-05T11:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"D7UPKUUIKGLINTUB","created_at":"2026-07-05T11:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"D7UPKUUI","created_at":"2026-07-05T11:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:19a4e8d7b6cb68110d05d80b04056b0c8f849fba372b48964c32722b224d4638","target":"graph","created_at":"2026-07-05T11:17:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.06679/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the computation of controlled reach-avoid sets (CRASs) for discrete-time polynomial systems subject to control inputs. A CRAS is a set encompassing initial states from which there exist control inputs driving the system into a target set while avoiding unsafe sets. However, efficiently computing CRASs remains an open problem, especially for discrete-time systems. In this paper, we propose a novel framework for computing CRASs which takes advantage of a probabilistic perspective. This framework transforms the fundamentally nonlinear problem of computing CRASs into a computa","authors_text":"Arvind Easwaran, Bai Xue, Dejin Ren, Martin Fr\\\"anzle, Taoran Wu, Yiling Xue","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-06-07T06:24:58Z","title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06679","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:8b993b4d3668ac63b232f23fedd78a2283efb6f6bba520f3f1fcfc2b0b54f9d3","target":"record","created_at":"2026-07-05T11:17:53Z","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":"805b5a89324c0f781faa2ff7ce58d20ed781f1546b3f4c8100eb3150a7d2c56a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-06-07T06:24:58Z","title_canon_sha256":"2357c991b9f873d446dd0380c212dc75d595d0af7ef4fe090cd9db68e251dcb1"},"schema_version":"1.0","source":{"id":"2506.06679","kind":"arxiv","version":1}},"canonical_sha256":"1fe8f55288519686ce81d276595250f37c1a4652b053f207291af57c59eead3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1fe8f55288519686ce81d276595250f37c1a4652b053f207291af57c59eead3f","first_computed_at":"2026-07-05T11:17:53.909300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:53.909300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C6oGcsWZOezMk4KgeFoOXtYefZA353SfCHEAWC3CaKZT3mvvF1kEnk+7jb7f+m8aeAsqIrTIZJepc9k7MzZ5Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:53.909782Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06679","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b993b4d3668ac63b232f23fedd78a2283efb6f6bba520f3f1fcfc2b0b54f9d3","sha256:19a4e8d7b6cb68110d05d80b04056b0c8f849fba372b48964c32722b224d4638"],"state_sha256":"c0698f4d3a6ff440c004cf9e2ef83db6e7f866a8818a0a340ef59e2e33f47e39"}