{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M4KGLY6P5EAQV7LOEU5KBVMIIE","short_pith_number":"pith:M4KGLY6P","canonical_record":{"source":{"id":"1407.4777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-07-17T19:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"cbe1e2e32152e302794cfa84b060716efebb0cdbf16ec0951b7b6b266dbe75be","abstract_canon_sha256":"732d4c0f659a180174e6c49790ed13782375ddcc20df39dd31f4a73f04d64251"},"schema_version":"1.0"},"canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","source":{"kind":"arxiv","id":"1407.4777","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4777","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4777v4","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4777","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"M4KGLY6P5EAQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4KGLY6P5EAQV7LO","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4KGLY6P","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M4KGLY6P5EAQV7LOEU5KBVMIIE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.4777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-07-17T19:10:57Z","cross_cats_sorted":[],"title_canon_sha256":"cbe1e2e32152e302794cfa84b060716efebb0cdbf16ec0951b7b6b266dbe75be","abstract_canon_sha256":"732d4c0f659a180174e6c49790ed13782375ddcc20df39dd31f4a73f04d64251"},"schema_version":"1.0"},"canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:05.643244Z","signature_b64":"aMCeNX+inaawKUv3iPpdo95lA13+ogJY5k6/V/JYYmNdGWv0DEkXBdDTt8PzvbsQa1LDd10rVcSG7R57c0dVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","last_reissued_at":"2026-05-18T01:17:05.642605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:05.642605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.4777","source_version":4,"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:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsYQIEu/3iZa6hEHw3qlduVKWUPd5BWceK2vomR3N3ZoafXx6g0fvsrDk5lsW4ipYisSARwi25lk+nZsgkPxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:53:56.576349Z"},"content_sha256":"9ce443b52a7dd5580ef1285171a2bca5772271cdde86db60485950b167bd91aa","schema_version":"1.0","event_id":"sha256:9ce443b52a7dd5580ef1285171a2bca5772271cdde86db60485950b167bd91aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M4KGLY6P5EAQV7LOEU5KBVMIIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Jan Kr\\v{c}\\'al, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil, \\v{L}ubo\\v{s} Koren\\v{c}iak, Vojt\\v{e}ch \\v{R}eh\\'ak","submitted_at":"2014-07-17T19:10:57Z","abstract_excerpt":"We consider parametric version of fixed-delay continuous-time Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimise expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4777","kind":"arxiv","version":4},"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:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rLnH6WwJq0hWp4gWTslJkqiREjLMwUWoxCp5mbYInLTbd3n4lz8HbYNnO7IeI9zXlX3RO7Gd8aSWoDQcLmMIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:53:56.576874Z"},"content_sha256":"713a806dc2b00d582cfcdccc48dfb26778b4ee0cf345c6c2d11d7f48f6760333","schema_version":"1.0","event_id":"sha256:713a806dc2b00d582cfcdccc48dfb26778b4ee0cf345c6c2d11d7f48f6760333"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/bundle.json","state_url":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/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-05-28T22:53:56Z","links":{"resolver":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE","bundle":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/bundle.json","state":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M4KGLY6P5EAQV7LOEU5KBVMIIE","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":"732d4c0f659a180174e6c49790ed13782375ddcc20df39dd31f4a73f04d64251","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-07-17T19:10:57Z","title_canon_sha256":"cbe1e2e32152e302794cfa84b060716efebb0cdbf16ec0951b7b6b266dbe75be"},"schema_version":"1.0","source":{"id":"1407.4777","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4777","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4777v4","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4777","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"M4KGLY6P5EAQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M4KGLY6P5EAQV7LO","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M4KGLY6P","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:713a806dc2b00d582cfcdccc48dfb26778b4ee0cf345c6c2d11d7f48f6760333","target":"graph","created_at":"2026-05-18T01:17:05Z","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 parametric version of fixed-delay continuous-time Markov chains (or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay transitions are specified by parameters, rather than concrete values. Our goal is to synthesize values of these parameters that, for a given cost function, minimise expected total cost incurred before reaching a given set of target states. We show that under mild assumptions, optimal values of parameters can be effectively approximated using translation to a Markov decision process (MDP) whose actions correspond to discretized values of t","authors_text":"Jan Kr\\v{c}\\'al, Petr Novotn\\'y, Tom\\'a\\v{s} Br\\'azdil, \\v{L}ubo\\v{s} Koren\\v{c}iak, Vojt\\v{e}ch \\v{R}eh\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-07-17T19:10:57Z","title":"Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4777","kind":"arxiv","version":4},"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:9ce443b52a7dd5580ef1285171a2bca5772271cdde86db60485950b167bd91aa","target":"record","created_at":"2026-05-18T01:17:05Z","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":"732d4c0f659a180174e6c49790ed13782375ddcc20df39dd31f4a73f04d64251","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-07-17T19:10:57Z","title_canon_sha256":"cbe1e2e32152e302794cfa84b060716efebb0cdbf16ec0951b7b6b266dbe75be"},"schema_version":"1.0","source":{"id":"1407.4777","kind":"arxiv","version":4}},"canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","first_computed_at":"2026-05-18T01:17:05.642605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:05.642605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aMCeNX+inaawKUv3iPpdo95lA13+ogJY5k6/V/JYYmNdGWv0DEkXBdDTt8PzvbsQa1LDd10rVcSG7R57c0dVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:05.643244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4777","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ce443b52a7dd5580ef1285171a2bca5772271cdde86db60485950b167bd91aa","sha256:713a806dc2b00d582cfcdccc48dfb26778b4ee0cf345c6c2d11d7f48f6760333"],"state_sha256":"99b100592c9e029a3a881cc68b1e8a913ae5170bf5a06d97739681826a85399b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5rYEW4+JQDsmimWwPF6KSXGMb2B/pK3cw03Hk6xw/oF3OkE9n99RYeiCAjTn1vOcuAn/kmV1oKIYjdESthh/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:53:56.582606Z","bundle_sha256":"a922150765c28f148a4cf6880bd123ad0a5e3a5e7a24e93825f165af9c8f7977"}}