{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZTGD33SML5U2YSTOJWPK3IBEHY","short_pith_number":"pith:ZTGD33SM","canonical_record":{"source":{"id":"1605.05551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-18T12:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"24aaa031ef57678cf6bcb32a0bad0d9c73146eb1e65b42f65724b45a366c344b","abstract_canon_sha256":"c45215f39139f8c496e478d8002ef16c6f061a3e62c6f25b3e7c1d8038fb1b55"},"schema_version":"1.0"},"canonical_sha256":"cccc3dee4c5f69ac4a6e4d9eada0243e320f7ad4ae7865a379fd00f2944a8639","source":{"kind":"arxiv","id":"1605.05551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05551","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05551v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05551","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZTGD33SML5U2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTGD33SML5U2YSTO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTGD33SM","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZTGD33SML5U2YSTOJWPK3IBEHY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-18T12:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"24aaa031ef57678cf6bcb32a0bad0d9c73146eb1e65b42f65724b45a366c344b","abstract_canon_sha256":"c45215f39139f8c496e478d8002ef16c6f061a3e62c6f25b3e7c1d8038fb1b55"},"schema_version":"1.0"},"canonical_sha256":"cccc3dee4c5f69ac4a6e4d9eada0243e320f7ad4ae7865a379fd00f2944a8639","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:34.629088Z","signature_b64":"My+d/j2le1y6/2DPs87e8l7yGQG/jie8BKc8tFiaXYrtrbv/owI3sl8m6Jw3wHPPom3V6EFfdTDmdYRri5sJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cccc3dee4c5f69ac4a6e4d9eada0243e320f7ad4ae7865a379fd00f2944a8639","last_reissued_at":"2026-05-18T01:14:34.628393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:34.628393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05551","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NILJbJZIM7aNQ/LU8bcIbQSvkJnNTqpYdpTp6pSafAb4/+KxoXyiWYNyRRkZpYJkumKLGXx0wCJGPJU+B6JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:29.293889Z"},"content_sha256":"6ac44aab54904d8c507856c027d1de94e9d4fc2f407941d4d2c371f9779a1569","schema_version":"1.0","event_id":"sha256:6ac44aab54904d8c507856c027d1de94e9d4fc2f407941d4d2c371f9779a1569"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZTGD33SML5U2YSTOJWPK3IBEHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arnd Hartmanns, Ernst Moritz Hahn","submitted_at":"2016-05-18T12:34:35Z","abstract_excerpt":"In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central importance. Traditionally, such requirements have been model-checked via a reduction to the unbounded case by unfolding the model according to the cost bound. This exacerbates the state space explosion problem and significantly increases runtime. In this paper, we present three new algorithms to model-check time- and cost-bounded properties for Markov decision processes and probabilistic timed automata that avoid unfolding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05551","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:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZImUkLFlKeasv2f11kzzLD3Dd9yXUepk1ds6+AiJS8NNNns1HjFtfPOPN1zhnmnXiNum+e3ws2xTGyRRHu1YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:29:29.294231Z"},"content_sha256":"e700c4892533c3acc6d6511f5bbf8397f30bb694fe4fb6082aae4b2d50374846","schema_version":"1.0","event_id":"sha256:e700c4892533c3acc6d6511f5bbf8397f30bb694fe4fb6082aae4b2d50374846"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/bundle.json","state_url":"https://pith.science/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/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-02T20:29:29Z","links":{"resolver":"https://pith.science/pith/ZTGD33SML5U2YSTOJWPK3IBEHY","bundle":"https://pith.science/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/bundle.json","state":"https://pith.science/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTGD33SML5U2YSTOJWPK3IBEHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZTGD33SML5U2YSTOJWPK3IBEHY","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":"c45215f39139f8c496e478d8002ef16c6f061a3e62c6f25b3e7c1d8038fb1b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-18T12:34:35Z","title_canon_sha256":"24aaa031ef57678cf6bcb32a0bad0d9c73146eb1e65b42f65724b45a366c344b"},"schema_version":"1.0","source":{"id":"1605.05551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05551","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05551v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05551","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"ZTGD33SML5U2","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZTGD33SML5U2YSTO","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZTGD33SM","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:e700c4892533c3acc6d6511f5bbf8397f30bb694fe4fb6082aae4b2d50374846","target":"graph","created_at":"2026-05-18T01:14:34Z","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":"In the design of probabilistic timed systems, bounded requirements concerning behaviour that occurs within a given time, energy, or more generally cost budget are of central importance. Traditionally, such requirements have been model-checked via a reduction to the unbounded case by unfolding the model according to the cost bound. This exacerbates the state space explosion problem and significantly increases runtime. In this paper, we present three new algorithms to model-check time- and cost-bounded properties for Markov decision processes and probabilistic timed automata that avoid unfolding","authors_text":"Arnd Hartmanns, Ernst Moritz Hahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-18T12:34:35Z","title":"Efficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05551","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:6ac44aab54904d8c507856c027d1de94e9d4fc2f407941d4d2c371f9779a1569","target":"record","created_at":"2026-05-18T01:14:34Z","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":"c45215f39139f8c496e478d8002ef16c6f061a3e62c6f25b3e7c1d8038fb1b55","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-05-18T12:34:35Z","title_canon_sha256":"24aaa031ef57678cf6bcb32a0bad0d9c73146eb1e65b42f65724b45a366c344b"},"schema_version":"1.0","source":{"id":"1605.05551","kind":"arxiv","version":1}},"canonical_sha256":"cccc3dee4c5f69ac4a6e4d9eada0243e320f7ad4ae7865a379fd00f2944a8639","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cccc3dee4c5f69ac4a6e4d9eada0243e320f7ad4ae7865a379fd00f2944a8639","first_computed_at":"2026-05-18T01:14:34.628393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:34.628393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"My+d/j2le1y6/2DPs87e8l7yGQG/jie8BKc8tFiaXYrtrbv/owI3sl8m6Jw3wHPPom3V6EFfdTDmdYRri5sJDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:34.629088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac44aab54904d8c507856c027d1de94e9d4fc2f407941d4d2c371f9779a1569","sha256:e700c4892533c3acc6d6511f5bbf8397f30bb694fe4fb6082aae4b2d50374846"],"state_sha256":"771bf65ff146801f7f83deec31302111a9b57a146b726a46327a30493606a8ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3rVqLP1+wxKATf87+wuC5vFD4/gE3PgXD1afjZwx2gCAXausWohrwH96nRnKQMsBFVfKxx22iStRA9WE4rpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:29:29.296478Z","bundle_sha256":"f84a37b9f252c2fb5a6f0058276b791770dc9d245b01d316c0f4fcbed5c34f8a"}}