{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:M4KGLY6P5EAQV7LOEU5KBVMIIE","short_pith_number":"pith:M4KGLY6P","schema_version":"1.0","canonical_sha256":"671465e3cfe9010afd6e253aa0d5884136d32bf16430d2bde2a3abb2d4cb2ebf","source":{"kind":"arxiv","id":"1407.4777","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4777","created_at":"2026-05-18T01:17:05.642695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4777v4","created_at":"2026-05-18T01:17:05.642695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4777","created_at":"2026-05-18T01:17:05.642695+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4KGLY6P5EAQ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4KGLY6P5EAQV7LO","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4KGLY6P","created_at":"2026-05-18T12:28:38.356838+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/M4KGLY6P5EAQV7LOEU5KBVMIIE","json":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE.json","graph_json":"https://pith.science/api/pith-number/M4KGLY6P5EAQV7LOEU5KBVMIIE/graph.json","events_json":"https://pith.science/api/pith-number/M4KGLY6P5EAQV7LOEU5KBVMIIE/events.json","paper":"https://pith.science/paper/M4KGLY6P"},"agent_actions":{"view_html":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE","download_json":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE.json","view_paper":"https://pith.science/paper/M4KGLY6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4777&json=true","fetch_graph":"https://pith.science/api/pith-number/M4KGLY6P5EAQV7LOEU5KBVMIIE/graph.json","fetch_events":"https://pith.science/api/pith-number/M4KGLY6P5EAQV7LOEU5KBVMIIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/action/storage_attestation","attest_author":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/action/author_attestation","sign_citation":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/action/citation_signature","submit_replication":"https://pith.science/pith/M4KGLY6P5EAQV7LOEU5KBVMIIE/action/replication_record"}},"created_at":"2026-05-18T01:17:05.642695+00:00","updated_at":"2026-05-18T01:17:05.642695+00:00"}