{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PJZIKQK343DUDZ5NSOMKJSC4DX","short_pith_number":"pith:PJZIKQK3","canonical_record":{"source":{"id":"1406.7289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-28T10:25:57Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"461a25e3924aa51180c43d7efe70f65af22fa3cfb2fc182f3e7cd837ddf97a02","abstract_canon_sha256":"2c85f2e28fa1e3c613239749293ba39a8de8c82f8150cf8aaff267a14ffa729b"},"schema_version":"1.0"},"canonical_sha256":"7a7285415be6c741e7ad9398a4c85c1dc10c014639a07c0312b6e9a4399eb431","source":{"kind":"arxiv","id":"1406.7289","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7289","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7289v2","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7289","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"PJZIKQK343DU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJZIKQK343DUDZ5N","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJZIKQK3","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PJZIKQK343DUDZ5NSOMKJSC4DX","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7289","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-28T10:25:57Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"461a25e3924aa51180c43d7efe70f65af22fa3cfb2fc182f3e7cd837ddf97a02","abstract_canon_sha256":"2c85f2e28fa1e3c613239749293ba39a8de8c82f8150cf8aaff267a14ffa729b"},"schema_version":"1.0"},"canonical_sha256":"7a7285415be6c741e7ad9398a4c85c1dc10c014639a07c0312b6e9a4399eb431","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:12.047625Z","signature_b64":"+egr8suuCcauWQzjwoXARg8IuiROxovbBzxZF6gx4Y+1UWyWFuW6iu0GafSs5Hew0SCKN6JHdqaeh/9dezc0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a7285415be6c741e7ad9398a4c85c1dc10c014639a07c0312b6e9a4399eb431","last_reissued_at":"2026-05-18T02:45:12.047108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:12.047108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7289","source_version":2,"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-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ik51q4P07BgBaqNOtz3kUdIeeVdMZKPrnp4jfwrz7s+CkAT3mtAepM976XN8NkeHR9lfghKkj+z6NMfbWt3HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:41:08.827477Z"},"content_sha256":"1f415f913f516426a42c5c7f24ff4be2ec16b6d4c32c82a212181ffc32a19092","schema_version":"1.0","event_id":"sha256:1f415f913f516426a42c5c7f24ff4be2ec16b6d4c32c82a212181ffc32a19092"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PJZIKQK343DUDZ5NSOMKJSC4DX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Reachability Problem for Recursive Hybrid Automata with One and Two Players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Ashutosh Trivedi, Lakshmi Manasa, Shankara Narayanan Krishna","submitted_at":"2014-06-28T10:25:57Z","abstract_excerpt":"Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. In support of this theory, the list of undecidable problems recently shown decidable under time-bounded restriction is rather impressive: language inclusion for timed automata, emptiness problem for alternating timed automata, and emptiness problem for rectangular hybrid automata. The objective of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7289","kind":"arxiv","version":2},"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-18T02:45:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TgAurBN2bRLAB2uOu+CJGONzHKvORSuBRULLVPzPlwvtYOYk3TSnVJ44kC9JudGESGxlYO68f8N+V43x8335CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:41:08.827831Z"},"content_sha256":"db97bedaf05a1580faab0b36e29aa633bf2eafed96d524f286a7fba5609477c3","schema_version":"1.0","event_id":"sha256:db97bedaf05a1580faab0b36e29aa633bf2eafed96d524f286a7fba5609477c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/bundle.json","state_url":"https://pith.science/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/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-06-02T11:41:08Z","links":{"resolver":"https://pith.science/pith/PJZIKQK343DUDZ5NSOMKJSC4DX","bundle":"https://pith.science/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/bundle.json","state":"https://pith.science/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJZIKQK343DUDZ5NSOMKJSC4DX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PJZIKQK343DUDZ5NSOMKJSC4DX","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":"2c85f2e28fa1e3c613239749293ba39a8de8c82f8150cf8aaff267a14ffa729b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-28T10:25:57Z","title_canon_sha256":"461a25e3924aa51180c43d7efe70f65af22fa3cfb2fc182f3e7cd837ddf97a02"},"schema_version":"1.0","source":{"id":"1406.7289","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7289","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7289v2","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7289","created_at":"2026-05-18T02:45:12Z"},{"alias_kind":"pith_short_12","alias_value":"PJZIKQK343DU","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJZIKQK343DUDZ5N","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJZIKQK3","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:db97bedaf05a1580faab0b36e29aa633bf2eafed96d524f286a7fba5609477c3","target":"graph","created_at":"2026-05-18T02:45:12Z","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":"Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. In support of this theory, the list of undecidable problems recently shown decidable under time-bounded restriction is rather impressive: language inclusion for timed automata, emptiness problem for alternating timed automata, and emptiness problem for rectangular hybrid automata. The objective of ","authors_text":"Ashutosh Trivedi, Lakshmi Manasa, Shankara Narayanan Krishna","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-28T10:25:57Z","title":"On The Reachability Problem for Recursive Hybrid Automata with One and Two Players"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7289","kind":"arxiv","version":2},"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:1f415f913f516426a42c5c7f24ff4be2ec16b6d4c32c82a212181ffc32a19092","target":"record","created_at":"2026-05-18T02:45:12Z","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":"2c85f2e28fa1e3c613239749293ba39a8de8c82f8150cf8aaff267a14ffa729b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-28T10:25:57Z","title_canon_sha256":"461a25e3924aa51180c43d7efe70f65af22fa3cfb2fc182f3e7cd837ddf97a02"},"schema_version":"1.0","source":{"id":"1406.7289","kind":"arxiv","version":2}},"canonical_sha256":"7a7285415be6c741e7ad9398a4c85c1dc10c014639a07c0312b6e9a4399eb431","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a7285415be6c741e7ad9398a4c85c1dc10c014639a07c0312b6e9a4399eb431","first_computed_at":"2026-05-18T02:45:12.047108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:12.047108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+egr8suuCcauWQzjwoXARg8IuiROxovbBzxZF6gx4Y+1UWyWFuW6iu0GafSs5Hew0SCKN6JHdqaeh/9dezc0Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:12.047625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7289","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f415f913f516426a42c5c7f24ff4be2ec16b6d4c32c82a212181ffc32a19092","sha256:db97bedaf05a1580faab0b36e29aa633bf2eafed96d524f286a7fba5609477c3"],"state_sha256":"dbd8971e0bf3c368de6f26cd71a5c1ca2bc0120be56196d26b7f22ab2cf055eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iYplzBOYD6cshdjQ+jXuCJmXUkzF540KI4/kR7U6gce13TcLbGQgXqEaxQuZJXHaaCSYVQS3DXtQUh9qkrTPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:41:08.829821Z","bundle_sha256":"ba44d95a042806369a69af978a52102240a1b0870b46513cbc677fac1bffc6fc"}}