{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RRZMANXNTY6YJE4WLDGJJRLG7Q","short_pith_number":"pith:RRZMANXN","schema_version":"1.0","canonical_sha256":"8c72c036ed9e3d84939658cc94c566fc1bd34c469fe5abfbf1be81a1160aba35","source":{"kind":"arxiv","id":"1508.03455","version":1},"attestation_state":"computed","paper":{"title":"A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games","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-14T10:04:00Z","abstract_excerpt":"We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real $\\epsilon$, let us call a stochastic game $\\epsilon$-ergodic, if its values from any two initial positions differ by at most $\\epsilon$. The proposed new algorithm outputs for every $\\epsilon>0$ in finite time either a pair of stationary strategies for the two players guaranteeing that the values from any initial positions are within an $\\epsilon$-range, or identifies two initial positions $u$ and $v$ and corresponding stationary strategies for the players p"},"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":"1508.03455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-08-14T10:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"ed5c47287c8ed3a2c4e7f388143be6d58f673c62f1467006f38656e6d995e00e","abstract_canon_sha256":"d9aefe905601e4d37bb7e467c0527000bf96f0b04e563d68a9961a1db83cc0fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:17.754997Z","signature_b64":"Qs3KheyfYGdDB46lAEZC1tLb3Bipmq0+uyNYS2I+BzZpT+PFwyQXIQWq6YbespGmOJEQWuW8V/OyAfzlq3+7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c72c036ed9e3d84939658cc94c566fc1bd34c469fe5abfbf1be81a1160aba35","last_reissued_at":"2026-05-18T01:35:17.754298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:17.754298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games","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-14T10:04:00Z","abstract_excerpt":"We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real $\\epsilon$, let us call a stochastic game $\\epsilon$-ergodic, if its values from any two initial positions differ by at most $\\epsilon$. The proposed new algorithm outputs for every $\\epsilon>0$ in finite time either a pair of stationary strategies for the two players guaranteeing that the values from any initial positions are within an $\\epsilon$-range, or identifies two initial positions $u$ and $v$ and corresponding stationary strategies for the players p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03455","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03455","created_at":"2026-05-18T01:35:17.754438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03455v1","created_at":"2026-05-18T01:35:17.754438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03455","created_at":"2026-05-18T01:35:17.754438+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRZMANXNTY6Y","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRZMANXNTY6YJE4W","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRZMANXN","created_at":"2026-05-18T12:29:39.896362+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/RRZMANXNTY6YJE4WLDGJJRLG7Q","json":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q.json","graph_json":"https://pith.science/api/pith-number/RRZMANXNTY6YJE4WLDGJJRLG7Q/graph.json","events_json":"https://pith.science/api/pith-number/RRZMANXNTY6YJE4WLDGJJRLG7Q/events.json","paper":"https://pith.science/paper/RRZMANXN"},"agent_actions":{"view_html":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q","download_json":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q.json","view_paper":"https://pith.science/paper/RRZMANXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03455&json=true","fetch_graph":"https://pith.science/api/pith-number/RRZMANXNTY6YJE4WLDGJJRLG7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RRZMANXNTY6YJE4WLDGJJRLG7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q/action/storage_attestation","attest_author":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q/action/author_attestation","sign_citation":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q/action/citation_signature","submit_replication":"https://pith.science/pith/RRZMANXNTY6YJE4WLDGJJRLG7Q/action/replication_record"}},"created_at":"2026-05-18T01:35:17.754438+00:00","updated_at":"2026-05-18T01:35:17.754438+00:00"}