{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AHJ4MFSAKDDZZAVELM5J47PO2W","short_pith_number":"pith:AHJ4MFSA","canonical_record":{"source":{"id":"1104.3348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-17T20:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"0d84610721572e12ec49ce2fe933f2f2f776aa90fa7b5b22c6575e14d3a05e8f","abstract_canon_sha256":"0949983bf965f4ad8dfc43ec33a35867248dfa09d687985bf9e3e963ef0b2c77"},"schema_version":"1.0"},"canonical_sha256":"01d3c6164050c79c82a45b3a9e7deed5926ab59e936069ce728507492bd468e0","source":{"kind":"arxiv","id":"1104.3348","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3348","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3348v2","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3348","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"AHJ4MFSAKDDZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHJ4MFSAKDDZZAVE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHJ4MFSA","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AHJ4MFSAKDDZZAVELM5J47PO2W","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3348","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-17T20:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"0d84610721572e12ec49ce2fe933f2f2f776aa90fa7b5b22c6575e14d3a05e8f","abstract_canon_sha256":"0949983bf965f4ad8dfc43ec33a35867248dfa09d687985bf9e3e963ef0b2c77"},"schema_version":"1.0"},"canonical_sha256":"01d3c6164050c79c82a45b3a9e7deed5926ab59e936069ce728507492bd468e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:45.278675Z","signature_b64":"5zn6Ee6Yg92ctjda/G9Ts1W+Mxb7qLO/g4po1uaKcH+jM3eZgTw1I5JNctG3koVYN0FNwZUgUWT9II0A5teQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d3c6164050c79c82a45b3a9e7deed5926ab59e936069ce728507492bd468e0","last_reissued_at":"2026-05-18T02:34:45.278246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:45.278246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3348","source_version":2,"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:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AF/maMXYCnZNzuQcO+rw3SD9Nl4MBX9/wTRc91SQj9ltQCyUp5rn05gW5myxeW+78rBtYOBhDaqnEH1eiODdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:48.172748Z"},"content_sha256":"b2081df9deb6d2734bfa1eff8ab5bb6a24163d776fa8c7cbf9648aa5d74aaf95","schema_version":"1.0","event_id":"sha256:b2081df9deb6d2734bfa1eff8ab5bb6a24163d776fa8c7cbf9648aa5d74aaf95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AHJ4MFSAKDDZZAVELM5J47PO2W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\\\"uchi Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Manas Joglekar, Monika Henzinger, Nisarg Shah","submitted_at":"2011-04-17T20:47:42Z","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 states 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). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3348","kind":"arxiv","version":2},"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:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aK2Dc4GnlNgl+MzRJknNeJOfgRjvuJ09i125ptvGUPYri62dk+dKhaxn2LIIbB6qWNOvEq8tkPlU04bgVyWRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:35:48.173195Z"},"content_sha256":"68cbb8c06ef5f69199fd9c1f6b5d4362b802dd33182763ec09d8c87962f9bb46","schema_version":"1.0","event_id":"sha256:68cbb8c06ef5f69199fd9c1f6b5d4362b802dd33182763ec09d8c87962f9bb46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/bundle.json","state_url":"https://pith.science/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/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-25T16:35:48Z","links":{"resolver":"https://pith.science/pith/AHJ4MFSAKDDZZAVELM5J47PO2W","bundle":"https://pith.science/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/bundle.json","state":"https://pith.science/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHJ4MFSAKDDZZAVELM5J47PO2W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AHJ4MFSAKDDZZAVELM5J47PO2W","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":"0949983bf965f4ad8dfc43ec33a35867248dfa09d687985bf9e3e963ef0b2c77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-17T20:47:42Z","title_canon_sha256":"0d84610721572e12ec49ce2fe933f2f2f776aa90fa7b5b22c6575e14d3a05e8f"},"schema_version":"1.0","source":{"id":"1104.3348","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3348","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3348v2","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3348","created_at":"2026-05-18T02:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"AHJ4MFSAKDDZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AHJ4MFSAKDDZZAVE","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AHJ4MFSA","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:68cbb8c06ef5f69199fd9c1f6b5d4362b802dd33182763ec09d8c87962f9bb46","target":"graph","created_at":"2026-05-18T02:34:45Z","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 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 states 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). Our contributions are as follows: First, we present the first subquadratic symbolic algorithm to compute the almost-sure winning set for MDPs wit","authors_text":"Krishnendu Chatterjee, Manas Joglekar, Monika Henzinger, Nisarg Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-17T20:47:42Z","title":"Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\\\"uchi Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3348","kind":"arxiv","version":2},"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:b2081df9deb6d2734bfa1eff8ab5bb6a24163d776fa8c7cbf9648aa5d74aaf95","target":"record","created_at":"2026-05-18T02:34:45Z","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":"0949983bf965f4ad8dfc43ec33a35867248dfa09d687985bf9e3e963ef0b2c77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-04-17T20:47:42Z","title_canon_sha256":"0d84610721572e12ec49ce2fe933f2f2f776aa90fa7b5b22c6575e14d3a05e8f"},"schema_version":"1.0","source":{"id":"1104.3348","kind":"arxiv","version":2}},"canonical_sha256":"01d3c6164050c79c82a45b3a9e7deed5926ab59e936069ce728507492bd468e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01d3c6164050c79c82a45b3a9e7deed5926ab59e936069ce728507492bd468e0","first_computed_at":"2026-05-18T02:34:45.278246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:45.278246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zn6Ee6Yg92ctjda/G9Ts1W+Mxb7qLO/g4po1uaKcH+jM3eZgTw1I5JNctG3koVYN0FNwZUgUWT9II0A5teQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:45.278675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3348","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2081df9deb6d2734bfa1eff8ab5bb6a24163d776fa8c7cbf9648aa5d74aaf95","sha256:68cbb8c06ef5f69199fd9c1f6b5d4362b802dd33182763ec09d8c87962f9bb46"],"state_sha256":"7d5b885f4ce5272df6ccc7ef6562845597043056d55ca8f98b848df055f23159"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgYU7LvC8dfGoApzdN47wN1IMxP7SajEo0ViAn8Slc1KZSDhIVMpYjK3e9OQghfJ8od3jxGr/nTh5dMCdCuTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:35:48.176441Z","bundle_sha256":"6ef54f391ce33aca77a30592795b8b4c4c96fda6e0bb5f9ca7a644f96757f77d"}}