{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J6VDLUE5M3YQG7HJIDPF5MA3P2","short_pith_number":"pith:J6VDLUE5","canonical_record":{"source":{"id":"1402.2967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T15:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"1d49f2292c05b4090dee43cedddb80ebac49ab507a3073f4d654365b91181ac6","abstract_canon_sha256":"1aea33f5807933dd8bcc4b6e6a1741979dc9e94465b4bdc6f47a9da3a781392f"},"schema_version":"1.0"},"canonical_sha256":"4faa35d09d66f1037ce940de5eb01b7ea4ceff79d550510c2ee1e3ecf9f787d3","source":{"kind":"arxiv","id":"1402.2967","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2967","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2967v3","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2967","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"J6VDLUE5M3YQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6VDLUE5M3YQG7HJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6VDLUE5","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J6VDLUE5M3YQG7HJIDPF5MA3P2","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T15:33:35Z","cross_cats_sorted":[],"title_canon_sha256":"1d49f2292c05b4090dee43cedddb80ebac49ab507a3073f4d654365b91181ac6","abstract_canon_sha256":"1aea33f5807933dd8bcc4b6e6a1741979dc9e94465b4bdc6f47a9da3a781392f"},"schema_version":"1.0"},"canonical_sha256":"4faa35d09d66f1037ce940de5eb01b7ea4ceff79d550510c2ee1e3ecf9f787d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:10.586130Z","signature_b64":"ia8IgNOqX2+ht7b5cSVCyaptu3nDzJ9+EPuu/mfnEUbI/xqYy/rwFuXaQlAYAurvVpl2ojsN+lK+MJf8OBQxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4faa35d09d66f1037ce940de5eb01b7ea4ceff79d550510c2ee1e3ecf9f787d3","last_reissued_at":"2026-05-18T02:20:10.585442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:10.585442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2967","source_version":3,"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-18T02:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtz1R0Nt8BVmflLgHoTxfCTst5AGCsguQdDlVdvT+fRizd90luBpmZNyhHyQgR04wh4O/q2+7L0vQVgh0wRyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:05:38.039212Z"},"content_sha256":"add19db1b8828a9a9aa1a505ad32aa05f697a531b459036621e194215ca8e15f","schema_version":"1.0","event_id":"sha256:add19db1b8828a9a9aa1a505ad32aa05f697a531b459036621e194215ca8e15f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J6VDLUE5M3YQG7HJIDPF5MA3P2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of Markov Decision Processes using Learning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"David Parker, Jan K\\v{r}et\\'insk\\'y, Krishnendu Chatterjee, Marta Kwiatkowska, Martin Chmel\\'ik, Mateusz Ujma, Tom\\'a\\v{s} Br\\'azdil, Vojt\\v{e}ch Forejt","submitted_at":"2014-02-10T15:33:35Z","abstract_excerpt":"We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2967","kind":"arxiv","version":3},"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-18T02:20:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lymP0qStpy4aXdfKJSfla7T8ZIR6f9CGvXoJC4Q9UEV4yK8LRICYDNqJ9m9gwwWXvUAOwfYMkbn30fEFpw26Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:05:38.039584Z"},"content_sha256":"ea367cf3298165517cb29e0d7da55c0c09f9662c3efb3caaf079d64054a127b3","schema_version":"1.0","event_id":"sha256:ea367cf3298165517cb29e0d7da55c0c09f9662c3efb3caaf079d64054a127b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/bundle.json","state_url":"https://pith.science/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/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-25T22:05:38Z","links":{"resolver":"https://pith.science/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2","bundle":"https://pith.science/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/bundle.json","state":"https://pith.science/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6VDLUE5M3YQG7HJIDPF5MA3P2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J6VDLUE5M3YQG7HJIDPF5MA3P2","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":"1aea33f5807933dd8bcc4b6e6a1741979dc9e94465b4bdc6f47a9da3a781392f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T15:33:35Z","title_canon_sha256":"1d49f2292c05b4090dee43cedddb80ebac49ab507a3073f4d654365b91181ac6"},"schema_version":"1.0","source":{"id":"1402.2967","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2967","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2967v3","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2967","created_at":"2026-05-18T02:20:10Z"},{"alias_kind":"pith_short_12","alias_value":"J6VDLUE5M3YQ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6VDLUE5M3YQG7HJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6VDLUE5","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:ea367cf3298165517cb29e0d7da55c0c09f9662c3efb3caaf079d64054a127b3","target":"graph","created_at":"2026-05-18T02:20:10Z","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 present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve performance by avoiding an exhaustive exploration of the state space. Our framework focuses on probabilistic reachability, which is a core property for verification, and is illustrated through two distinct instantiations. The first assumes that full knowledge of the MDP is available, and performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. ","authors_text":"David Parker, Jan K\\v{r}et\\'insk\\'y, Krishnendu Chatterjee, Marta Kwiatkowska, Martin Chmel\\'ik, Mateusz Ujma, Tom\\'a\\v{s} Br\\'azdil, Vojt\\v{e}ch Forejt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T15:33:35Z","title":"Verification of Markov Decision Processes using Learning Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2967","kind":"arxiv","version":3},"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:add19db1b8828a9a9aa1a505ad32aa05f697a531b459036621e194215ca8e15f","target":"record","created_at":"2026-05-18T02:20:10Z","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":"1aea33f5807933dd8bcc4b6e6a1741979dc9e94465b4bdc6f47a9da3a781392f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-10T15:33:35Z","title_canon_sha256":"1d49f2292c05b4090dee43cedddb80ebac49ab507a3073f4d654365b91181ac6"},"schema_version":"1.0","source":{"id":"1402.2967","kind":"arxiv","version":3}},"canonical_sha256":"4faa35d09d66f1037ce940de5eb01b7ea4ceff79d550510c2ee1e3ecf9f787d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4faa35d09d66f1037ce940de5eb01b7ea4ceff79d550510c2ee1e3ecf9f787d3","first_computed_at":"2026-05-18T02:20:10.585442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:10.585442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ia8IgNOqX2+ht7b5cSVCyaptu3nDzJ9+EPuu/mfnEUbI/xqYy/rwFuXaQlAYAurvVpl2ojsN+lK+MJf8OBQxAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:10.586130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2967","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:add19db1b8828a9a9aa1a505ad32aa05f697a531b459036621e194215ca8e15f","sha256:ea367cf3298165517cb29e0d7da55c0c09f9662c3efb3caaf079d64054a127b3"],"state_sha256":"c77a08bf3ab29b2ac12593b1995b91cb93cf0352755676cd2565bf926716f098"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zy7ryQhk5BPJDjJNfRfDNPFsk6+v33L+JO6igzz3d9BDriahupwRmgo9Cffn5S/MGltE3i4YNJEbXymtwhl1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:05:38.042224Z","bundle_sha256":"248e3b54872045ec2de648d94ce74b2ee3ac62f95380c82d111fd0cfb117147a"}}