{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NRS4OWELU57KYPBR3V7H4C6EQO","short_pith_number":"pith:NRS4OWEL","canonical_record":{"source":{"id":"1707.04507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-14T13:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"fbb8aefce48d69932d581d0ef1d3e8ad882abb6757cee19968bc40fc0ed6af89","abstract_canon_sha256":"7f091fa84a4e4f78ee27efa2741e622ca411c1a17decd03956c78635f3ee24ce"},"schema_version":"1.0"},"canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","source":{"kind":"arxiv","id":"1707.04507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04507","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04507v1","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04507","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"NRS4OWELU57K","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRS4OWELU57KYPBR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRS4OWEL","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NRS4OWELU57KYPBR3V7H4C6EQO","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-14T13:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"fbb8aefce48d69932d581d0ef1d3e8ad882abb6757cee19968bc40fc0ed6af89","abstract_canon_sha256":"7f091fa84a4e4f78ee27efa2741e622ca411c1a17decd03956c78635f3ee24ce"},"schema_version":"1.0"},"canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.977220Z","signature_b64":"N4RjjJOmR8YMCGaidrn1Ejv88NyeEWgjQqIPP+WHaehJhG/et9PwBnF9og0iCBb27cfQIZtN4wxamHIFCPQ5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","last_reissued_at":"2026-05-18T00:40:17.976491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.976491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04507","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-18T00:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Is/0vPiUfdBERkdUpIHalhfm8Z73gGRqPu9y0fVlaSwDAO5wvSh6et3aRDkm0EpJRCG99MpeN56Gz878lo6aDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:41:54.728577Z"},"content_sha256":"3bd03bf6964a79d073af936bf8ec3cbbd4a040c0f12ae6a22a9596bf6d90772a","schema_version":"1.0","event_id":"sha256:3bd03bf6964a79d073af936bf8ec3cbbd4a040c0f12ae6a22a9596bf6d90772a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NRS4OWELU57KYPBR3V7H4C6EQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Timed Automata with Clock-Dependent Probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jeremy Sproston","submitted_at":"2017-07-14T13:47:30Z","abstract_excerpt":"Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04507","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-18T00:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYQXKVTayBMIlWwbHmPLUhUF6U3Q380GWq9AOTwTww/oUnWNo0gMYrn2sb1R91FG4/k543WOQkl3Prx5+lapAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:41:54.728922Z"},"content_sha256":"87c0d9f9d235c1b5a4ba9cad6877c0f3b5a6c08f45fa0c78330d23ded56b5292","schema_version":"1.0","event_id":"sha256:87c0d9f9d235c1b5a4ba9cad6877c0f3b5a6c08f45fa0c78330d23ded56b5292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/bundle.json","state_url":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRS4OWELU57KYPBR3V7H4C6EQO/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-26T03:41:54Z","links":{"resolver":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO","bundle":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/bundle.json","state":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRS4OWELU57KYPBR3V7H4C6EQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NRS4OWELU57KYPBR3V7H4C6EQO","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":"7f091fa84a4e4f78ee27efa2741e622ca411c1a17decd03956c78635f3ee24ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-14T13:47:30Z","title_canon_sha256":"fbb8aefce48d69932d581d0ef1d3e8ad882abb6757cee19968bc40fc0ed6af89"},"schema_version":"1.0","source":{"id":"1707.04507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04507","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04507v1","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04507","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"NRS4OWELU57K","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NRS4OWELU57KYPBR","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NRS4OWEL","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:87c0d9f9d235c1b5a4ba9cad6877c0f3b5a6c08f45fa0c78330d23ded56b5292","target":"graph","created_at":"2026-05-18T00:40: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":"Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage and the likelihood of system events. We show that the problem of deciding whether the maximum probability of reaching a certain location is above a threshold is undecidable for clock-dependent p","authors_text":"Jeremy Sproston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-14T13:47:30Z","title":"Probabilistic Timed Automata with Clock-Dependent Probabilities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04507","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:3bd03bf6964a79d073af936bf8ec3cbbd4a040c0f12ae6a22a9596bf6d90772a","target":"record","created_at":"2026-05-18T00:40: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":"7f091fa84a4e4f78ee27efa2741e622ca411c1a17decd03956c78635f3ee24ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-07-14T13:47:30Z","title_canon_sha256":"fbb8aefce48d69932d581d0ef1d3e8ad882abb6757cee19968bc40fc0ed6af89"},"schema_version":"1.0","source":{"id":"1707.04507","kind":"arxiv","version":1}},"canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","first_computed_at":"2026-05-18T00:40:17.976491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:17.976491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N4RjjJOmR8YMCGaidrn1Ejv88NyeEWgjQqIPP+WHaehJhG/et9PwBnF9og0iCBb27cfQIZtN4wxamHIFCPQ5Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:17.977220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bd03bf6964a79d073af936bf8ec3cbbd4a040c0f12ae6a22a9596bf6d90772a","sha256:87c0d9f9d235c1b5a4ba9cad6877c0f3b5a6c08f45fa0c78330d23ded56b5292"],"state_sha256":"ad90b560905d76ac5dd5eb24bbac6aa674cee31bd8bda22d530ca32194ed2ad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKX2OEJ31ReEpALsrs68gwhy8YfBAZdZ3gJdwSqEjOXFgkZcjNiVm9lwE4C+oZdCQ8Jkw4lompvXUvS8qdAmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:41:54.730880Z","bundle_sha256":"b8a69fa67599dd80fb4a17fa97dead8df53cb26e65c74d0dd017d68b375e32b2"}}