{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XGVZPES5A5HNTOQJLWMDVRUEMV","short_pith_number":"pith:XGVZPES5","canonical_record":{"source":{"id":"1610.06681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T06:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"b6d835807c23f6518821a10ee025cca1ef792d17732c852f3886e1292e434b1c","abstract_canon_sha256":"5085c52a6f5594c825bbe5247f71a761f79b25a03569bba340659f8189933005"},"schema_version":"1.0"},"canonical_sha256":"b9ab97925d074ed9ba095d983ac6846543e76a2ea442dbb3179fec893daab161","source":{"kind":"arxiv","id":"1610.06681","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06681","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06681v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06681","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"XGVZPES5A5HN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XGVZPES5A5HNTOQJ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XGVZPES5","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XGVZPES5A5HNTOQJLWMDVRUEMV","target":"record","payload":{"canonical_record":{"source":{"id":"1610.06681","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T06:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"b6d835807c23f6518821a10ee025cca1ef792d17732c852f3886e1292e434b1c","abstract_canon_sha256":"5085c52a6f5594c825bbe5247f71a761f79b25a03569bba340659f8189933005"},"schema_version":"1.0"},"canonical_sha256":"b9ab97925d074ed9ba095d983ac6846543e76a2ea442dbb3179fec893daab161","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.982997Z","signature_b64":"CeQHv+iSTd0/wegyZRrDJrZam/O8prOS5457g8uLXdfZmblVeQUCQzSzZW+0XjG9sqdvBfelKI3ynGzhGov7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ab97925d074ed9ba095d983ac6846543e76a2ea442dbb3179fec893daab161","last_reissued_at":"2026-05-18T01:01:36.982463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.982463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.06681","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-05-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFOPKSTEBh9JDlRwMLJVZk8daIgq/Q1HkRWPmN+QuyzQWp3iuZxorhUEZcCIZGzmqlT7klkNrLJPuPWUXi7EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:04:27.971275Z"},"content_sha256":"b010d23445d0a4892b2f638498f17f4f33dfe34e4bfae4389b7d9dcc89a35007","schema_version":"1.0","event_id":"sha256:b010d23445d0a4892b2f638498f17f4f33dfe34e4bfae4389b7d9dcc89a35007"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XGVZPES5A5HNTOQJLWMDVRUEMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Endre Boros, Kazuhisa Makino, Khaled Elbassioni, Vladimir Gurvich","submitted_at":"2016-10-21T06:51: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, even when $|V_R|=0$. In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability. In this short note, we show that BWR-games can be solved via convex programming in pseudo-polynomial time if the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06681","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":""},"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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hCjVNem/rPhiHFjIea5JAEcXFjrY/fMx2OcHsvdHWQh7pqh5smhbY4Da+PevkHyN19l9wTrYHl8mbRWOPRvSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:04:27.971896Z"},"content_sha256":"f8f5c348fd0ef00bbf47d49054218114e82a461290b24916f66e674de39a46f0","schema_version":"1.0","event_id":"sha256:f8f5c348fd0ef00bbf47d49054218114e82a461290b24916f66e674de39a46f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/bundle.json","state_url":"https://pith.science/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/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-01T03:04:27Z","links":{"resolver":"https://pith.science/pith/XGVZPES5A5HNTOQJLWMDVRUEMV","bundle":"https://pith.science/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/bundle.json","state":"https://pith.science/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGVZPES5A5HNTOQJLWMDVRUEMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XGVZPES5A5HNTOQJLWMDVRUEMV","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":"5085c52a6f5594c825bbe5247f71a761f79b25a03569bba340659f8189933005","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T06:51:51Z","title_canon_sha256":"b6d835807c23f6518821a10ee025cca1ef792d17732c852f3886e1292e434b1c"},"schema_version":"1.0","source":{"id":"1610.06681","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.06681","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1610.06681v1","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06681","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"XGVZPES5A5HN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XGVZPES5A5HNTOQJ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XGVZPES5","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:f8f5c348fd0ef00bbf47d49054218114e82a461290b24916f66e674de39a46f0","target":"graph","created_at":"2026-05-18T01:01:36Z","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, even when $|V_R|=0$. In fact, a pseudo-polynomial algorithm for BWR-games would already imply their polynomial solvability. In this short note, we show that BWR-games can be solved via convex programming in pseudo-polynomial time if the","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.DS","submitted_at":"2016-10-21T06:51:51Z","title":"A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06681","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:b010d23445d0a4892b2f638498f17f4f33dfe34e4bfae4389b7d9dcc89a35007","target":"record","created_at":"2026-05-18T01:01:36Z","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":"5085c52a6f5594c825bbe5247f71a761f79b25a03569bba340659f8189933005","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-21T06:51:51Z","title_canon_sha256":"b6d835807c23f6518821a10ee025cca1ef792d17732c852f3886e1292e434b1c"},"schema_version":"1.0","source":{"id":"1610.06681","kind":"arxiv","version":1}},"canonical_sha256":"b9ab97925d074ed9ba095d983ac6846543e76a2ea442dbb3179fec893daab161","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9ab97925d074ed9ba095d983ac6846543e76a2ea442dbb3179fec893daab161","first_computed_at":"2026-05-18T01:01:36.982463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.982463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CeQHv+iSTd0/wegyZRrDJrZam/O8prOS5457g8uLXdfZmblVeQUCQzSzZW+0XjG9sqdvBfelKI3ynGzhGov7Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.982997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.06681","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b010d23445d0a4892b2f638498f17f4f33dfe34e4bfae4389b7d9dcc89a35007","sha256:f8f5c348fd0ef00bbf47d49054218114e82a461290b24916f66e674de39a46f0"],"state_sha256":"4c0441b5b33a9dc0966dc9138a5791494f34d0b9ec6b29a418d285969c5d10ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nDOnGnYp4hyGl5X5Ry4+tGgDodL3pq7Gq7RXTOu+yHiaBpAHrlocKBaDYdfXjnUkpotFKtFZtNzXvvrLz5/XCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:04:27.974663Z","bundle_sha256":"db7f7192b2a00bd0e3a3719a2c44fe7bfc41d8a4cb4716dff6ad1498870aeda7"}}