{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GC2JXLFYYKSYDT6AKBQQ4KRY4","short_pith_number":"pith:3GC2JXLF","schema_version":"1.0","canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","source":{"kind":"arxiv","id":"1211.1276","version":1},"attestation_state":"computed","paper":{"title":"Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Gilles Geeraerts, James Worrell, Jean-Fran\\c{c}ois Raskin, Jo\\\"el Ouaknine, Laurent Doyen, Thomas Brihaye","submitted_at":"2012-11-06T15:54:54Z","abstract_excerpt":"In this paper, we study thetime-bounded reachability problem for rectangular hybrid automata with non-negative rates (RHA+). This problem was recently shown to be decidable [Brihaye et al, ICALP11] (even though the unbounded reachability problem for even very simple classes of hybrid automata is well-known to be undecidable). However, [Brihaye et al, ICALP11] does not provide a precise characterisation of the complexity of the time-bounded reachability problem. The contribution of the present paper is threefold. First, we provide a new NExpTime algorithm to solve the timed-bounded reachability"},"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":"1211.1276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-06T15:54:54Z","cross_cats_sorted":[],"title_canon_sha256":"f16413175c96ebb78dfddabcdcdadea5096bf35366766f1ed2db110e7ee3f260","abstract_canon_sha256":"6637f4102e127a8397834ed9e0a24af7f8900d2c5668bd1595a6113d8aa41979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:21.946267Z","signature_b64":"vN+3wdVUC+t6XRU0soEn/C+aeD1bHM+XChfFUo2vO9NJADl4tlMRQ5b21HMORkcLlaWjvG8ND6ymVmCztp2yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","last_reissued_at":"2026-05-18T03:41:21.945907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:21.945907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Gilles Geeraerts, James Worrell, Jean-Fran\\c{c}ois Raskin, Jo\\\"el Ouaknine, Laurent Doyen, Thomas Brihaye","submitted_at":"2012-11-06T15:54:54Z","abstract_excerpt":"In this paper, we study thetime-bounded reachability problem for rectangular hybrid automata with non-negative rates (RHA+). This problem was recently shown to be decidable [Brihaye et al, ICALP11] (even though the unbounded reachability problem for even very simple classes of hybrid automata is well-known to be undecidable). However, [Brihaye et al, ICALP11] does not provide a precise characterisation of the complexity of the time-bounded reachability problem. The contribution of the present paper is threefold. First, we provide a new NExpTime algorithm to solve the timed-bounded reachability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1276","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":"1211.1276","created_at":"2026-05-18T03:41:21.945967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1276v1","created_at":"2026-05-18T03:41:21.945967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1276","created_at":"2026-05-18T03:41:21.945967+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GC2JXLFYYKS","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GC2JXLFYYKSYDT6","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GC2JXLF","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/3GC2JXLFYYKSYDT6AKBQQ4KRY4","json":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4.json","graph_json":"https://pith.science/api/pith-number/3GC2JXLFYYKSYDT6AKBQQ4KRY4/graph.json","events_json":"https://pith.science/api/pith-number/3GC2JXLFYYKSYDT6AKBQQ4KRY4/events.json","paper":"https://pith.science/paper/3GC2JXLF"},"agent_actions":{"view_html":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4","download_json":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4.json","view_paper":"https://pith.science/paper/3GC2JXLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1276&json=true","fetch_graph":"https://pith.science/api/pith-number/3GC2JXLFYYKSYDT6AKBQQ4KRY4/graph.json","fetch_events":"https://pith.science/api/pith-number/3GC2JXLFYYKSYDT6AKBQQ4KRY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/action/storage_attestation","attest_author":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/action/author_attestation","sign_citation":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/action/citation_signature","submit_replication":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/action/replication_record"}},"created_at":"2026-05-18T03:41:21.945967+00:00","updated_at":"2026-05-18T03:41:21.945967+00:00"}