{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:V4PRNFNA66HCTVDBJTB2GVLCOE","short_pith_number":"pith:V4PRNFNA","canonical_record":{"source":{"id":"1904.08590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T04:37:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a7cd88bc10f30051075c67a3bc18f363da348a94efce1f322197984ad75d0ce4","abstract_canon_sha256":"6bdcdfb6745b5de0004312d13dca04f45adb3e9c35666186b5756bc6f3e199f5"},"schema_version":"1.0"},"canonical_sha256":"af1f1695a0f78e29d4614cc3a35562713b443e3058c69a0add1d396c009eb05f","source":{"kind":"arxiv","id":"1904.08590","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08590","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08590v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08590","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"V4PRNFNA66HC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V4PRNFNA66HCTVDB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V4PRNFNA","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:V4PRNFNA66HCTVDBJTB2GVLCOE","target":"record","payload":{"canonical_record":{"source":{"id":"1904.08590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T04:37:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a7cd88bc10f30051075c67a3bc18f363da348a94efce1f322197984ad75d0ce4","abstract_canon_sha256":"6bdcdfb6745b5de0004312d13dca04f45adb3e9c35666186b5756bc6f3e199f5"},"schema_version":"1.0"},"canonical_sha256":"af1f1695a0f78e29d4614cc3a35562713b443e3058c69a0add1d396c009eb05f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:13.806981Z","signature_b64":"HPCpBqgDE2KT511rUdzF4EKa4GZBeuKsyz7YcAhZXXwUYHk1jrXQwHEcEKNjK0qiJxpQnu7YVSMfIHtXbYpvAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af1f1695a0f78e29d4614cc3a35562713b443e3058c69a0add1d396c009eb05f","last_reissued_at":"2026-05-17T23:48:13.806378Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:13.806378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.08590","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-17T23:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPeUkJxKeaQBB6hfMtRVBSb2Lungns5kSCsLJjoh0Q4afY+0TAeol5vzHDfIh+qsY6RiizRp5HiiHJwuRLkpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:54:54.427178Z"},"content_sha256":"73ea305634c3365e939a042c0645ac259cf916b017f07261b00b50230221350b","schema_version":"1.0","event_id":"sha256:73ea305634c3365e939a042c0645ac259cf916b017f07261b00b50230221350b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:V4PRNFNA66HCTVDBJTB2GVLCOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast algorithms for handling diagonal constraints in timed automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"B Srivathsan, Paul Gastin, Sayan Mukherjee","submitted_at":"2019-04-18T04:37:59Z","abstract_excerpt":"A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A na\\\"ive enumeration of zones does not terminate. Various termination mechanisms have been studied over the years. Coming up with efficient termination mechanisms has been remarkably more challenging when the automaton has diagonal constraints in guards.\n  In this paper, we propose a new termination mechanism for timed automata with diagonal constraints based on a new simulation relation between zones. Experiments with an implementation of this simulation show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08590","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-17T23:48:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Athpi0ABX90Iuhj9jDTxKX8OXTQb+vY0Gnt6Tnirr04x4FfUe+23XnvwSqGRakSkiLQaxeT/lQkcGJQPNtoDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T20:54:54.427554Z"},"content_sha256":"6cfa8f8a92af6cef5a2186a65054e87906b48b903ff85395a120cfea990e8a31","schema_version":"1.0","event_id":"sha256:6cfa8f8a92af6cef5a2186a65054e87906b48b903ff85395a120cfea990e8a31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/bundle.json","state_url":"https://pith.science/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/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-02T20:54:54Z","links":{"resolver":"https://pith.science/pith/V4PRNFNA66HCTVDBJTB2GVLCOE","bundle":"https://pith.science/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/bundle.json","state":"https://pith.science/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V4PRNFNA66HCTVDBJTB2GVLCOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:V4PRNFNA66HCTVDBJTB2GVLCOE","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":"6bdcdfb6745b5de0004312d13dca04f45adb3e9c35666186b5756bc6f3e199f5","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T04:37:59Z","title_canon_sha256":"a7cd88bc10f30051075c67a3bc18f363da348a94efce1f322197984ad75d0ce4"},"schema_version":"1.0","source":{"id":"1904.08590","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08590","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08590v1","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08590","created_at":"2026-05-17T23:48:13Z"},{"alias_kind":"pith_short_12","alias_value":"V4PRNFNA66HC","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"V4PRNFNA66HCTVDB","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"V4PRNFNA","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:6cfa8f8a92af6cef5a2186a65054e87906b48b903ff85395a120cfea990e8a31","target":"graph","created_at":"2026-05-17T23:48:13Z","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":"A popular method for solving reachability in timed automata proceeds by enumerating reachable sets of valuations represented as zones. A na\\\"ive enumeration of zones does not terminate. Various termination mechanisms have been studied over the years. Coming up with efficient termination mechanisms has been remarkably more challenging when the automaton has diagonal constraints in guards.\n  In this paper, we propose a new termination mechanism for timed automata with diagonal constraints based on a new simulation relation between zones. Experiments with an implementation of this simulation show","authors_text":"B Srivathsan, Paul Gastin, Sayan Mukherjee","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T04:37:59Z","title":"Fast algorithms for handling diagonal constraints in timed automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08590","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:73ea305634c3365e939a042c0645ac259cf916b017f07261b00b50230221350b","target":"record","created_at":"2026-05-17T23:48:13Z","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":"6bdcdfb6745b5de0004312d13dca04f45adb3e9c35666186b5756bc6f3e199f5","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T04:37:59Z","title_canon_sha256":"a7cd88bc10f30051075c67a3bc18f363da348a94efce1f322197984ad75d0ce4"},"schema_version":"1.0","source":{"id":"1904.08590","kind":"arxiv","version":1}},"canonical_sha256":"af1f1695a0f78e29d4614cc3a35562713b443e3058c69a0add1d396c009eb05f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af1f1695a0f78e29d4614cc3a35562713b443e3058c69a0add1d396c009eb05f","first_computed_at":"2026-05-17T23:48:13.806378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:13.806378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPCpBqgDE2KT511rUdzF4EKa4GZBeuKsyz7YcAhZXXwUYHk1jrXQwHEcEKNjK0qiJxpQnu7YVSMfIHtXbYpvAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:13.806981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08590","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73ea305634c3365e939a042c0645ac259cf916b017f07261b00b50230221350b","sha256:6cfa8f8a92af6cef5a2186a65054e87906b48b903ff85395a120cfea990e8a31"],"state_sha256":"be66f4155305eb54c1a1bb0035c228bef68d1c39521408cdb9a311cecc2d8700"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAUXDfT58gCxiVxUcEJS/QM3pDGt3kH4VSr9w6CONbBkqrT8LG5qVAD+KNUK9Itiy7UdnxanzNDn7k+a2jtiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T20:54:54.429533Z","bundle_sha256":"d622b80f178116571a8038522eac81639efe9299e406132b78b5cac8b4d019b5"}}