{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YLIE44NB6BXM5EQT5V67TPLIDP","short_pith_number":"pith:YLIE44NB","canonical_record":{"source":{"id":"1806.11007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-28T14:32:30Z","cross_cats_sorted":[],"title_canon_sha256":"3596db47036e11569e3b4b9b8ee9560a0527584c096a6d2b3dd87b92f6931fe4","abstract_canon_sha256":"8eb92de5ffaf234d986b2aa22aa0fced682fff7f66d52c143c4dac985b89f79e"},"schema_version":"1.0"},"canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","source":{"kind":"arxiv","id":"1806.11007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11007","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11007v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11007","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"YLIE44NB6BXM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YLIE44NB6BXM5EQT","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YLIE44NB","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YLIE44NB6BXM5EQT5V67TPLIDP","target":"record","payload":{"canonical_record":{"source":{"id":"1806.11007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-28T14:32:30Z","cross_cats_sorted":[],"title_canon_sha256":"3596db47036e11569e3b4b9b8ee9560a0527584c096a6d2b3dd87b92f6931fe4","abstract_canon_sha256":"8eb92de5ffaf234d986b2aa22aa0fced682fff7f66d52c143c4dac985b89f79e"},"schema_version":"1.0"},"canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.281586Z","signature_b64":"zuXO9NHWddh+GQldBLIU8DY5RbbJdgAr2SPOEqoAINoeY0G7EzSSeoFqQWkZ5W0ZA5xvGKSP/NnQGqsG31TLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","last_reissued_at":"2026-05-18T00:12:07.280989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.280989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.11007","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dRbYeHCqfF2HmGfKdGRksXTlNAIoOoZtzXMAEyUow+jUzR2zB2j0i88oTUreojky5cMPSSd/2xn1L9hcjMhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:01:14.394935Z"},"content_sha256":"17a1c5cefffa3d086486e1da8b237245c4ba424cbb34608b6dc6190082af4500","schema_version":"1.0","event_id":"sha256:17a1c5cefffa3d086486e1da8b237245c4ba424cbb34608b6dc6190082af4500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YLIE44NB6BXM5EQT5V67TPLIDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability in timed automata with diagonal constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"B Srivathsan, Paul Gastin, Sayan Mukherjee","submitted_at":"2018-06-28T14:32:30Z","abstract_excerpt":"We consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enumerating reachable sets of its configurations, stored in the form of a data structure called \"zones\". Simulation relations between zones are essential to ensure termination and efficiency. The algorithm employs a simulation test \"is-Z-simulated-by-Z' ?\" which ascertains that zone Z does not reach more states than zone Z', and hence further enumeration from Z is not necessary. No effective simulations are known for ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11007","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqHxJZZmoWao2NgGHwoTcW/5kszY/THdH9GkLDD+c7Whi41NMYiIGeNBbvl4oFhcdTAfQHZJgrkN+/h2YiJLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T21:01:14.395273Z"},"content_sha256":"49820cb7469cdd5e92acbe531d7a4eb51a9cfbdbbe3c20dc007fe9792a8252cf","schema_version":"1.0","event_id":"sha256:49820cb7469cdd5e92acbe531d7a4eb51a9cfbdbbe3c20dc007fe9792a8252cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/bundle.json","state_url":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLIE44NB6BXM5EQT5V67TPLIDP/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-07-02T21:01:14Z","links":{"resolver":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP","bundle":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/bundle.json","state":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLIE44NB6BXM5EQT5V67TPLIDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YLIE44NB6BXM5EQT5V67TPLIDP","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":"8eb92de5ffaf234d986b2aa22aa0fced682fff7f66d52c143c4dac985b89f79e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-28T14:32:30Z","title_canon_sha256":"3596db47036e11569e3b4b9b8ee9560a0527584c096a6d2b3dd87b92f6931fe4"},"schema_version":"1.0","source":{"id":"1806.11007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11007","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11007v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11007","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"YLIE44NB6BXM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YLIE44NB6BXM5EQT","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YLIE44NB","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:49820cb7469cdd5e92acbe531d7a4eb51a9cfbdbbe3c20dc007fe9792a8252cf","target":"graph","created_at":"2026-05-18T00:12: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 consider the reachability problem for timed automata having diagonal constraints (like x - y < 5) as guards in transitions. The best algorithms for timed automata proceed by enumerating reachable sets of its configurations, stored in the form of a data structure called \"zones\". Simulation relations between zones are essential to ensure termination and efficiency. The algorithm employs a simulation test \"is-Z-simulated-by-Z' ?\" which ascertains that zone Z does not reach more states than zone Z', and hence further enumeration from Z is not necessary. No effective simulations are known for ti","authors_text":"B Srivathsan, Paul Gastin, Sayan Mukherjee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-28T14:32:30Z","title":"Reachability in timed automata with diagonal constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11007","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:17a1c5cefffa3d086486e1da8b237245c4ba424cbb34608b6dc6190082af4500","target":"record","created_at":"2026-05-18T00:12: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":"8eb92de5ffaf234d986b2aa22aa0fced682fff7f66d52c143c4dac985b89f79e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-06-28T14:32:30Z","title_canon_sha256":"3596db47036e11569e3b4b9b8ee9560a0527584c096a6d2b3dd87b92f6931fe4"},"schema_version":"1.0","source":{"id":"1806.11007","kind":"arxiv","version":1}},"canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","first_computed_at":"2026-05-18T00:12:07.280989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.280989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zuXO9NHWddh+GQldBLIU8DY5RbbJdgAr2SPOEqoAINoeY0G7EzSSeoFqQWkZ5W0ZA5xvGKSP/NnQGqsG31TLDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.281586Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17a1c5cefffa3d086486e1da8b237245c4ba424cbb34608b6dc6190082af4500","sha256:49820cb7469cdd5e92acbe531d7a4eb51a9cfbdbbe3c20dc007fe9792a8252cf"],"state_sha256":"41a18d0499ac5e09cc4f65d740471ab03c3f254803c50216267d4fd1f7e77ada"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqDJQQ3MfMrQG8kfsu8/g8ibvnS2o7Wd/dmgaokISKSOKacyL1FBvGDo3DYU4TEvoYdeihsxiYGM64GIUsb3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T21:01:14.397173Z","bundle_sha256":"e6918691f31083767df9a9506a5a95a80d5b761b35221bd01b4be02a45740885"}}