{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GI65SXF7KZJZGYCPFOGFB7WMT5","short_pith_number":"pith:GI65SXF7","canonical_record":{"source":{"id":"1702.03450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-11T19:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"4c4d966972b5e88cf44d26f3a085f30b5ae877dde6623b4d9c86addc12c798a7","abstract_canon_sha256":"c6640a1ac5eb1e76bf367775bf6343f2755480a17ca1dc6b384e90c343df0531"},"schema_version":"1.0"},"canonical_sha256":"323dd95cbf565393604f2b8c50fecc9f5ad9ea11b183fc29305704d5f15fec0b","source":{"kind":"arxiv","id":"1702.03450","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03450","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03450v2","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03450","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"GI65SXF7KZJZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GI65SXF7KZJZGYCP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GI65SXF7","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GI65SXF7KZJZGYCPFOGFB7WMT5","target":"record","payload":{"canonical_record":{"source":{"id":"1702.03450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-11T19:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"4c4d966972b5e88cf44d26f3a085f30b5ae877dde6623b4d9c86addc12c798a7","abstract_canon_sha256":"c6640a1ac5eb1e76bf367775bf6343f2755480a17ca1dc6b384e90c343df0531"},"schema_version":"1.0"},"canonical_sha256":"323dd95cbf565393604f2b8c50fecc9f5ad9ea11b183fc29305704d5f15fec0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:07.598454Z","signature_b64":"V4iZAfFHjlswoyPtcq1pIVi2gayJFkjqXJKOIMwHTPq8H347uCoa9GMwrLkzCfAaAuYJdu1zRBoE2ofaw8hYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323dd95cbf565393604f2b8c50fecc9f5ad9ea11b183fc29305704d5f15fec0b","last_reissued_at":"2026-05-18T00:46:07.598035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:07.598035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.03450","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-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DjEzDI33VHyuLD/WdOQUsyoGY+NHBynrSVwp8IU7d6YOhc8Fd3bG4X5yXkINfeFE/FBzZNWwUKWMSarZRhrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:10:39.206198Z"},"content_sha256":"0565010c4354e0a73ab1c0b535e70a76ce05570073e690340d5cbba5dc8d3779","schema_version":"1.0","event_id":"sha256:0565010c4354e0a73ab1c0b535e70a76ce05570073e690340d5cbba5dc8d3779"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GI65SXF7KZJZGYCPFOGFB7WMT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting Reachability in Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"James Worrell, Karin Quaas, Mahsa Shirmohammadi","submitted_at":"2017-02-11T19:58:06Z","abstract_excerpt":"We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a new and simpler proof of this result, building on the well-known reachability analysis of timed automata involving difference bound matrices. Using this new proof, we give an exponential-space procedure for model checking the reachability fragment of the logic parametric TCTL. Finally we show that the latter problem is NEXPTIME-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03450","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-18T00:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2OBiqOxH8oBhdgFXvxYLcXMCa0FTyzAuPTHMzcYjs3k4DhWyxmLVWJQR0j0IRKkLvuEyYMlRNTV0w8j6yPqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:10:39.206824Z"},"content_sha256":"d660eef57c69441cddc5c65dfc8bb6b3a77d6e89169bf24900bb94eef4ef1a0a","schema_version":"1.0","event_id":"sha256:d660eef57c69441cddc5c65dfc8bb6b3a77d6e89169bf24900bb94eef4ef1a0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/bundle.json","state_url":"https://pith.science/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/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-24T04:10:39Z","links":{"resolver":"https://pith.science/pith/GI65SXF7KZJZGYCPFOGFB7WMT5","bundle":"https://pith.science/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/bundle.json","state":"https://pith.science/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI65SXF7KZJZGYCPFOGFB7WMT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GI65SXF7KZJZGYCPFOGFB7WMT5","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":"c6640a1ac5eb1e76bf367775bf6343f2755480a17ca1dc6b384e90c343df0531","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-11T19:58:06Z","title_canon_sha256":"4c4d966972b5e88cf44d26f3a085f30b5ae877dde6623b4d9c86addc12c798a7"},"schema_version":"1.0","source":{"id":"1702.03450","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.03450","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1702.03450v2","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03450","created_at":"2026-05-18T00:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"GI65SXF7KZJZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GI65SXF7KZJZGYCP","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GI65SXF7","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d660eef57c69441cddc5c65dfc8bb6b3a77d6e89169bf24900bb94eef4ef1a0a","target":"graph","created_at":"2026-05-18T00:46:07Z","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":"We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a new and simpler proof of this result, building on the well-known reachability analysis of timed automata involving difference bound matrices. Using this new proof, we give an exponential-space procedure for model checking the reachability fragment of the logic parametric TCTL. Finally we show that the latter problem is NEXPTIME-hard.","authors_text":"James Worrell, Karin Quaas, Mahsa Shirmohammadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-11T19:58:06Z","title":"Revisiting Reachability in Timed Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03450","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:0565010c4354e0a73ab1c0b535e70a76ce05570073e690340d5cbba5dc8d3779","target":"record","created_at":"2026-05-18T00:46:07Z","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":"c6640a1ac5eb1e76bf367775bf6343f2755480a17ca1dc6b384e90c343df0531","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-02-11T19:58:06Z","title_canon_sha256":"4c4d966972b5e88cf44d26f3a085f30b5ae877dde6623b4d9c86addc12c798a7"},"schema_version":"1.0","source":{"id":"1702.03450","kind":"arxiv","version":2}},"canonical_sha256":"323dd95cbf565393604f2b8c50fecc9f5ad9ea11b183fc29305704d5f15fec0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"323dd95cbf565393604f2b8c50fecc9f5ad9ea11b183fc29305704d5f15fec0b","first_computed_at":"2026-05-18T00:46:07.598035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:07.598035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4iZAfFHjlswoyPtcq1pIVi2gayJFkjqXJKOIMwHTPq8H347uCoa9GMwrLkzCfAaAuYJdu1zRBoE2ofaw8hYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:07.598454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.03450","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0565010c4354e0a73ab1c0b535e70a76ce05570073e690340d5cbba5dc8d3779","sha256:d660eef57c69441cddc5c65dfc8bb6b3a77d6e89169bf24900bb94eef4ef1a0a"],"state_sha256":"dad2ccea82dfd1dbc578622413f5164610d9a0d2d66d50654cf43ae775948de2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEMjjsV0Z0IlwrBgPBgHN+PMxGRacK/yQ1du4qvLe0PernM/zKSNK3Sn9hBfeZ5uXDB/ZnuuI6uSTJfvnqwzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:10:39.209961Z","bundle_sha256":"635d1380f203649e815c240b5f43634fe30459f836f3dfcaa88b31ede2aac5ef"}}