{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UUUP54BBJFZLMBQJI4PBTYG5EG","short_pith_number":"pith:UUUP54BB","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"},"canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","source":{"kind":"arxiv","id":"1804.10896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10896","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10896v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10896","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"UUUP54BBJFZL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUUP54BBJFZLMBQJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUUP54BB","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UUUP54BBJFZLMBQJI4PBTYG5EG","target":"record","payload":{"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"},"canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","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"},"source_kind":"arxiv","source_id":"1804.10896","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-18T00:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rZQ3qti2NxaLNUHv5PmKNqbYJkhCKeuEmXa7KWMCAoPiUbUDnkzhsWGr6AAEXd5WX4c9+20sVb34SNX1CNBxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:25:35.469597Z"},"content_sha256":"ac1cdcff5fdd796a81972924e2f3cb978f05128452a4877d448eaef39cf934f1","schema_version":"1.0","event_id":"sha256:ac1cdcff5fdd796a81972924e2f3cb978f05128452a4877d448eaef39cf934f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UUUP54BBJFZLMBQJI4PBTYG5EG","target":"graph","payload":{"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"},"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-18T00:17:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYWAz3mP7WYIIMI3F8jSwqvN/Q3MCvVETtWdBsrj0mm7VNQ99EkUVKq+AG+nqE5QmUB1/2GhEA7BXt8iycR9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:25:35.470156Z"},"content_sha256":"3c8e7f611e7d4a6263a09a213395098d685e73cc18971d729b594e22208e28ea","schema_version":"1.0","event_id":"sha256:3c8e7f611e7d4a6263a09a213395098d685e73cc18971d729b594e22208e28ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/bundle.json","state_url":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/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-06-11T14:25:35Z","links":{"resolver":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG","bundle":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/bundle.json","state":"https://pith.science/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUUP54BBJFZLMBQJI4PBTYG5EG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UUUP54BBJFZLMBQJI4PBTYG5EG","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":"3a73f5c5eac7d96c37feaf8eb79cb4322857f6734b2b5093ca30caa7fafee634","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T09:31:28Z","title_canon_sha256":"539f4335919d943b56e4e284989faedbff1dc999c489d2f31c7e9e6efc1ec2d1"},"schema_version":"1.0","source":{"id":"1804.10896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10896","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10896v1","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10896","created_at":"2026-05-18T00:17:15Z"},{"alias_kind":"pith_short_12","alias_value":"UUUP54BBJFZL","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UUUP54BBJFZLMBQJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UUUP54BB","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:3c8e7f611e7d4a6263a09a213395098d685e73cc18971d729b594e22208e28ea","target":"graph","created_at":"2026-05-18T00:17:15Z","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":"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","authors_text":"Stephane Le Roux","cross_cats":["cs.FL","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T09:31:28Z","title":"Concurrent games and semi-random determinacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10896","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:ac1cdcff5fdd796a81972924e2f3cb978f05128452a4877d448eaef39cf934f1","target":"record","created_at":"2026-05-18T00:17:15Z","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":"3a73f5c5eac7d96c37feaf8eb79cb4322857f6734b2b5093ca30caa7fafee634","cross_cats_sorted":["cs.FL","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-29T09:31:28Z","title_canon_sha256":"539f4335919d943b56e4e284989faedbff1dc999c489d2f31c7e9e6efc1ec2d1"},"schema_version":"1.0","source":{"id":"1804.10896","kind":"arxiv","version":1}},"canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a528fef0214972b60609471e19e0dd21aff694a3b792fce1f1a1fb2925907265","first_computed_at":"2026-05-18T00:17:15.231733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:15.231733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfZ/niv0A3nVk7N61+YDjY3RmnYMx/uhTrdw7ZOLovlY2KJ9mLXaPj/RFG1TKl7UBCq0C2vdez4APCeRomVpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:15.232182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac1cdcff5fdd796a81972924e2f3cb978f05128452a4877d448eaef39cf934f1","sha256:3c8e7f611e7d4a6263a09a213395098d685e73cc18971d729b594e22208e28ea"],"state_sha256":"6b8ba0e3220e837f5c8abf2001ddddd0146e1c6858f9a632ddf045ada77fff1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"arQeqanELZGutZKnzcBNb7yD1Dh8kTB0r8qPyvW+xA2mHIEjlyrT/BeJchP1KBOuGgkpUNrhFzoiR4LWPgDxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:25:35.472824Z","bundle_sha256":"6708e8a193672aac131a41ab8d4694b76749d518fe6216ec05f932b3a531ab5e"}}