{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IIF77HLPJDWLICHE4MOJ37PE64","short_pith_number":"pith:IIF77HLP","schema_version":"1.0","canonical_sha256":"420bff9d6f48ecb408e4e31c9dfde4f72f27b2a2eeaa59177df504c1bd9b7c78","source":{"kind":"arxiv","id":"1409.5306","version":1},"attestation_state":"computed","paper":{"title":"Qualitative Analysis of 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-18T14:12:13Z","abstract_excerpt":"We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a fundamental objective, namely, mean-payoff objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite. The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or qua"},"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.5306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-18T14:12:13Z","cross_cats_sorted":[],"title_canon_sha256":"3bdd477dbd72522f0cfbc3efdf740d4828fc6fb71c122cb7a3604b2710ac74e0","abstract_canon_sha256":"02e23d0307f858bc01db25ba0fbd939b18fe2d8840ab7a5ce83f7edcdd556dd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:29.925138Z","signature_b64":"JERFtp1Dlsx4TY8obwl4DoIGXiPZ4IqRpXlw5iu9NlivBM+/CYPJveX3JaSrIYQKgW36DFUMcHx0agUpYSoUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"420bff9d6f48ecb408e4e31c9dfde4f72f27b2a2eeaa59177df504c1bd9b7c78","last_reissued_at":"2026-05-18T02:42:29.924344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:29.924344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qualitative Analysis of 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-18T14:12:13Z","abstract_excerpt":"We consider concurrent games played by two-players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study a fundamental objective, namely, mean-payoff objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite. The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5306","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":"1409.5306","created_at":"2026-05-18T02:42:29.924472+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5306v1","created_at":"2026-05-18T02:42:29.924472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5306","created_at":"2026-05-18T02:42:29.924472+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIF77HLPJDWL","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIF77HLPJDWLICHE","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIF77HLP","created_at":"2026-05-18T12:28:33.132498+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/IIF77HLPJDWLICHE4MOJ37PE64","json":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64.json","graph_json":"https://pith.science/api/pith-number/IIF77HLPJDWLICHE4MOJ37PE64/graph.json","events_json":"https://pith.science/api/pith-number/IIF77HLPJDWLICHE4MOJ37PE64/events.json","paper":"https://pith.science/paper/IIF77HLP"},"agent_actions":{"view_html":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64","download_json":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64.json","view_paper":"https://pith.science/paper/IIF77HLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5306&json=true","fetch_graph":"https://pith.science/api/pith-number/IIF77HLPJDWLICHE4MOJ37PE64/graph.json","fetch_events":"https://pith.science/api/pith-number/IIF77HLPJDWLICHE4MOJ37PE64/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64/action/storage_attestation","attest_author":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64/action/author_attestation","sign_citation":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64/action/citation_signature","submit_replication":"https://pith.science/pith/IIF77HLPJDWLICHE4MOJ37PE64/action/replication_record"}},"created_at":"2026-05-18T02:42:29.924472+00:00","updated_at":"2026-05-18T02:42:29.924472+00:00"}