{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XJTRYBAHKUTFMO5FWKPITTNQ2R","short_pith_number":"pith:XJTRYBAH","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"},"canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","source":{"kind":"arxiv","id":"1409.6690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6690","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6690v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6690","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"XJTRYBAHKUTF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XJTRYBAHKUTFMO5F","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XJTRYBAH","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XJTRYBAHKUTFMO5FWKPITTNQ2R","target":"record","payload":{"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"},"canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","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"},"source_kind":"arxiv","source_id":"1409.6690","source_version":2,"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:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VH4Nk7qMRd40eTbVkc6FR+K4OyeN3ZlfNvgE+WH440ApFIq8avxxJ6VRXGOxYOA+l/kk7gV7fu3+az0ra7EAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:13.473387Z"},"content_sha256":"b70dccf4c288c9d07b79614f88cd210e473ffd6caf7b49c68d068947c64d4d24","schema_version":"1.0","event_id":"sha256:b70dccf4c288c9d07b79614f88cd210e473ffd6caf7b49c68d068947c64d4d24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XJTRYBAHKUTFMO5FWKPITTNQ2R","target":"graph","payload":{"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"},"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:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N8W877dEriJ3/4IDs4+Yc0e9Ukk5/dYZDBtSPb7r2eiw2nmajgJ74vQ47zLE6ipnIKaZJvF/WmngqG8ElzGiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:13.474086Z"},"content_sha256":"35f29c22796bf1944bc307cb2c9cb670239e9c074644b233828c6ae4701e39c7","schema_version":"1.0","event_id":"sha256:35f29c22796bf1944bc307cb2c9cb670239e9c074644b233828c6ae4701e39c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/bundle.json","state_url":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/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:34:13Z","links":{"resolver":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R","bundle":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/bundle.json","state":"https://pith.science/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XJTRYBAHKUTFMO5FWKPITTNQ2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XJTRYBAHKUTFMO5FWKPITTNQ2R","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":"453197bf5c41ad63c9cb17a65350788abb5668a11c35d77734b0a3f19cd390f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-23T18:37:00Z","title_canon_sha256":"c31b00765a673ed3612c82793f3603a750b26c802aaa957cd1604b5952b947ce"},"schema_version":"1.0","source":{"id":"1409.6690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.6690","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.6690v2","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.6690","created_at":"2026-05-18T02:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"XJTRYBAHKUTF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XJTRYBAHKUTFMO5F","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XJTRYBAH","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:35f29c22796bf1944bc307cb2c9cb670239e9c074644b233828c6ae4701e39c7","target":"graph","created_at":"2026-05-18T02:41:18Z","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 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","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-09-23T18:37:00Z","title":"The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.6690","kind":"arxiv","version":2},"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:b70dccf4c288c9d07b79614f88cd210e473ffd6caf7b49c68d068947c64d4d24","target":"record","created_at":"2026-05-18T02:41:18Z","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":"453197bf5c41ad63c9cb17a65350788abb5668a11c35d77734b0a3f19cd390f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-09-23T18:37:00Z","title_canon_sha256":"c31b00765a673ed3612c82793f3603a750b26c802aaa957cd1604b5952b947ce"},"schema_version":"1.0","source":{"id":"1409.6690","kind":"arxiv","version":2}},"canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba671c04075526563ba5b29e89cdb0d453a7e4ea6b0a4b0015c28e730b06fa74","first_computed_at":"2026-05-18T02:41:18.244835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:18.244835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gPfc2f/oR6vHnHtPmceJdHdVhoJiTL6tQgSKfN52r0X5HdfUwsX9EPfWCCo7sqkZs7XBHExRP9h9HnUe1OoMCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:18.245265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.6690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b70dccf4c288c9d07b79614f88cd210e473ffd6caf7b49c68d068947c64d4d24","sha256:35f29c22796bf1944bc307cb2c9cb670239e9c074644b233828c6ae4701e39c7"],"state_sha256":"991d157e4289fd66f5491107e00b71c3b0915f1fb00a32c8a7fc45edea640f2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7RnV5Mh7FMXGuyx0+AdfbouRqoOjMc1j9bWDH9ymhY26SRmZEsht7G8gicQr1L5WBsLmppSX4/ESw87VIRBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:34:13.478446Z","bundle_sha256":"f809e5779b4085544c63c5abcab3d7b26938b9729fd10ea7afb05dfd2c43c1b2"}}