{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2MWFU5W737XTYWJLCZIRFTVKM5","short_pith_number":"pith:2MWFU5W7","schema_version":"1.0","canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","source":{"kind":"arxiv","id":"1404.5734","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Ergodic Mean-payoff Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2014-04-23T08:12:19Z","abstract_excerpt":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and "},"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":"1404.5734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-23T08:12:19Z","cross_cats_sorted":[],"title_canon_sha256":"8ea65e847a3532c3748b135020fc07f1a9e18802753ff8a54d729f9edb89c011","abstract_canon_sha256":"844bb1473382577d08b427948ee8e8234a41eb4fac603d948aa7d975a266dde9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:28.062387Z","signature_b64":"jb48SAS4rpvPQxknIsfZuFyizdTkWz05WKuG6tuWbJyBnzlGp4i5K4JsvqmuiJ4y790tYj3/QMgUk6KVcMzqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","last_reissued_at":"2026-05-18T02:53:28.061710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:28.061710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Ergodic Mean-payoff Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2014-04-23T08:12:19Z","abstract_excerpt":"We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of ergodic games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic complexity questions have remained unresolved. Our main results for ergodic games are as follows: We establish (1) an optimal exponential bound on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5734","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":"1404.5734","created_at":"2026-05-18T02:53:28.061810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5734v1","created_at":"2026-05-18T02:53:28.061810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5734","created_at":"2026-05-18T02:53:28.061810+00:00"},{"alias_kind":"pith_short_12","alias_value":"2MWFU5W737XT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2MWFU5W737XTYWJL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2MWFU5W7","created_at":"2026-05-18T12:28:11.866339+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/2MWFU5W737XTYWJLCZIRFTVKM5","json":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5.json","graph_json":"https://pith.science/api/pith-number/2MWFU5W737XTYWJLCZIRFTVKM5/graph.json","events_json":"https://pith.science/api/pith-number/2MWFU5W737XTYWJLCZIRFTVKM5/events.json","paper":"https://pith.science/paper/2MWFU5W7"},"agent_actions":{"view_html":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5","download_json":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5.json","view_paper":"https://pith.science/paper/2MWFU5W7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5734&json=true","fetch_graph":"https://pith.science/api/pith-number/2MWFU5W737XTYWJLCZIRFTVKM5/graph.json","fetch_events":"https://pith.science/api/pith-number/2MWFU5W737XTYWJLCZIRFTVKM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/action/storage_attestation","attest_author":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/action/author_attestation","sign_citation":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/action/citation_signature","submit_replication":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/action/replication_record"}},"created_at":"2026-05-18T02:53:28.061810+00:00","updated_at":"2026-05-18T02:53:28.061810+00:00"}