{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VYP62WFDRFBOIT5TYZJHFSKH25","short_pith_number":"pith:VYP62WFD","canonical_record":{"source":{"id":"1508.03575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-08-14T17:31:38Z","cross_cats_sorted":[],"title_canon_sha256":"efdcfec3b880b92b894a76f895e7ef1e0016b941ddec6cbd7acfe2422a78450d","abstract_canon_sha256":"e6d510917fc44dc2226b74c9bc03b5f2a8749752296890aebf9cec986713f70f"},"schema_version":"1.0"},"canonical_sha256":"ae1fed58a38942e44fb3c65272c947d7726b8ecdccb112c95c52e55ed79ddbaf","source":{"kind":"arxiv","id":"1508.03575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03575","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03575v1","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03575","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"VYP62WFDRFBO","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VYP62WFDRFBOIT5T","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VYP62WFD","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VYP62WFDRFBOIT5TYZJHFSKH25","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-08-14T17:31:38Z","cross_cats_sorted":[],"title_canon_sha256":"efdcfec3b880b92b894a76f895e7ef1e0016b941ddec6cbd7acfe2422a78450d","abstract_canon_sha256":"e6d510917fc44dc2226b74c9bc03b5f2a8749752296890aebf9cec986713f70f"},"schema_version":"1.0"},"canonical_sha256":"ae1fed58a38942e44fb3c65272c947d7726b8ecdccb112c95c52e55ed79ddbaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.335559Z","signature_b64":"+NaRbTGok2BgEpvlCMw2L88ZUVaB9t7pAKV+t8p3Egd69gTegjM9JwVt/q5A/ToiSpLWCNgyVNfDtsGUCtHYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae1fed58a38942e44fb3c65272c947d7726b8ecdccb112c95c52e55ed79ddbaf","last_reissued_at":"2026-05-18T01:35:17.335074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.335074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03575","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-18T01:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C19rmO8MwZQBI1sCUGGVYZGpq8bqgGDlGCbP7YJOPw4+EMooBgd0lqsPZBYhw60pd6C0g68KNDtwTnZAmCMIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:33.528566Z"},"content_sha256":"2c55bde5eac6ad158dd70e1bf9b054f2fbe43cfc85cbea478672a7a9fc48b8a7","schema_version":"1.0","event_id":"sha256:2c55bde5eac6ad158dd70e1bf9b054f2fbe43cfc85cbea478672a7a9fc48b8a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VYP62WFDRFBOIT5TYZJHFSKH25","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Determinization of Timed Automata with Silent Transitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Amnon Rosenmann, Bernhard Aichernig, Dejan Nickovic, Florian Lorber","submitted_at":"2015-08-14T17:31:38Z","abstract_excerpt":"Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03575","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-18T01:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlusQYYm3fnYhsskCVD9oSqRVnpAb9Y/H1AQcGx8V2CYOb1sKjmka9G4ca/D5U22XtI5t6fivdP4DaX46HtrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:46:33.529190Z"},"content_sha256":"b9040b714b9196d5a4dac4ea6800ad2e39ee2b2890a839a0ca1560428e5fd328","schema_version":"1.0","event_id":"sha256:b9040b714b9196d5a4dac4ea6800ad2e39ee2b2890a839a0ca1560428e5fd328"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYP62WFDRFBOIT5TYZJHFSKH25/bundle.json","state_url":"https://pith.science/pith/VYP62WFDRFBOIT5TYZJHFSKH25/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYP62WFDRFBOIT5TYZJHFSKH25/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-05-26T14:46:33Z","links":{"resolver":"https://pith.science/pith/VYP62WFDRFBOIT5TYZJHFSKH25","bundle":"https://pith.science/pith/VYP62WFDRFBOIT5TYZJHFSKH25/bundle.json","state":"https://pith.science/pith/VYP62WFDRFBOIT5TYZJHFSKH25/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYP62WFDRFBOIT5TYZJHFSKH25/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VYP62WFDRFBOIT5TYZJHFSKH25","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":"e6d510917fc44dc2226b74c9bc03b5f2a8749752296890aebf9cec986713f70f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-08-14T17:31:38Z","title_canon_sha256":"efdcfec3b880b92b894a76f895e7ef1e0016b941ddec6cbd7acfe2422a78450d"},"schema_version":"1.0","source":{"id":"1508.03575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03575","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03575v1","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03575","created_at":"2026-05-18T01:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"VYP62WFDRFBO","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"VYP62WFDRFBOIT5T","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"VYP62WFD","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:b9040b714b9196d5a4dac4ea6800ad2e39ee2b2890a839a0ca1560428e5fd328","target":"graph","created_at":"2026-05-18T01:35:17Z","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":"Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees,","authors_text":"Amnon Rosenmann, Bernhard Aichernig, Dejan Nickovic, Florian Lorber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-08-14T17:31:38Z","title":"Bounded Determinization of Timed Automata with Silent Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03575","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:2c55bde5eac6ad158dd70e1bf9b054f2fbe43cfc85cbea478672a7a9fc48b8a7","target":"record","created_at":"2026-05-18T01:35:17Z","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":"e6d510917fc44dc2226b74c9bc03b5f2a8749752296890aebf9cec986713f70f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-08-14T17:31:38Z","title_canon_sha256":"efdcfec3b880b92b894a76f895e7ef1e0016b941ddec6cbd7acfe2422a78450d"},"schema_version":"1.0","source":{"id":"1508.03575","kind":"arxiv","version":1}},"canonical_sha256":"ae1fed58a38942e44fb3c65272c947d7726b8ecdccb112c95c52e55ed79ddbaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae1fed58a38942e44fb3c65272c947d7726b8ecdccb112c95c52e55ed79ddbaf","first_computed_at":"2026-05-18T01:35:17.335074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:17.335074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+NaRbTGok2BgEpvlCMw2L88ZUVaB9t7pAKV+t8p3Egd69gTegjM9JwVt/q5A/ToiSpLWCNgyVNfDtsGUCtHYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:17.335559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c55bde5eac6ad158dd70e1bf9b054f2fbe43cfc85cbea478672a7a9fc48b8a7","sha256:b9040b714b9196d5a4dac4ea6800ad2e39ee2b2890a839a0ca1560428e5fd328"],"state_sha256":"da3044a18242d32b37a96fbab3f9ae704c86da78e8c568b9e9b59b50359b181d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5NuEOdNeLgOat22NcKpYK8yWMaYCeyFWKd2OX9yqHlhLppbgQaBVOQdyHQPPlgtsHyi+nTYqbsbugRG3nZNECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:46:33.532894Z","bundle_sha256":"10ad2df388fd25e791eb9bde1617fbb6ef81b4b640e24b8bcc2f7b2e1009a002"}}