{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CL6X62EOXWZVSLP44CUYA7D6MI","short_pith_number":"pith:CL6X62EO","canonical_record":{"source":{"id":"1508.03431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T07:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"20b868845e4a606121083f8464387ddd19118c9294a7be841603a03abf28cfc0","abstract_canon_sha256":"871023e10ec1c3cd9112c94565ee9e4c430da148bdf65155fac77cd6fb574a0c"},"schema_version":"1.0"},"canonical_sha256":"12fd7f688ebdb3592dfce0a9807c7e6200089c97bc6b051b498f551bb1f1c7aa","source":{"kind":"arxiv","id":"1508.03431","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03431","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03431v2","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03431","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"CL6X62EOXWZV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CL6X62EOXWZVSLP4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CL6X62EO","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CL6X62EOXWZVSLP44CUYA7D6MI","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T07:43:51Z","cross_cats_sorted":[],"title_canon_sha256":"20b868845e4a606121083f8464387ddd19118c9294a7be841603a03abf28cfc0","abstract_canon_sha256":"871023e10ec1c3cd9112c94565ee9e4c430da148bdf65155fac77cd6fb574a0c"},"schema_version":"1.0"},"canonical_sha256":"12fd7f688ebdb3592dfce0a9807c7e6200089c97bc6b051b498f551bb1f1c7aa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:01.445689Z","signature_b64":"40jUeT+YcTsH9S9JFCA4Bj0nFy8X/eHzUkcZ0ZFX018WM5zG8C8WzAu4FRhYJYz4ArJQdDVs1OcXljzdZU0yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12fd7f688ebdb3592dfce0a9807c7e6200089c97bc6b051b498f551bb1f1c7aa","last_reissued_at":"2026-05-18T00:48:01.445141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:01.445141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03431","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-18T00:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0g/uvifJbTXs/v7wDhPMnH+ZTC/dPiov/Rb4ovNvjvS9BuNuaS0JBfF/wVYtZnPotDZcj6GDcaqmYgx7s80Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:42:35.015227Z"},"content_sha256":"26ef3ddbd7082d7776d8fdb24109854473f65e554be2a72acb7619ddf77e5457","schema_version":"1.0","event_id":"sha256:26ef3ddbd7082d7776d8fdb24109854473f65e554be2a72acb7619ddf77e5457"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CL6X62EOXWZVSLP44CUYA7D6MI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Endre Boros, Kazuhisa Makino, Khaled Elbassioni, Vladimir Gurvich","submitted_at":"2015-08-14T07:43:51Z","abstract_excerpt":"We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph $G = (V, E)$, with local rewards $r: E \\to \\ZZ$, and three types of positions: black $V_B$, white $V_W$, and random $V_R$ forming a partition of $V$. It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, or not, even when $|V_R|=0$. In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability. In this paper, we show that BWR-games with a constant number of random positions can be solved in pseudo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03431","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-18T00:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a/8bfEJ2EIWS2HJ7ZW3ua/m9gBsLABXaOkbA5IPOlRyyVrEI+ARJa7nmIz2WNSsDK5PdAMs+ocp8K36ifQqgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:42:35.015591Z"},"content_sha256":"6db3fceeade1a18d759d6954da5367076415f67fe88b8beef9df42d10ab0dd9a","schema_version":"1.0","event_id":"sha256:6db3fceeade1a18d759d6954da5367076415f67fe88b8beef9df42d10ab0dd9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CL6X62EOXWZVSLP44CUYA7D6MI/bundle.json","state_url":"https://pith.science/pith/CL6X62EOXWZVSLP44CUYA7D6MI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CL6X62EOXWZVSLP44CUYA7D6MI/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-06-01T13:42:35Z","links":{"resolver":"https://pith.science/pith/CL6X62EOXWZVSLP44CUYA7D6MI","bundle":"https://pith.science/pith/CL6X62EOXWZVSLP44CUYA7D6MI/bundle.json","state":"https://pith.science/pith/CL6X62EOXWZVSLP44CUYA7D6MI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CL6X62EOXWZVSLP44CUYA7D6MI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CL6X62EOXWZVSLP44CUYA7D6MI","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":"871023e10ec1c3cd9112c94565ee9e4c430da148bdf65155fac77cd6fb574a0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T07:43:51Z","title_canon_sha256":"20b868845e4a606121083f8464387ddd19118c9294a7be841603a03abf28cfc0"},"schema_version":"1.0","source":{"id":"1508.03431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03431","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03431v2","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03431","created_at":"2026-05-18T00:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"CL6X62EOXWZV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CL6X62EOXWZVSLP4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CL6X62EO","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:6db3fceeade1a18d759d6954da5367076415f67fe88b8beef9df42d10ab0dd9a","target":"graph","created_at":"2026-05-18T00:48:01Z","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 two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph $G = (V, E)$, with local rewards $r: E \\to \\ZZ$, and three types of positions: black $V_B$, white $V_W$, and random $V_R$ forming a partition of $V$. It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, or not, even when $|V_R|=0$. In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability. In this paper, we show that BWR-games with a constant number of random positions can be solved in pseudo","authors_text":"Endre Boros, Kazuhisa Makino, Khaled Elbassioni, Vladimir Gurvich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T07:43:51Z","title":"A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03431","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:26ef3ddbd7082d7776d8fdb24109854473f65e554be2a72acb7619ddf77e5457","target":"record","created_at":"2026-05-18T00:48:01Z","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":"871023e10ec1c3cd9112c94565ee9e4c430da148bdf65155fac77cd6fb574a0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T07:43:51Z","title_canon_sha256":"20b868845e4a606121083f8464387ddd19118c9294a7be841603a03abf28cfc0"},"schema_version":"1.0","source":{"id":"1508.03431","kind":"arxiv","version":2}},"canonical_sha256":"12fd7f688ebdb3592dfce0a9807c7e6200089c97bc6b051b498f551bb1f1c7aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12fd7f688ebdb3592dfce0a9807c7e6200089c97bc6b051b498f551bb1f1c7aa","first_computed_at":"2026-05-18T00:48:01.445141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:01.445141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"40jUeT+YcTsH9S9JFCA4Bj0nFy8X/eHzUkcZ0ZFX018WM5zG8C8WzAu4FRhYJYz4ArJQdDVs1OcXljzdZU0yBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:01.445689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26ef3ddbd7082d7776d8fdb24109854473f65e554be2a72acb7619ddf77e5457","sha256:6db3fceeade1a18d759d6954da5367076415f67fe88b8beef9df42d10ab0dd9a"],"state_sha256":"dba2bd0584ae21dff74be4a1829efa60e17b549746a3180e67879ea7e4aa1584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYKIpSKPxYB2HfhlVTt0aHDDPVGfs9Ngk1Df0URJBb1DTwZwqzj+DW9QhdmPmwxf4z67f19hFKps0FKR5XzMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:42:35.017596Z","bundle_sha256":"2aa5a0d231b5e6cbc99461a8626a7c5806f696bbe64c3ef00dd01ca6d2baa692"}}