{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YLIE44NB6BXM5EQT5V67TPLIDP","short_pith_number":"pith:YLIE44NB","schema_version":"1.0","canonical_sha256":"c2d04e71a1f06ece9213ed7df9bd681be7ab116fd626c00c13e8d02c8f05135c","source":{"kind":"arxiv","id":"1806.11007","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.11007","created_at":"2026-05-18T00:12:07.281070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11007v1","created_at":"2026-05-18T00:12:07.281070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11007","created_at":"2026-05-18T00:12:07.281070+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLIE44NB6BXM","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLIE44NB6BXM5EQT","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLIE44NB","created_at":"2026-05-18T12:33:04.347982+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/YLIE44NB6BXM5EQT5V67TPLIDP","json":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP.json","graph_json":"https://pith.science/api/pith-number/YLIE44NB6BXM5EQT5V67TPLIDP/graph.json","events_json":"https://pith.science/api/pith-number/YLIE44NB6BXM5EQT5V67TPLIDP/events.json","paper":"https://pith.science/paper/YLIE44NB"},"agent_actions":{"view_html":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP","download_json":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP.json","view_paper":"https://pith.science/paper/YLIE44NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11007&json=true","fetch_graph":"https://pith.science/api/pith-number/YLIE44NB6BXM5EQT5V67TPLIDP/graph.json","fetch_events":"https://pith.science/api/pith-number/YLIE44NB6BXM5EQT5V67TPLIDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/action/storage_attestation","attest_author":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/action/author_attestation","sign_citation":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/action/citation_signature","submit_replication":"https://pith.science/pith/YLIE44NB6BXM5EQT5V67TPLIDP/action/replication_record"}},"created_at":"2026-05-18T00:12:07.281070+00:00","updated_at":"2026-05-18T00:12:07.281070+00:00"}