{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6DK6QL35DCVUBLMXEXSJ5ZV5ZA","short_pith_number":"pith:6DK6QL35","schema_version":"1.0","canonical_sha256":"f0d5e82f7d18ab40ad9725e49ee6bdc83882868f9753487fe861872af2cdc931","source":{"kind":"arxiv","id":"1410.5782","version":3},"attestation_state":"computed","paper":{"title":"Lightweight Monte Carlo Verification of Markov Decision Processes with Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Axel Legay, Louis-Marie Traonouez, Sean Sedwards","submitted_at":"2014-10-20T05:56:26Z","abstract_excerpt":"Markov decision processes are useful models of concurrency optimisation problems, but are often intractable for exhaustive verification methods. Recent work has introduced lightweight approximative techniques that sample directly from scheduler space, bringing the prospect of scalable alternatives to standard numerical model checking algorithms. The focus so far has been on optimising the probability of a property, but many problems require quantitative analysis of rewards. In this work we therefore present lightweight statistical model checking algorithms to optimise the rewards of Markov dec"},"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":"1410.5782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-20T05:56:26Z","cross_cats_sorted":[],"title_canon_sha256":"687b4c0a088f97a1e658b4335703f084f6bb7f8c825ed6266b7958e3a38c3575","abstract_canon_sha256":"b7bdcc97ebc7464f5fcc30eef2474aa9ff964f0de968f385584de77db1edc6c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:39.881507Z","signature_b64":"siMneWTEXf+jO2hZCbjxlwAbiLRxazTiKL9bkeLdfF5bD9/ys1omrErWh2pmjicCV5OgqqmdfpIta4zLdg1pBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0d5e82f7d18ab40ad9725e49ee6bdc83882868f9753487fe861872af2cdc931","last_reissued_at":"2026-05-18T02:20:39.880775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:39.880775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lightweight Monte Carlo Verification of Markov Decision Processes with Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Axel Legay, Louis-Marie Traonouez, Sean Sedwards","submitted_at":"2014-10-20T05:56:26Z","abstract_excerpt":"Markov decision processes are useful models of concurrency optimisation problems, but are often intractable for exhaustive verification methods. Recent work has introduced lightweight approximative techniques that sample directly from scheduler space, bringing the prospect of scalable alternatives to standard numerical model checking algorithms. The focus so far has been on optimising the probability of a property, but many problems require quantitative analysis of rewards. In this work we therefore present lightweight statistical model checking algorithms to optimise the rewards of Markov dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5782","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.5782","created_at":"2026-05-18T02:20:39.880881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.5782v3","created_at":"2026-05-18T02:20:39.880881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5782","created_at":"2026-05-18T02:20:39.880881+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DK6QL35DCVU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DK6QL35DCVUBLMX","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DK6QL35","created_at":"2026-05-18T12:28:16.859392+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/6DK6QL35DCVUBLMXEXSJ5ZV5ZA","json":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA.json","graph_json":"https://pith.science/api/pith-number/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/graph.json","events_json":"https://pith.science/api/pith-number/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/events.json","paper":"https://pith.science/paper/6DK6QL35"},"agent_actions":{"view_html":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA","download_json":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA.json","view_paper":"https://pith.science/paper/6DK6QL35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.5782&json=true","fetch_graph":"https://pith.science/api/pith-number/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/graph.json","fetch_events":"https://pith.science/api/pith-number/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/action/storage_attestation","attest_author":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/action/author_attestation","sign_citation":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/action/citation_signature","submit_replication":"https://pith.science/pith/6DK6QL35DCVUBLMXEXSJ5ZV5ZA/action/replication_record"}},"created_at":"2026-05-18T02:20:39.880881+00:00","updated_at":"2026-05-18T02:20:39.880881+00:00"}