{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NRS4OWELU57KYPBR3V7H4C6EQO","short_pith_number":"pith:NRS4OWEL","schema_version":"1.0","canonical_sha256":"6c65c7588ba77eac3c31dd7e7e0bc483a7c5bb831ee5ca554ddab2bbf7e5e39b","source":{"kind":"arxiv","id":"1707.04507","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.04507","created_at":"2026-05-18T00:40:17.976604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04507v1","created_at":"2026-05-18T00:40:17.976604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04507","created_at":"2026-05-18T00:40:17.976604+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRS4OWELU57K","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRS4OWELU57KYPBR","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRS4OWEL","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO","json":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO.json","graph_json":"https://pith.science/api/pith-number/NRS4OWELU57KYPBR3V7H4C6EQO/graph.json","events_json":"https://pith.science/api/pith-number/NRS4OWELU57KYPBR3V7H4C6EQO/events.json","paper":"https://pith.science/paper/NRS4OWEL"},"agent_actions":{"view_html":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO","download_json":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO.json","view_paper":"https://pith.science/paper/NRS4OWEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04507&json=true","fetch_graph":"https://pith.science/api/pith-number/NRS4OWELU57KYPBR3V7H4C6EQO/graph.json","fetch_events":"https://pith.science/api/pith-number/NRS4OWELU57KYPBR3V7H4C6EQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/action/storage_attestation","attest_author":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/action/author_attestation","sign_citation":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/action/citation_signature","submit_replication":"https://pith.science/pith/NRS4OWELU57KYPBR3V7H4C6EQO/action/replication_record"}},"created_at":"2026-05-18T00:40:17.976604+00:00","updated_at":"2026-05-18T00:40:17.976604+00:00"}