{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R7VN6GBZWH3UJMMBMBUN2BOR6L","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":"b4a80f6612ece0bce3aaba0c586f8fd7731429b69be5e5c2e55b24428c3cbc6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T13:31:02Z","title_canon_sha256":"077e090be994c6178d9cff506323701c1af96e7e4ae35ee14b20fbbaa23ff7b3"},"schema_version":"1.0","source":{"id":"1809.03299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03299","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03299v1","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03299","created_at":"2026-05-18T00:06:09Z"},{"alias_kind":"pith_short_12","alias_value":"R7VN6GBZWH3U","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R7VN6GBZWH3UJMMB","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R7VN6GBZ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:74c60ad18675eb6f8f0bb3bd60f0b15cba8b31fe7b24ac6dd1efa4516fda83bf","target":"graph","created_at":"2026-05-18T00:06:09Z","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":"The maximum reachability probabilities in a Markov decision process can be computed using value iteration (VI). Recently, simulation-based heuristic extensions of VI have been introduced, such as bounded real-time dynamic programming (BRTDP), which often manage to avoid explicit analysis of the whole state space while preserving guarantees on the computed result. In this paper, we introduce a new class of such heuristics, based on Monte Carlo tree search (MCTS), a technique celebrated in various machine-learning settings. We provide a spectrum of algorithms ranging from MCTS to BRTDP. We evalu","authors_text":"Jan K\\v{r}et\\'insk\\'y, Ond\\v{r}ej Sl\\'ame\\v{c}ka, Pranav Ashok, Tom\\'a\\v{s} Br\\'azdil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T13:31:02Z","title":"Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03299","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:4216fb13242dac72c353da06d826b916c06bf0650b68cccebdfe3b91beaa42ee","target":"record","created_at":"2026-05-18T00:06:09Z","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":"b4a80f6612ece0bce3aaba0c586f8fd7731429b69be5e5c2e55b24428c3cbc6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T13:31:02Z","title_canon_sha256":"077e090be994c6178d9cff506323701c1af96e7e4ae35ee14b20fbbaa23ff7b3"},"schema_version":"1.0","source":{"id":"1809.03299","kind":"arxiv","version":1}},"canonical_sha256":"8feadf1839b1f744b1816068dd05d1f2d002f90d1417f42c5ad1f98fec061e90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8feadf1839b1f744b1816068dd05d1f2d002f90d1417f42c5ad1f98fec061e90","first_computed_at":"2026-05-18T00:06:09.296468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:09.296468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vaJvCFScb1Nuf292iTPODx0WsJB+F6SLf+gVtSPfA5RD46S81NGmEeYlpQsuI825phlLaA2yGgiEh+SOom/xAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:09.297175Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4216fb13242dac72c353da06d826b916c06bf0650b68cccebdfe3b91beaa42ee","sha256:74c60ad18675eb6f8f0bb3bd60f0b15cba8b31fe7b24ac6dd1efa4516fda83bf"],"state_sha256":"bd81ce74de9dceb8b44efadf18fe63b4f11ad23ff8f97d0dbee7524eaae1abdb"}