{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4QOWGR3NYAJOVHBN73YVKX2QJK","short_pith_number":"pith:4QOWGR3N","canonical_record":{"source":{"id":"1607.00372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-07-01T19:56:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"27ee307e0aade4047b4c3bb4d394cd8a6c8c2068ebdf9e534e295cea5180eb3b","abstract_canon_sha256":"3c98364b95330b5fd45be7f61aff2ab8c9c679c6b51722e1ca4a0f884c041472"},"schema_version":"1.0"},"canonical_sha256":"e41d63476dc012ea9c2dfef1555f504aa85dd4d1031aa378c5c61602bb2be896","source":{"kind":"arxiv","id":"1607.00372","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4QOWGR3NYAJOVHBN73YVKX2QJK","target":"record","payload":{"canonical_record":{"source":{"id":"1607.00372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2016-07-01T19:56:19Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"27ee307e0aade4047b4c3bb4d394cd8a6c8c2068ebdf9e534e295cea5180eb3b","abstract_canon_sha256":"3c98364b95330b5fd45be7f61aff2ab8c9c679c6b51722e1ca4a0f884c041472"},"schema_version":"1.0"},"canonical_sha256":"e41d63476dc012ea9c2dfef1555f504aa85dd4d1031aa378c5c61602bb2be896","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:54.643575Z","signature_b64":"bqqV6sIIi6LG5WuX0cVr2Gh2/p6nVSgfrgRLpMzPpLGLfKtRwyrvn/X5P6ir4Uw+AuREdIDI4KoPEidroWeQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e41d63476dc012ea9c2dfef1555f504aa85dd4d1031aa378c5c61602bb2be896","last_reissued_at":"2026-05-18T01:09:54.642981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:54.642981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.00372","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:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gprN/HuHhWlZpuhPK73ZxHO/U/AkqWYefN+6y2chbJhL58TM4e3xCz056O6OSRjebdAoLruoYaG/0XBA5yxQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:35:11.596203Z"},"content_sha256":"0088ca545b7d7d0c37b5528044248d75b7503d55cced11736f997cbb73a3afea","schema_version":"1.0","event_id":"sha256:0088ca545b7d7d0c37b5528044248d75b7503d55cced11736f997cbb73a3afea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4QOWGR3NYAJOVHBN73YVKX2QJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PF","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","submitted_at":"2016-07-01T19:56:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00372","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:09:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLfrFkCv1T9fH9iubiA5tflhmKHVktGb4ZoKLeHhw9eeCG0/YPTZmE90680YgktPzUOLp+OpwzOp6Qma6YvGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T08:35:11.596556Z"},"content_sha256":"4ef4e78e86b57a307e5234aa27a133482ef662ff8f09122b229b1a4f2e3c4e59","schema_version":"1.0","event_id":"sha256:4ef4e78e86b57a307e5234aa27a133482ef662ff8f09122b229b1a4f2e3c4e59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/bundle.json","state_url":"https://pith.science/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/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-27T08:35:11Z","links":{"resolver":"https://pith.science/pith/4QOWGR3NYAJOVHBN73YVKX2QJK","bundle":"https://pith.science/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/bundle.json","state":"https://pith.science/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QOWGR3NYAJOVHBN73YVKX2QJK/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WtCyWkSRFcT69r8rzHYMyh6nOuafKJV7MRc05R6+SwaQCRS6fN+Nt52alzdd77ut3yilvusDpdCN77tTuXbOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T08:35:11.598387Z","bundle_sha256":"56195ea4e61115731289b6f4246a081e9f2aabb539b6b72410f2ae9a626ef734"}}