{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4QOWGR3NYAJOVHBN73YVKX2QJK","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":"3c98364b95330b5fd45be7f61aff2ab8c9c679c6b51722e1ca4a0f884c041472","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-07-01T19:56:19Z","title_canon_sha256":"27ee307e0aade4047b4c3bb4d394cd8a6c8c2068ebdf9e534e295cea5180eb3b"},"schema_version":"1.0","source":{"id":"1607.00372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.00372","created_at":"2026-05-18T01:09:54Z"},{"alias_kind":"arxiv_version","alias_value":"1607.00372v1","created_at":"2026-05-18T01:09:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00372","created_at":"2026-05-18T01:09:54Z"},{"alias_kind":"pith_short_12","alias_value":"4QOWGR3NYAJO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4QOWGR3NYAJOVHBN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4QOWGR3N","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:4ef4e78e86b57a307e5234aa27a133482ef662ff8f09122b229b1a4f2e3c4e59","target":"graph","created_at":"2026-05-18T01:09:54Z","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":"We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-delay transitions (fdCTMC). The goal is to synthesize concrete values of the fixed-delays (timeouts) that minimize the expected total cost incurred before reaching a given set of target states. The same problem has been considered and solved in previous works by computing an optimal policy in a certain discrete-time Markov decision process (MDP) with a huge number of actions that correspond to suitably discretized values of the timeouts.\n  In this paper, we design a symbolic fixed-delay synthesi","authors_text":"Anton\\'in Ku\\v{c}era, \\v{L}ubo\\v{s} Koren\\v{c}iak, Vojt\\v{e}ch \\v{R}eh\\'ak","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-07-01T19:56:19Z","title":"Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00372","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:0088ca545b7d7d0c37b5528044248d75b7503d55cced11736f997cbb73a3afea","target":"record","created_at":"2026-05-18T01:09:54Z","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":"3c98364b95330b5fd45be7f61aff2ab8c9c679c6b51722e1ca4a0f884c041472","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-07-01T19:56:19Z","title_canon_sha256":"27ee307e0aade4047b4c3bb4d394cd8a6c8c2068ebdf9e534e295cea5180eb3b"},"schema_version":"1.0","source":{"id":"1607.00372","kind":"arxiv","version":1}},"canonical_sha256":"e41d63476dc012ea9c2dfef1555f504aa85dd4d1031aa378c5c61602bb2be896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e41d63476dc012ea9c2dfef1555f504aa85dd4d1031aa378c5c61602bb2be896","first_computed_at":"2026-05-18T01:09:54.642981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:54.642981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bqqV6sIIi6LG5WuX0cVr2Gh2/p6nVSgfrgRLpMzPpLGLfKtRwyrvn/X5P6ir4Uw+AuREdIDI4KoPEidroWeQCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:54.643575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.00372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0088ca545b7d7d0c37b5528044248d75b7503d55cced11736f997cbb73a3afea","sha256:4ef4e78e86b57a307e5234aa27a133482ef662ff8f09122b229b1a4f2e3c4e59"],"state_sha256":"9a267e2ab5267cc065b7bcd74de5a0e1b39e80f67c0ec47fa4f2ce724c189020"}