{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZXV3TKI2BLTCIEU664MCOBS4TI","short_pith_number":"pith:ZXV3TKI2","canonical_record":{"source":{"id":"1404.6613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T06:00:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4cc474c3aae4f1ffc672177f3ede2454afa179c62d0e37ce97930035af75af8","abstract_canon_sha256":"1a2cb8e6db4cfff7ece48fa8b882ba09642ae664b95832ecea1dcb5705332bf4"},"schema_version":"1.0"},"canonical_sha256":"cdebb9a91a0ae624129ef71827065c9a08571bc59e172ce66e292c2ba213664d","source":{"kind":"arxiv","id":"1404.6613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6613","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6613v2","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6613","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZXV3TKI2BLTC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXV3TKI2BLTCIEU6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXV3TKI2","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZXV3TKI2BLTCIEU664MCOBS4TI","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T06:00:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d4cc474c3aae4f1ffc672177f3ede2454afa179c62d0e37ce97930035af75af8","abstract_canon_sha256":"1a2cb8e6db4cfff7ece48fa8b882ba09642ae664b95832ecea1dcb5705332bf4"},"schema_version":"1.0"},"canonical_sha256":"cdebb9a91a0ae624129ef71827065c9a08571bc59e172ce66e292c2ba213664d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:00.404631Z","signature_b64":"FFVRu6MeOWekiqB3wGU0EzGtjCmoCqK4JrVvZujEhgfAF/mVmLr3LHdws4JFmvhg388CIpCFX8NXf0tUAdaDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdebb9a91a0ae624129ef71827065c9a08571bc59e172ce66e292c2ba213664d","last_reissued_at":"2026-05-18T02:04:00.403973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:00.403973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6613","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-18T02:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JbezuNhuXOlTtA8jbxLg4RYpI5zeHiBtoXcI6FHEG58TBK+POP1Yzr03lbzlMknVd17OAWHRTLQPxg/UaZRdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:31:31.222526Z"},"content_sha256":"7561518ac4b7d1deee66519181b206660128a90d1f9ebaed65c416a099c00706","schema_version":"1.0","event_id":"sha256:7561518ac4b7d1deee66519181b206660128a90d1f9ebaed65c416a099c00706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZXV3TKI2BLTCIEU664MCOBS4TI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing Clocks in Timed Automata while Preserving Bisimulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Chinmay Narayan, S. Arun-Kumar, Shibashis Guha","submitted_at":"2014-04-26T06:00:58Z","abstract_excerpt":"Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible. The problem of checking whether there exists a timed automaton with a smaller number of clocks such that the timed language accepted by the original automaton is preserved is known to be undecidable. In this paper, we give a construction, which for any given timed automaton produces a timed bisimilar automaton with the least number of clocks. Further, we show that such an automaton with the minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6613","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-18T02:04:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WTFwepg+Cj0ZJ1tFx3D9/DbPiKRf7U0JZD7eEugWF+M3o06UCY1oZXP4QRxn7Eqf3HxWNIKZ+58suganoI4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:31:31.222866Z"},"content_sha256":"7df2b894c04f28ff4512323796810cc7183b378f2a675c0a5aada13a639cdab6","schema_version":"1.0","event_id":"sha256:7df2b894c04f28ff4512323796810cc7183b378f2a675c0a5aada13a639cdab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/bundle.json","state_url":"https://pith.science/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/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-26T12:31:31Z","links":{"resolver":"https://pith.science/pith/ZXV3TKI2BLTCIEU664MCOBS4TI","bundle":"https://pith.science/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/bundle.json","state":"https://pith.science/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXV3TKI2BLTCIEU664MCOBS4TI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZXV3TKI2BLTCIEU664MCOBS4TI","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":"1a2cb8e6db4cfff7ece48fa8b882ba09642ae664b95832ecea1dcb5705332bf4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T06:00:58Z","title_canon_sha256":"d4cc474c3aae4f1ffc672177f3ede2454afa179c62d0e37ce97930035af75af8"},"schema_version":"1.0","source":{"id":"1404.6613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6613","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6613v2","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6613","created_at":"2026-05-18T02:04:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZXV3TKI2BLTC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZXV3TKI2BLTCIEU6","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZXV3TKI2","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:7df2b894c04f28ff4512323796810cc7183b378f2a675c0a5aada13a639cdab6","target":"graph","created_at":"2026-05-18T02:04:00Z","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":"Model checking timed automata becomes increasingly complex with the increase in the number of clocks. Hence it is desirable that one constructs an automaton with the minimum number of clocks possible. The problem of checking whether there exists a timed automaton with a smaller number of clocks such that the timed language accepted by the original automaton is preserved is known to be undecidable. In this paper, we give a construction, which for any given timed automaton produces a timed bisimilar automaton with the least number of clocks. Further, we show that such an automaton with the minim","authors_text":"Chinmay Narayan, S. Arun-Kumar, Shibashis Guha","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T06:00:58Z","title":"Reducing Clocks in Timed Automata while Preserving Bisimulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6613","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:7561518ac4b7d1deee66519181b206660128a90d1f9ebaed65c416a099c00706","target":"record","created_at":"2026-05-18T02:04:00Z","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":"1a2cb8e6db4cfff7ece48fa8b882ba09642ae664b95832ecea1dcb5705332bf4","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-26T06:00:58Z","title_canon_sha256":"d4cc474c3aae4f1ffc672177f3ede2454afa179c62d0e37ce97930035af75af8"},"schema_version":"1.0","source":{"id":"1404.6613","kind":"arxiv","version":2}},"canonical_sha256":"cdebb9a91a0ae624129ef71827065c9a08571bc59e172ce66e292c2ba213664d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdebb9a91a0ae624129ef71827065c9a08571bc59e172ce66e292c2ba213664d","first_computed_at":"2026-05-18T02:04:00.403973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:04:00.403973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FFVRu6MeOWekiqB3wGU0EzGtjCmoCqK4JrVvZujEhgfAF/mVmLr3LHdws4JFmvhg388CIpCFX8NXf0tUAdaDBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:04:00.404631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7561518ac4b7d1deee66519181b206660128a90d1f9ebaed65c416a099c00706","sha256:7df2b894c04f28ff4512323796810cc7183b378f2a675c0a5aada13a639cdab6"],"state_sha256":"82a0da7f1d172575c881d2c5b7f8b93953562990debd360320f75d40c0e31aa7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HuZxmwWlBHi4eHjsQdNX/jVzd2Y/x3SegsHKaZSgUr7Cqc0XD6Ek5DTfEYTHrxL312YjVA71UDkTXGXDdb4cBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:31:31.224850Z","bundle_sha256":"7853c11d0d70fe6dbebaaa09126b10d898ff70819b3f0c3464a024da38a9a89b"}}