{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UNRCED4U24PP5COMM5IKGJH46K","short_pith_number":"pith:UNRCED4U","schema_version":"1.0","canonical_sha256":"a362220f94d71efe89cc6750a324fcf2ba87478bb4ee43ec10489e4e43e8496f","source":{"kind":"arxiv","id":"1202.4175","version":4},"attestation_state":"computed","paper":{"title":"Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B\\\"uchi Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah","submitted_at":"2012-02-19T18:22:02Z","abstract_excerpt":"We consider Markov decision processes (MDPs) with $\\omega$-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for B\\\"uchi objectives (a special case of parity objectives). We study for the first time the average case complexity of the classical algorithm for computing almost-sure winning vertices for MDPs with B"},"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":"1202.4175","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-02-19T18:22:02Z","cross_cats_sorted":[],"title_canon_sha256":"707999cb1921a1740cdad3a6464b32fea3d445828f24b78455bec78c668dd93c","abstract_canon_sha256":"c34a34eff57d3293f9ad8486415f840a1a0861ff92c369e120179aeb1136ce3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:45.241031Z","signature_b64":"U2ZfrI5Qj+eWOeGdOOX8Dw7fPGK3VLkiHUF877TcCEkrpq1nE3VIOuayEd9qpSvne1PciMkPrIqhn3IZXsSiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a362220f94d71efe89cc6750a324fcf2ba87478bb4ee43ec10489e4e43e8496f","last_reissued_at":"2026-05-18T02:34:45.240570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:45.240570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B\\\"uchi Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah","submitted_at":"2012-02-19T18:22:02Z","abstract_excerpt":"We consider Markov decision processes (MDPs) with $\\omega$-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for B\\\"uchi objectives (a special case of parity objectives). We study for the first time the average case complexity of the classical algorithm for computing almost-sure winning vertices for MDPs with B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4175","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":"1202.4175","created_at":"2026-05-18T02:34:45.240634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4175v4","created_at":"2026-05-18T02:34:45.240634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4175","created_at":"2026-05-18T02:34:45.240634+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNRCED4U24PP","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNRCED4U24PP5COM","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNRCED4U","created_at":"2026-05-18T12:27:23.164592+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/UNRCED4U24PP5COMM5IKGJH46K","json":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K.json","graph_json":"https://pith.science/api/pith-number/UNRCED4U24PP5COMM5IKGJH46K/graph.json","events_json":"https://pith.science/api/pith-number/UNRCED4U24PP5COMM5IKGJH46K/events.json","paper":"https://pith.science/paper/UNRCED4U"},"agent_actions":{"view_html":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K","download_json":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K.json","view_paper":"https://pith.science/paper/UNRCED4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4175&json=true","fetch_graph":"https://pith.science/api/pith-number/UNRCED4U24PP5COMM5IKGJH46K/graph.json","fetch_events":"https://pith.science/api/pith-number/UNRCED4U24PP5COMM5IKGJH46K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K/action/storage_attestation","attest_author":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K/action/author_attestation","sign_citation":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K/action/citation_signature","submit_replication":"https://pith.science/pith/UNRCED4U24PP5COMM5IKGJH46K/action/replication_record"}},"created_at":"2026-05-18T02:34:45.240634+00:00","updated_at":"2026-05-18T02:34:45.240634+00:00"}