{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3GC2JXLFYYKSYDT6AKBQQ4KRY4","short_pith_number":"pith:3GC2JXLF","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"},"canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","source":{"kind":"arxiv","id":"1211.1276","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1276","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1276v1","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1276","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"3GC2JXLFYYKS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GC2JXLFYYKSYDT6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GC2JXLF","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3GC2JXLFYYKSYDT6AKBQQ4KRY4","target":"record","payload":{"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"},"canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","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"},"source_kind":"arxiv","source_id":"1211.1276","source_version":1,"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-18T03:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZV197qCDXgN5QcAg2TtRoGC+s5g0XkvmXMafmAaKmazP3iAH4kYJw6Ik7WoPZa6OscnvsGllL972nbuKmX9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:35:31.536885Z"},"content_sha256":"a51fd58a7e85b413c34eb5c718cc13793d1214d03983991f639dd36ac9c269f7","schema_version":"1.0","event_id":"sha256:a51fd58a7e85b413c34eb5c718cc13793d1214d03983991f639dd36ac9c269f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3GC2JXLFYYKSYDT6AKBQQ4KRY4","target":"graph","payload":{"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"},"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-18T03:41:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMgHDJ3JJP/pxyKO+DvH2zD4jhvSC3UhW8vFT3gKhjXaW8EKoiHsRtbb/ocHS2iwP4NuSwN96oBQzYALOqpnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:35:31.537344Z"},"content_sha256":"83d7b47836fec152ad7204f637f7cb63ad8aae9ac1737d8d50f58912b9dad04c","schema_version":"1.0","event_id":"sha256:83d7b47836fec152ad7204f637f7cb63ad8aae9ac1737d8d50f58912b9dad04c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/bundle.json","state_url":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/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-27T02:35:31Z","links":{"resolver":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4","bundle":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/bundle.json","state":"https://pith.science/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GC2JXLFYYKSYDT6AKBQQ4KRY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3GC2JXLFYYKSYDT6AKBQQ4KRY4","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":"6637f4102e127a8397834ed9e0a24af7f8900d2c5668bd1595a6113d8aa41979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-06T15:54:54Z","title_canon_sha256":"f16413175c96ebb78dfddabcdcdadea5096bf35366766f1ed2db110e7ee3f260"},"schema_version":"1.0","source":{"id":"1211.1276","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1276","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1276v1","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1276","created_at":"2026-05-18T03:41:21Z"},{"alias_kind":"pith_short_12","alias_value":"3GC2JXLFYYKS","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"3GC2JXLFYYKSYDT6","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"3GC2JXLF","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:83d7b47836fec152ad7204f637f7cb63ad8aae9ac1737d8d50f58912b9dad04c","target":"graph","created_at":"2026-05-18T03:41:21Z","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 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","authors_text":"Gilles Geeraerts, James Worrell, Jean-Fran\\c{c}ois Raskin, Jo\\\"el Ouaknine, Laurent Doyen, Thomas Brihaye","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-06T15:54:54Z","title":"Time-bounded Reachability for Hybrid Automata: Complexity and Fixpoints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1276","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:a51fd58a7e85b413c34eb5c718cc13793d1214d03983991f639dd36ac9c269f7","target":"record","created_at":"2026-05-18T03:41:21Z","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":"6637f4102e127a8397834ed9e0a24af7f8900d2c5668bd1595a6113d8aa41979","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-11-06T15:54:54Z","title_canon_sha256":"f16413175c96ebb78dfddabcdcdadea5096bf35366766f1ed2db110e7ee3f260"},"schema_version":"1.0","source":{"id":"1211.1276","kind":"arxiv","version":1}},"canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d985a4dd65c6152c0e7e0283087151c70555d1487ae4ef46bf6ff1e5c6c253f6","first_computed_at":"2026-05-18T03:41:21.945907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:21.945907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vN+3wdVUC+t6XRU0soEn/C+aeD1bHM+XChfFUo2vO9NJADl4tlMRQ5b21HMORkcLlaWjvG8ND6ymVmCztp2yCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:21.946267Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1276","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a51fd58a7e85b413c34eb5c718cc13793d1214d03983991f639dd36ac9c269f7","sha256:83d7b47836fec152ad7204f637f7cb63ad8aae9ac1737d8d50f58912b9dad04c"],"state_sha256":"e945fd0e53ac0617a4a7d8a6f1f0a2fb4c9d73a62732d37191f95c8d799a853f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yf+5pxMfCFMZuakuhhwfJZbjDXRRTEDj2i7Luc82QS0r7AohjpahD2yhKW7GFGOqzBGhs5iFjCjZVVumU+tCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:35:31.540271Z","bundle_sha256":"916536afe131aa1a1593325029928324bc5464ef458c7ecdbec5796a96a04c8c"}}