{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UUUP54BBJFZLMBQJI4PBTYG5EG","short_pith_number":"pith:UUUP54BB","schema_version":"1.0","canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","source":{"kind":"arxiv","id":"1804.10896","version":1},"attestation_state":"computed","paper":{"title":"Concurrent games and semi-random determinacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Stephane Le Roux","submitted_at":"2018-04-29T09:31:28Z","abstract_excerpt":"Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of winning (finite-memory) strategies in finitely many derived one-player games. Several classical winning conditions satisfy this simple requirement.\n  Under an additional requirement on the winning condition, the non-existence of Player 1 winning strategies from all vertices is equivalent to the existence of Player 2 stochastic strategies winning almost surely"},"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":"1804.10896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T09:31:28Z","cross_cats_sorted":["cs.FL","cs.GT"],"title_canon_sha256":"539f4335919d943b56e4e284989faedbff1dc999c489d2f31c7e9e6efc1ec2d1","abstract_canon_sha256":"3a73f5c5eac7d96c37feaf8eb79cb4322857f6734b2b5093ca30caa7fafee634"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:15.232182Z","signature_b64":"kfZ/niv0A3nVk7N61+YDjY3RmnYMx/uhTrdw7ZOLovlY2KJ9mLXaPj/RFG1TKl7UBCq0C2vdez4APCeRomVpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","last_reissued_at":"2026-05-18T00:17:15.231733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:15.231733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concurrent games and semi-random determinacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT"],"primary_cat":"cs.LO","authors_text":"Stephane Le Roux","submitted_at":"2018-04-29T09:31:28Z","abstract_excerpt":"Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of winning (finite-memory) strategies in finitely many derived one-player games. Several classical winning conditions satisfy this simple requirement.\n  Under an additional requirement on the winning condition, the non-existence of Player 1 winning strategies from all vertices is equivalent to the existence of Player 2 stochastic strategies winning almost surely"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10896","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":"1804.10896","created_at":"2026-05-18T00:17:15.231796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.10896v1","created_at":"2026-05-18T00:17:15.231796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10896","created_at":"2026-05-18T00:17:15.231796+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUUP54BBJFZL","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUUP54BBJFZLMBQJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUUP54BB","created_at":"2026-05-18T12:32:56.356000+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/UUUP54BBJFZLMBQJI4PBTYG5EG","json":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG.json","graph_json":"https://pith.science/api/pith-number/UUUP54BBJFZLMBQJI4PBTYG5EG/graph.json","events_json":"https://pith.science/api/pith-number/UUUP54BBJFZLMBQJI4PBTYG5EG/events.json","paper":"https://pith.science/paper/UUUP54BB"},"agent_actions":{"view_html":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG","download_json":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG.json","view_paper":"https://pith.science/paper/UUUP54BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.10896&json=true","fetch_graph":"https://pith.science/api/pith-number/UUUP54BBJFZLMBQJI4PBTYG5EG/graph.json","fetch_events":"https://pith.science/api/pith-number/UUUP54BBJFZLMBQJI4PBTYG5EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/action/storage_attestation","attest_author":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/action/author_attestation","sign_citation":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/action/citation_signature","submit_replication":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/action/replication_record"}},"created_at":"2026-05-18T00:17:15.231796+00:00","updated_at":"2026-05-18T00:17:15.231796+00:00"}