{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ODDNRQQFIIVTX5O33GNSVGXVMN","short_pith_number":"pith:ODDNRQQF","schema_version":"1.0","canonical_sha256":"70c6d8c205422b3bf5dbd99b2a9af56340b58cbc1ffb3da773934016877a7427","source":{"kind":"arxiv","id":"1310.4953","version":1},"attestation_state":"computed","paper":{"title":"Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marianne Akian, St\\'ephane Gaubert","submitted_at":"2013-10-18T08:54:52Z","abstract_excerpt":"Recent results of Ye and Hansen, Miltersen and Zwick show that policy iteration for one or two player (perfect information) zero-sum stochastic games, restricted to instances with a fixed discount rate, is strongly polynomial. We show that policy iteration for mean-payoff zero-sum stochastic games is also strongly polynomial when restricted to instances with bounded first mean return time to a given state. The proof is based on methods of nonlinear Perron-Frobenius theory, allowing us to reduce the mean-payoff problem to a discounted problem with state dependent discount rate. Our analysis als"},"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":"1310.4953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-18T08:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"c8be08992d20e86c1750340eeaac7ee6d61b627cc97a022f631ffff5652d4242","abstract_canon_sha256":"793d35834cc7d02553b32f6e9c5957b4905d487250f3d75bcfdb57ffa53cbf4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:01.779030Z","signature_b64":"gMWBBbMzNVjft2e1wrsyEcm6i7z/ZkD87Kbu7S56EKG+29oxIPU2CfGi8f82p2AG+KBdjzLnlgtRj53R3xukDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70c6d8c205422b3bf5dbd99b2a9af56340b58cbc1ffb3da773934016877a7427","last_reissued_at":"2026-05-18T03:10:01.778111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:01.778111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Policy iteration for perfect information stochastic mean payoff games with bounded first return times is strongly polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marianne Akian, St\\'ephane Gaubert","submitted_at":"2013-10-18T08:54:52Z","abstract_excerpt":"Recent results of Ye and Hansen, Miltersen and Zwick show that policy iteration for one or two player (perfect information) zero-sum stochastic games, restricted to instances with a fixed discount rate, is strongly polynomial. We show that policy iteration for mean-payoff zero-sum stochastic games is also strongly polynomial when restricted to instances with bounded first mean return time to a given state. The proof is based on methods of nonlinear Perron-Frobenius theory, allowing us to reduce the mean-payoff problem to a discounted problem with state dependent discount rate. Our analysis als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4953","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":"1310.4953","created_at":"2026-05-18T03:10:01.778242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4953v1","created_at":"2026-05-18T03:10:01.778242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4953","created_at":"2026-05-18T03:10:01.778242+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODDNRQQFIIVT","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODDNRQQFIIVTX5O3","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODDNRQQF","created_at":"2026-05-18T12:27:54.935989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18545","citing_title":"Thresholds for sensitive optimality and Blackwell optimality in stochastic games","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN","json":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN.json","graph_json":"https://pith.science/api/pith-number/ODDNRQQFIIVTX5O33GNSVGXVMN/graph.json","events_json":"https://pith.science/api/pith-number/ODDNRQQFIIVTX5O33GNSVGXVMN/events.json","paper":"https://pith.science/paper/ODDNRQQF"},"agent_actions":{"view_html":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN","download_json":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN.json","view_paper":"https://pith.science/paper/ODDNRQQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4953&json=true","fetch_graph":"https://pith.science/api/pith-number/ODDNRQQFIIVTX5O33GNSVGXVMN/graph.json","fetch_events":"https://pith.science/api/pith-number/ODDNRQQFIIVTX5O33GNSVGXVMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN/action/storage_attestation","attest_author":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN/action/author_attestation","sign_citation":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN/action/citation_signature","submit_replication":"https://pith.science/pith/ODDNRQQFIIVTX5O33GNSVGXVMN/action/replication_record"}},"created_at":"2026-05-18T03:10:01.778242+00:00","updated_at":"2026-05-18T03:10:01.778242+00:00"}