{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XJTRYBAHKUTFMO5FWKPITTNQ2R","short_pith_number":"pith:XJTRYBAH","schema_version":"1.0","canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","source":{"kind":"arxiv","id":"1409.6690","version":2},"attestation_state":"computed","paper":{"title":"The Value 1 Problem Under Finite-memory Strategies for Concurrent 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-09-23T18:37:00Z","abstract_excerpt":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenev"},"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":"1409.6690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-23T18:37:00Z","cross_cats_sorted":[],"title_canon_sha256":"c31b00765a673ed3612c82793f3603a750b26c802aaa957cd1604b5952b947ce","abstract_canon_sha256":"453197bf5c41ad63c9cb17a65350788abb5668a11c35d77734b0a3f19cd390f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:18.245265Z","signature_b64":"gPfc2f/oR6vHnHtPmceJdHdVhoJiTL6tQgSKfN52r0X5HdfUwsX9EPfWCCo7sqkZs7XBHExRP9h9HnUe1OoMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","last_reissued_at":"2026-05-18T02:41:18.244835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:18.244835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Value 1 Problem Under Finite-memory Strategies for Concurrent 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-09-23T18:37:00Z","abstract_excerpt":"We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6690","kind":"arxiv","version":2},"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":"1409.6690","created_at":"2026-05-18T02:41:18.244898+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.6690v2","created_at":"2026-05-18T02:41:18.244898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6690","created_at":"2026-05-18T02:41:18.244898+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJTRYBAHKUTF","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJTRYBAHKUTFMO5F","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJTRYBAH","created_at":"2026-05-18T12:28:57.508820+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/XJTRYBAHKUTFMO5FWKPITTNQ2R","json":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R.json","graph_json":"https://pith.science/api/pith-number/XJTRYBAHKUTFMO5FWKPITTNQ2R/graph.json","events_json":"https://pith.science/api/pith-number/XJTRYBAHKUTFMO5FWKPITTNQ2R/events.json","paper":"https://pith.science/paper/XJTRYBAH"},"agent_actions":{"view_html":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R","download_json":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R.json","view_paper":"https://pith.science/paper/XJTRYBAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.6690&json=true","fetch_graph":"https://pith.science/api/pith-number/XJTRYBAHKUTFMO5FWKPITTNQ2R/graph.json","fetch_events":"https://pith.science/api/pith-number/XJTRYBAHKUTFMO5FWKPITTNQ2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/action/storage_attestation","attest_author":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/action/author_attestation","sign_citation":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/action/citation_signature","submit_replication":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/action/replication_record"}},"created_at":"2026-05-18T02:41:18.244898+00:00","updated_at":"2026-05-18T02:41:18.244898+00:00"}