{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ZYFWEPHF2ORYQNMBKM2NG3X44E","short_pith_number":"pith:ZYFWEPHF","canonical_record":{"source":{"id":"0809.1465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-09-09T00:12:05Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ef56bd5fd40849ab995f2b6a0a448338a473c73b55e6bcc941a87d28d7751c59","abstract_canon_sha256":"d43da4c6d15b4b744f747f967ba4367ee3b1e88a2efa00dd4a024d209483d407"},"schema_version":"1.0"},"canonical_sha256":"ce0b623ce5d3a38835815334d36efce1336abe845fa52f6dae1cf4bc84fddd7b","source":{"kind":"arxiv","id":"0809.1465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.1465","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"0809.1465v1","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1465","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZYFWEPHF2ORY","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZYFWEPHF2ORYQNMB","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZYFWEPHF","created_at":"2026-07-04T15:14:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ZYFWEPHF2ORYQNMBKM2NG3X44E","target":"record","payload":{"canonical_record":{"source":{"id":"0809.1465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-09-09T00:12:05Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ef56bd5fd40849ab995f2b6a0a448338a473c73b55e6bcc941a87d28d7751c59","abstract_canon_sha256":"d43da4c6d15b4b744f747f967ba4367ee3b1e88a2efa00dd4a024d209483d407"},"schema_version":"1.0"},"canonical_sha256":"ce0b623ce5d3a38835815334d36efce1336abe845fa52f6dae1cf4bc84fddd7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:14:11.022908Z","signature_b64":"QjnWrWuqc1OxL47kqz9WrLlkyVLHETBN6Es7S3pC+ouR5ljwovzFmBbdylutzdi6AHw0UBvLioqdnuB6tfasBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0b623ce5d3a38835815334d36efce1336abe845fa52f6dae1cf4bc84fddd7b","last_reissued_at":"2026-07-04T15:14:11.022565Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:14:11.022565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0809.1465","source_version":1,"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-07-04T15:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZeW/b6mFbBF622ARqMSCtM0cWv1Z3atEoN/y46XWekK9G2PaOl5vXibewEa4GozoE+QKW7+bd0Q0o5b2i5mfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:23:41.626874Z"},"content_sha256":"aecf172a67d0d4d6950827dd5994c0c87297cd83413a9aa3b415b5b4c5e23528","schema_version":"1.0","event_id":"sha256:aecf172a67d0d4d6950827dd5994c0c87297cd83413a9aa3b415b5b4c5e23528"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ZYFWEPHF2ORYQNMBKM2NG3X44E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Systems with LimSup and LimInf Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Thomas A. Henzinger","submitted_at":"2008-09-09T00:12:05Z","abstract_excerpt":"We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the MDP. Using our result on MDPs, we show that turn-based stochastic games with limsup and liminf objectives can be solved in NP \\cap coNP."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1465","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0809.1465/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:14:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1Y7TdmejGuYDQdFnYZXOmujBs363kM6yEj4ypEdAbVzHLwq6tkQ4uEzT4UtTl2/M7iV4arDQe/TJeziP16ECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:23:41.627509Z"},"content_sha256":"af7dad71bd6edd1e585cf3f32dd77057e9cc47be9d28e01f26d3f5a534e86faa","schema_version":"1.0","event_id":"sha256:af7dad71bd6edd1e585cf3f32dd77057e9cc47be9d28e01f26d3f5a534e86faa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/bundle.json","state_url":"https://pith.science/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/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-08-06T13:23:41Z","links":{"resolver":"https://pith.science/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E","bundle":"https://pith.science/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/bundle.json","state":"https://pith.science/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYFWEPHF2ORYQNMBKM2NG3X44E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ZYFWEPHF2ORYQNMBKM2NG3X44E","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":"d43da4c6d15b4b744f747f967ba4367ee3b1e88a2efa00dd4a024d209483d407","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-09-09T00:12:05Z","title_canon_sha256":"ef56bd5fd40849ab995f2b6a0a448338a473c73b55e6bcc941a87d28d7751c59"},"schema_version":"1.0","source":{"id":"0809.1465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0809.1465","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"arxiv_version","alias_value":"0809.1465v1","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.1465","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZYFWEPHF2ORY","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_16","alias_value":"ZYFWEPHF2ORYQNMB","created_at":"2026-07-04T15:14:11Z"},{"alias_kind":"pith_short_8","alias_value":"ZYFWEPHF","created_at":"2026-07-04T15:14:11Z"}],"graph_snapshots":[{"event_id":"sha256:af7dad71bd6edd1e585cf3f32dd77057e9cc47be9d28e01f26d3f5a534e86faa","target":"graph","created_at":"2026-07-04T15:14:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0809.1465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give polynomial-time algorithms for computing the values of Markov decision processes (MDPs) with limsup and liminf objectives. A real-valued reward is assigned to each state, and the value of an infinite path in the MDP is the limsup (resp. liminf) of all rewards along the path. The value of an MDP is the maximal expected value of an infinite path that can be achieved by resolving the decisions of the MDP. Using our result on MDPs, we show that turn-based stochastic games with limsup and liminf objectives can be solved in NP \\cap coNP.","authors_text":"Krishnendu Chatterjee, Thomas A. Henzinger","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-09-09T00:12:05Z","title":"Probabilistic Systems with LimSup and LimInf Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.1465","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:aecf172a67d0d4d6950827dd5994c0c87297cd83413a9aa3b415b5b4c5e23528","target":"record","created_at":"2026-07-04T15:14:11Z","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":"d43da4c6d15b4b744f747f967ba4367ee3b1e88a2efa00dd4a024d209483d407","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2008-09-09T00:12:05Z","title_canon_sha256":"ef56bd5fd40849ab995f2b6a0a448338a473c73b55e6bcc941a87d28d7751c59"},"schema_version":"1.0","source":{"id":"0809.1465","kind":"arxiv","version":1}},"canonical_sha256":"ce0b623ce5d3a38835815334d36efce1336abe845fa52f6dae1cf4bc84fddd7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce0b623ce5d3a38835815334d36efce1336abe845fa52f6dae1cf4bc84fddd7b","first_computed_at":"2026-07-04T15:14:11.022565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:14:11.022565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QjnWrWuqc1OxL47kqz9WrLlkyVLHETBN6Es7S3pC+ouR5ljwovzFmBbdylutzdi6AHw0UBvLioqdnuB6tfasBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:14:11.022908Z","signed_message":"canonical_sha256_bytes"},"source_id":"0809.1465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aecf172a67d0d4d6950827dd5994c0c87297cd83413a9aa3b415b5b4c5e23528","sha256:af7dad71bd6edd1e585cf3f32dd77057e9cc47be9d28e01f26d3f5a534e86faa"],"state_sha256":"b415863de0c01eb5fc84f682006f3088f09b364f6b381ed1a7bc088a7550b894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lIoQiAO29vHMRg4GNavCLawLbvQbhiOVA78EkcPDh9/G+xiINwpBuEtyExaf7VQOf/ytUgMRShR/x+/d/QhPBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:23:41.632800Z","bundle_sha256":"6003369f1c0db32343b4cf8dbf920a1438e2496af6fa6e822d298e16c5b3d7c7"}}