{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VR6CRLQISE4KU4ZE4D2AP3D4OI","short_pith_number":"pith:VR6CRLQI","canonical_record":{"source":{"id":"1410.4509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T11:45:23Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"d4cd3a006953ebbef5a37f864868eb47156d68ae72cdd5a04d74bd5c4150f0ca","abstract_canon_sha256":"5eb027128c75751b7e2a52b95bed8de39f4ceb353a6b69e85ff1874a4614e88b"},"schema_version":"1.0"},"canonical_sha256":"ac7c28ae089138aa7324e0f407ec7c72390c75fc09e48d42c590a5b76dd3c0f3","source":{"kind":"arxiv","id":"1410.4509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4509","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4509v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4509","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"VR6CRLQISE4K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VR6CRLQISE4KU4ZE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VR6CRLQI","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VR6CRLQISE4KU4ZE4D2AP3D4OI","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T11:45:23Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"d4cd3a006953ebbef5a37f864868eb47156d68ae72cdd5a04d74bd5c4150f0ca","abstract_canon_sha256":"5eb027128c75751b7e2a52b95bed8de39f4ceb353a6b69e85ff1874a4614e88b"},"schema_version":"1.0"},"canonical_sha256":"ac7c28ae089138aa7324e0f407ec7c72390c75fc09e48d42c590a5b76dd3c0f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.018815Z","signature_b64":"wAwr8SFDOOFdsavaj7fp5zwynBCLQlY5c9qdXioxOAfupXYDO9ujJ4+VaHAzqjMnVbacVReumw/EDiS9t9rFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac7c28ae089138aa7324e0f407ec7c72390c75fc09e48d42c590a5b76dd3c0f3","last_reissued_at":"2026-05-18T02:39:56.018367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.018367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4509","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-18T02:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6NFAvVVVqQ9Tlc/vlBawkrfHd9GAFnfDk2vhArVkV6Ax6C053s1BgGdAf+smBU6LsTA8sR64cLlyrigviVKtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:03:25.025397Z"},"content_sha256":"49995abc981fab8f1607ef8245edc09bf55c13dd589b460712be30bd68fb5a11","schema_version":"1.0","event_id":"sha256:49995abc981fab8f1607ef8245edc09bf55c13dd589b460712be30bd68fb5a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VR6CRLQISE4KU4ZE4D2AP3D4OI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast detection of cycles in timed automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Aakash Deshpande, B. Srivathsan, Fr\\'ed\\'eric Herbreteau, Igor Walukiewicz, Thanh-Tung Tran","submitted_at":"2014-10-15T11:45:23Z","abstract_excerpt":"We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is exponential in the number of clocks. Our method is polynomial: it essentially does a logarithmic number of zone canonicalizations. This method can be incorporated in algorithms for verifying B\\\"uchi properties on timed automata. We report on some experiments that show a significant reduction in search space when our iteratability test is used."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4509","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-18T02:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/YGZ6NPMiJdHtVX7wGm1CfwNi/pcxOPArOfh4LgrKbZkPtY5ZQFmE1G0mqm4LyyRmvoa91+RRsPIEFGT0Z1aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:03:25.025748Z"},"content_sha256":"51d213bfce06609821576fcde74b16fcadbf18d0b7f3394fb88620b74c25471f","schema_version":"1.0","event_id":"sha256:51d213bfce06609821576fcde74b16fcadbf18d0b7f3394fb88620b74c25471f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/bundle.json","state_url":"https://pith.science/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/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-05T14:03:25Z","links":{"resolver":"https://pith.science/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI","bundle":"https://pith.science/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/bundle.json","state":"https://pith.science/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VR6CRLQISE4KU4ZE4D2AP3D4OI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VR6CRLQISE4KU4ZE4D2AP3D4OI","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":"5eb027128c75751b7e2a52b95bed8de39f4ceb353a6b69e85ff1874a4614e88b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T11:45:23Z","title_canon_sha256":"d4cd3a006953ebbef5a37f864868eb47156d68ae72cdd5a04d74bd5c4150f0ca"},"schema_version":"1.0","source":{"id":"1410.4509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4509","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4509v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4509","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"VR6CRLQISE4K","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VR6CRLQISE4KU4ZE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VR6CRLQI","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:51d213bfce06609821576fcde74b16fcadbf18d0b7f3394fb88620b74c25471f","target":"graph","created_at":"2026-05-18T02:39:56Z","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 propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is exponential in the number of clocks. Our method is polynomial: it essentially does a logarithmic number of zone canonicalizations. This method can be incorporated in algorithms for verifying B\\\"uchi properties on timed automata. We report on some experiments that show a significant reduction in search space when our iteratability test is used.","authors_text":"Aakash Deshpande, B. Srivathsan, Fr\\'ed\\'eric Herbreteau, Igor Walukiewicz, Thanh-Tung Tran","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T11:45:23Z","title":"Fast detection of cycles in timed automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4509","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:49995abc981fab8f1607ef8245edc09bf55c13dd589b460712be30bd68fb5a11","target":"record","created_at":"2026-05-18T02:39:56Z","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":"5eb027128c75751b7e2a52b95bed8de39f4ceb353a6b69e85ff1874a4614e88b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-15T11:45:23Z","title_canon_sha256":"d4cd3a006953ebbef5a37f864868eb47156d68ae72cdd5a04d74bd5c4150f0ca"},"schema_version":"1.0","source":{"id":"1410.4509","kind":"arxiv","version":1}},"canonical_sha256":"ac7c28ae089138aa7324e0f407ec7c72390c75fc09e48d42c590a5b76dd3c0f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac7c28ae089138aa7324e0f407ec7c72390c75fc09e48d42c590a5b76dd3c0f3","first_computed_at":"2026-05-18T02:39:56.018367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:56.018367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wAwr8SFDOOFdsavaj7fp5zwynBCLQlY5c9qdXioxOAfupXYDO9ujJ4+VaHAzqjMnVbacVReumw/EDiS9t9rFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:56.018815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49995abc981fab8f1607ef8245edc09bf55c13dd589b460712be30bd68fb5a11","sha256:51d213bfce06609821576fcde74b16fcadbf18d0b7f3394fb88620b74c25471f"],"state_sha256":"0c820d182ba37fa685125639a62dca58513c92d8649a13825699cc634fe419d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U29b57nJiYSa9NxD0ysyBFtkKUonb9VvkqXT+JAUYPzXJEiMQJfLwPShQ4FknMS5NkmqmbY90Ch1T9ZDS6zyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:03:25.027732Z","bundle_sha256":"40b63c815a4831fabcf8d5c09c194cc8c6120d844bd19b4f3dfcf0852219747b"}}