{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XL4GMUWCWGTFVXJOZSQWZRFZCS","short_pith_number":"pith:XL4GMUWC","canonical_record":{"source":{"id":"2403.02210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-04T16:59:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c5a919d00291fbbd12f074f080a93a68ccb2527b7db0e555a5e81aa5e350301a","abstract_canon_sha256":"c5e15a938624b2573af00abf3226df28b158a16d10eda07ceb0b256899c3b601"},"schema_version":"1.0"},"canonical_sha256":"baf86652c2b1a65add2ecca16cc4b914b8633aa1b95324f4f275829e918457d1","source":{"kind":"arxiv","id":"2403.02210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02210","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02210v1","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02210","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"XL4GMUWCWGTF","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_16","alias_value":"XL4GMUWCWGTFVXJO","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_8","alias_value":"XL4GMUWC","created_at":"2026-07-05T07:51:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XL4GMUWCWGTFVXJOZSQWZRFZCS","target":"record","payload":{"canonical_record":{"source":{"id":"2403.02210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-04T16:59:11Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c5a919d00291fbbd12f074f080a93a68ccb2527b7db0e555a5e81aa5e350301a","abstract_canon_sha256":"c5e15a938624b2573af00abf3226df28b158a16d10eda07ceb0b256899c3b601"},"schema_version":"1.0"},"canonical_sha256":"baf86652c2b1a65add2ecca16cc4b914b8633aa1b95324f4f275829e918457d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:57.992078Z","signature_b64":"uTM70mzALse+2Grwf5Kzzv1ESqrBcXrHJBSzdwDczLEGQtrkSm2cqIY0UxHu+NjWOjbg1MBNB/Vv+4T2PJc7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baf86652c2b1a65add2ecca16cc4b914b8633aa1b95324f4f275829e918457d1","last_reissued_at":"2026-07-05T07:51:57.991555Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:57.991555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.02210","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-07-05T07:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7BVD2UomLx27qpjNkbIsiinpYAsideHasspBkq81xP/OzpK1SsIRrKQixgcj+JI+Kov/03SnSojAAe377e/QCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:07:41.079945Z"},"content_sha256":"be834eedfd48e5c3f6778bd39977469555c779c286faa85adc49cffe52313d89","schema_version":"1.0","event_id":"sha256:be834eedfd48e5c3f6778bd39977469555c779c286faa85adc49cffe52313d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XL4GMUWCWGTFVXJOZSQWZRFZCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unknown Biases and Timing Constraints in Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Darion Haase, Joost-Pieter Katoen","submitted_at":"2024-03-04T16:59:11Z","abstract_excerpt":"Timed automata are the formal model for real-time systems. Extensions with discrete probabilistic branching have been considered in the literature and successfully applied. Probabilistic timed automata (PTA) do require all branching probabilities and clock constraints to be constants. This report investigates PTA in which this constraint is relaxed: both branching probabilities and clock constraints can be parametric. We formally define this PTA variant and define its semantics by an uncountable parametric Markov Decision Process (pMDP). We show that reachability probabilities in parametric L/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02210","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02210/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QktehOP2Kd02uTA0r+AZIKjlOlLTcn1T5E9wBxNsAXmTggoaAZkTscug1uyjvbeBMLdixrWqYJfEtU67zx8nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T23:07:41.080499Z"},"content_sha256":"4de729e0c15f69c0542a426a0123d255d155ccae46f9778cb86f0d610e9ef474","schema_version":"1.0","event_id":"sha256:4de729e0c15f69c0542a426a0123d255d155ccae46f9778cb86f0d610e9ef474"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/bundle.json","state_url":"https://pith.science/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/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-08-04T23:07:41Z","links":{"resolver":"https://pith.science/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS","bundle":"https://pith.science/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/bundle.json","state":"https://pith.science/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XL4GMUWCWGTFVXJOZSQWZRFZCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XL4GMUWCWGTFVXJOZSQWZRFZCS","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":"c5e15a938624b2573af00abf3226df28b158a16d10eda07ceb0b256899c3b601","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-04T16:59:11Z","title_canon_sha256":"c5a919d00291fbbd12f074f080a93a68ccb2527b7db0e555a5e81aa5e350301a"},"schema_version":"1.0","source":{"id":"2403.02210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02210","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02210v1","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02210","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"XL4GMUWCWGTF","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_16","alias_value":"XL4GMUWCWGTFVXJO","created_at":"2026-07-05T07:51:57Z"},{"alias_kind":"pith_short_8","alias_value":"XL4GMUWC","created_at":"2026-07-05T07:51:57Z"}],"graph_snapshots":[{"event_id":"sha256:4de729e0c15f69c0542a426a0123d255d155ccae46f9778cb86f0d610e9ef474","target":"graph","created_at":"2026-07-05T07:51:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.02210/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Timed automata are the formal model for real-time systems. Extensions with discrete probabilistic branching have been considered in the literature and successfully applied. Probabilistic timed automata (PTA) do require all branching probabilities and clock constraints to be constants. This report investigates PTA in which this constraint is relaxed: both branching probabilities and clock constraints can be parametric. We formally define this PTA variant and define its semantics by an uncountable parametric Markov Decision Process (pMDP). We show that reachability probabilities in parametric L/","authors_text":"Darion Haase, Joost-Pieter Katoen","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-04T16:59:11Z","title":"Unknown Biases and Timing Constraints in Timed Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02210","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:be834eedfd48e5c3f6778bd39977469555c779c286faa85adc49cffe52313d89","target":"record","created_at":"2026-07-05T07:51:57Z","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":"c5e15a938624b2573af00abf3226df28b158a16d10eda07ceb0b256899c3b601","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2024-03-04T16:59:11Z","title_canon_sha256":"c5a919d00291fbbd12f074f080a93a68ccb2527b7db0e555a5e81aa5e350301a"},"schema_version":"1.0","source":{"id":"2403.02210","kind":"arxiv","version":1}},"canonical_sha256":"baf86652c2b1a65add2ecca16cc4b914b8633aa1b95324f4f275829e918457d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"baf86652c2b1a65add2ecca16cc4b914b8633aa1b95324f4f275829e918457d1","first_computed_at":"2026-07-05T07:51:57.991555Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:51:57.991555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uTM70mzALse+2Grwf5Kzzv1ESqrBcXrHJBSzdwDczLEGQtrkSm2cqIY0UxHu+NjWOjbg1MBNB/Vv+4T2PJc7BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:51:57.992078Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be834eedfd48e5c3f6778bd39977469555c779c286faa85adc49cffe52313d89","sha256:4de729e0c15f69c0542a426a0123d255d155ccae46f9778cb86f0d610e9ef474"],"state_sha256":"23ae8a48e0bf5145dd928e50d07623a9196cd249e03327d4609f5318e38e97ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BgAYV8F60U8KqzcF7uE/tzIceQQH+1hSqv7IEUQbK8iXq0O1FK1lXHNHO5vVvLzdR+AVr9nRBkRVNStZdvoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T23:07:41.085151Z","bundle_sha256":"ed597b2eddaca50de1c6b687e19aa1bd74e85ab50dc622a05f967c3ce705c980"}}