{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D7UPKUUIKGLINTUB2J3FSUSQ6N","short_pith_number":"pith:D7UPKUUI","schema_version":"1.0","canonical_sha256":"1fe8f55288519686ce81d276595250f37c1a4652b053f207291af57c59eead3f","source":{"kind":"arxiv","id":"2506.06679","version":1},"attestation_state":"computed","paper":{"title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Arvind Easwaran, Bai Xue, Dejin Ren, Martin Fr\\\"anzle, Taoran Wu, Yiling Xue","submitted_at":"2025-06-07T06:24:58Z","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"},"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":"2506.06679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-06-07T06:24:58Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"2357c991b9f873d446dd0380c212dc75d595d0af7ef4fe090cd9db68e251dcb1","abstract_canon_sha256":"805b5a89324c0f781faa2ff7ce58d20ed781f1546b3f4c8100eb3150a7d2c56a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:53.909782Z","signature_b64":"C6oGcsWZOezMk4KgeFoOXtYefZA353SfCHEAWC3CaKZT3mvvF1kEnk+7jb7f+m8aeAsqIrTIZJepc9k7MzZ5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fe8f55288519686ce81d276595250f37c1a4652b053f207291af57c59eead3f","last_reissued_at":"2026-07-05T11:17:53.909300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:53.909300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Arvind Easwaran, Bai Xue, Dejin Ren, Martin Fr\\\"anzle, Taoran Wu, Yiling Xue","submitted_at":"2025-06-07T06:24:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06679","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.06679/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.06679","created_at":"2026-07-05T11:17:53.909370+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.06679v1","created_at":"2026-07-05T11:17:53.909370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06679","created_at":"2026-07-05T11:17:53.909370+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7UPKUUIKGLI","created_at":"2026-07-05T11:17:53.909370+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7UPKUUIKGLINTUB","created_at":"2026-07-05T11:17:53.909370+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7UPKUUI","created_at":"2026-07-05T11:17:53.909370+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/D7UPKUUIKGLINTUB2J3FSUSQ6N","json":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N.json","graph_json":"https://pith.science/api/pith-number/D7UPKUUIKGLINTUB2J3FSUSQ6N/graph.json","events_json":"https://pith.science/api/pith-number/D7UPKUUIKGLINTUB2J3FSUSQ6N/events.json","paper":"https://pith.science/paper/D7UPKUUI"},"agent_actions":{"view_html":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N","download_json":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N.json","view_paper":"https://pith.science/paper/D7UPKUUI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.06679&json=true","fetch_graph":"https://pith.science/api/pith-number/D7UPKUUIKGLINTUB2J3FSUSQ6N/graph.json","fetch_events":"https://pith.science/api/pith-number/D7UPKUUIKGLINTUB2J3FSUSQ6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N/action/storage_attestation","attest_author":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N/action/author_attestation","sign_citation":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N/action/citation_signature","submit_replication":"https://pith.science/pith/D7UPKUUIKGLINTUB2J3FSUSQ6N/action/replication_record"}},"created_at":"2026-07-05T11:17:53.909370+00:00","updated_at":"2026-07-05T11:17:53.909370+00:00"}