{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2MWFU5W737XTYWJLCZIRFTVKM5","short_pith_number":"pith:2MWFU5W7","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"},"canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","source":{"kind":"arxiv","id":"1404.5734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5734","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5734v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5734","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"2MWFU5W737XT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MWFU5W737XTYWJL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MWFU5W7","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2MWFU5W737XTYWJLCZIRFTVKM5","target":"record","payload":{"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"},"canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","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"},"source_kind":"arxiv","source_id":"1404.5734","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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57Iv5GtOJ9PUb5yLtDtC0nhCQU3MaFC3b4u0Q8jHFKpi+FW0SGTqXNZLmVKAbjz/9nqNrm7Cn7nN/Gdq/Y2SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:14.499495Z"},"content_sha256":"c772156279db98ce11a45de98b3dfa607a89066671a529326f55813588b5c31d","schema_version":"1.0","event_id":"sha256:c772156279db98ce11a45de98b3dfa607a89066671a529326f55813588b5c31d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2MWFU5W737XTYWJLCZIRFTVKM5","target":"graph","payload":{"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"},"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-18T02:53:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rGXyLv06mwoeww33JFVgAgTd/nBBlDu3Z2DL6xXu4JNDchhOA+jgbaxPR1xVqWlPOVSLINKqZIbyO77KR1+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:57:14.499928Z"},"content_sha256":"6ee7e585c1cfc867ecab378b0bcb26076706211df02479ae4d56b2ca6e8e7233","schema_version":"1.0","event_id":"sha256:6ee7e585c1cfc867ecab378b0bcb26076706211df02479ae4d56b2ca6e8e7233"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/bundle.json","state_url":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MWFU5W737XTYWJLCZIRFTVKM5/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-05-25T16:57:14Z","links":{"resolver":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5","bundle":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/bundle.json","state":"https://pith.science/pith/2MWFU5W737XTYWJLCZIRFTVKM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MWFU5W737XTYWJLCZIRFTVKM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2MWFU5W737XTYWJLCZIRFTVKM5","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":"844bb1473382577d08b427948ee8e8234a41eb4fac603d948aa7d975a266dde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-23T08:12:19Z","title_canon_sha256":"8ea65e847a3532c3748b135020fc07f1a9e18802753ff8a54d729f9edb89c011"},"schema_version":"1.0","source":{"id":"1404.5734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5734","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5734v1","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5734","created_at":"2026-05-18T02:53:28Z"},{"alias_kind":"pith_short_12","alias_value":"2MWFU5W737XT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2MWFU5W737XTYWJL","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2MWFU5W7","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:6ee7e585c1cfc867ecab378b0bcb26076706211df02479ae4d56b2ca6e8e7233","target":"graph","created_at":"2026-05-18T02:53:28Z","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 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 ","authors_text":"Krishnendu Chatterjee, Rasmus Ibsen-Jensen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-23T08:12:19Z","title":"The Complexity of Ergodic Mean-payoff Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5734","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:c772156279db98ce11a45de98b3dfa607a89066671a529326f55813588b5c31d","target":"record","created_at":"2026-05-18T02:53:28Z","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":"844bb1473382577d08b427948ee8e8234a41eb4fac603d948aa7d975a266dde9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-04-23T08:12:19Z","title_canon_sha256":"8ea65e847a3532c3748b135020fc07f1a9e18802753ff8a54d729f9edb89c011"},"schema_version":"1.0","source":{"id":"1404.5734","kind":"arxiv","version":1}},"canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d32c5a76dfdfef3c592b165112ceaa6765dfb786462f46b9d88c71b9b5028b3c","first_computed_at":"2026-05-18T02:53:28.061710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:28.061710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jb48SAS4rpvPQxknIsfZuFyizdTkWz05WKuG6tuWbJyBnzlGp4i5K4JsvqmuiJ4y790tYj3/QMgUk6KVcMzqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:28.062387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c772156279db98ce11a45de98b3dfa607a89066671a529326f55813588b5c31d","sha256:6ee7e585c1cfc867ecab378b0bcb26076706211df02479ae4d56b2ca6e8e7233"],"state_sha256":"861ac4354957d9a827f521df200c41ce3e3da11691959cdd22a582081a4db2a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ITVLQq6ixH77iot0ujJtWj4ERBYYnBRCoXdaKx9+WgR3AOXx4qRZnO2blCapZXNikhSutfLHR+8eL7GRrglCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:57:14.502943Z","bundle_sha256":"e7d48c4277f829fa93c2097a8088a25573ac88524c7cfa1c5a0ce10bf90f47ea"}}