{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RPCF2V6MCD26IDDFLNMEQINB2T","short_pith_number":"pith:RPCF2V6M","schema_version":"1.0","canonical_sha256":"8bc45d57cc10f5e40c655b584821a1d4f5f13a963272d7b2a3e4834cd88ae67f","source":{"kind":"arxiv","id":"1707.04151","version":1},"attestation_state":"computed","paper":{"title":"The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.RO"],"primary_cat":"cs.LO","authors_text":"Ashutosh Trivedi, Aviral Kumar, Behrouz Touri, Fabio Somenzi, Shankara Narayanan Krishna","submitted_at":"2017-07-12T10:06:36Z","abstract_excerpt":"A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. Alur, Wojtczak, and Trivedi have shown that reachability problems for constant-rate multi-mode systems for open and convex safety sets can be solved in polynomial time. In this paper, we study the reachability problem for non-convex state spaces and show that this problem is in general undecidable. We recover decidability by making certain assumptions about the safety set. We pres"},"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":"1707.04151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-12T10:06:36Z","cross_cats_sorted":["cs.FL","cs.RO"],"title_canon_sha256":"be6ea45baab95ecff400435fc1ea362b2a13e3a3252f82e390ffb593f1b6c2aa","abstract_canon_sha256":"6d48dc76b3e26b3c8782b42b6b7e4671290f7d0bffc23b5b45ecd28ac26904c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:20.418923Z","signature_b64":"Mh0SYnFeGbxhSA8huVzqwMLq6a9A4WfKchgaUbbkihU7bWlQPHLNkuchqdcssxSJ+A763XcojaBV1JowYttVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc45d57cc10f5e40c655b584821a1d4f5f13a963272d7b2a3e4834cd88ae67f","last_reissued_at":"2026-05-18T00:40:20.418276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:20.418276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Reach-Avoid Problem for Constant-Rate Multi-Mode Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.RO"],"primary_cat":"cs.LO","authors_text":"Ashutosh Trivedi, Aviral Kumar, Behrouz Touri, Fabio Somenzi, Shankara Narayanan Krishna","submitted_at":"2017-07-12T10:06:36Z","abstract_excerpt":"A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. Alur, Wojtczak, and Trivedi have shown that reachability problems for constant-rate multi-mode systems for open and convex safety sets can be solved in polynomial time. In this paper, we study the reachability problem for non-convex state spaces and show that this problem is in general undecidable. We recover decidability by making certain assumptions about the safety set. We pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04151","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":""},"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":"1707.04151","created_at":"2026-05-18T00:40:20.418366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04151v1","created_at":"2026-05-18T00:40:20.418366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04151","created_at":"2026-05-18T00:40:20.418366+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPCF2V6MCD26","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPCF2V6MCD26IDDF","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPCF2V6M","created_at":"2026-05-18T12:31:39.905425+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/RPCF2V6MCD26IDDFLNMEQINB2T","json":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T.json","graph_json":"https://pith.science/api/pith-number/RPCF2V6MCD26IDDFLNMEQINB2T/graph.json","events_json":"https://pith.science/api/pith-number/RPCF2V6MCD26IDDFLNMEQINB2T/events.json","paper":"https://pith.science/paper/RPCF2V6M"},"agent_actions":{"view_html":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T","download_json":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T.json","view_paper":"https://pith.science/paper/RPCF2V6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04151&json=true","fetch_graph":"https://pith.science/api/pith-number/RPCF2V6MCD26IDDFLNMEQINB2T/graph.json","fetch_events":"https://pith.science/api/pith-number/RPCF2V6MCD26IDDFLNMEQINB2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T/action/storage_attestation","attest_author":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T/action/author_attestation","sign_citation":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T/action/citation_signature","submit_replication":"https://pith.science/pith/RPCF2V6MCD26IDDFLNMEQINB2T/action/replication_record"}},"created_at":"2026-05-18T00:40:20.418366+00:00","updated_at":"2026-05-18T00:40:20.418366+00:00"}