{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BCYUBUHBE7MJPTI4YIY3GLPM7X","short_pith_number":"pith:BCYUBUHB","canonical_record":{"source":{"id":"1702.06439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b3d6c6d38cfc2d05ffba3215f1c63f3a78381d17ae070dd681861bd77b1116d9","abstract_canon_sha256":"6e8e4319027acebed1c951b4ac59b90617f195a3aa6574e37fb916b13b6bbe18"},"schema_version":"1.0"},"canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","source":{"kind":"arxiv","id":"1702.06439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06439","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06439v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06439","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"BCYUBUHBE7MJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCYUBUHBE7MJPTI4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCYUBUHB","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BCYUBUHBE7MJPTI4YIY3GLPM7X","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b3d6c6d38cfc2d05ffba3215f1c63f3a78381d17ae070dd681861bd77b1116d9","abstract_canon_sha256":"6e8e4319027acebed1c951b4ac59b90617f195a3aa6574e37fb916b13b6bbe18"},"schema_version":"1.0"},"canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:14.139672Z","signature_b64":"G8EIHxBrRcj8CrnRREEPzLLDMOcA46GNfYK3OOmijMaXeinrjJUisF8vFwJUiCNUVsIBf8W0BrT9loKlAzIdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","last_reissued_at":"2026-05-18T00:50:14.139206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:14.139206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06439","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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+XPUq2pZogTUqFef87+hawHjCgqZlIHtQNKV4vv1fLwtvn6f3BjJ/W88HzwltUl/9FhQfM6ZhqSxFGosQzHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:03:14.635790Z"},"content_sha256":"c36393b38efdf382b9327ac644fd9530a27924798a18e80c7feaca6f3e99f9e7","schema_version":"1.0","event_id":"sha256:c36393b38efdf382b9327ac644fd9530a27924798a18e80c7feaca6f3e99f9e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BCYUBUHBE7MJPTI4YIY3GLPM7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Admissibility in Concurrent Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin, Nicolas Basset, Ocan Sankur","submitted_at":"2017-02-21T15:30:28Z","abstract_excerpt":"In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates it, i.e., that wins (almost surely) against a super set of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we characterise them precisely. Then, when the objectives of the players are omega-regular, we show how to perform assume-admissible synthesis, i.e., how to compute admissible strategies that win (almost s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06439","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:50:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Q07K9b1zSEmQzzcWlZzgbyyFdkNYp/+P8u8lD9BeFZ39TjvEXmQpwVU9zHQ6rNIP5qVL9Alr/1icAK3CZQJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:03:14.636416Z"},"content_sha256":"f019e368d8d0f1a0e88bdd9753d65d132acf75bbd1e987225921131c3e556119","schema_version":"1.0","event_id":"sha256:f019e368d8d0f1a0e88bdd9753d65d132acf75bbd1e987225921131c3e556119"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/bundle.json","state_url":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/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-27T00:03:14Z","links":{"resolver":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X","bundle":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/bundle.json","state":"https://pith.science/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCYUBUHBE7MJPTI4YIY3GLPM7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BCYUBUHBE7MJPTI4YIY3GLPM7X","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":"6e8e4319027acebed1c951b4ac59b90617f195a3aa6574e37fb916b13b6bbe18","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","title_canon_sha256":"b3d6c6d38cfc2d05ffba3215f1c63f3a78381d17ae070dd681861bd77b1116d9"},"schema_version":"1.0","source":{"id":"1702.06439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06439","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06439v1","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06439","created_at":"2026-05-18T00:50:14Z"},{"alias_kind":"pith_short_12","alias_value":"BCYUBUHBE7MJ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BCYUBUHBE7MJPTI4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BCYUBUHB","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:f019e368d8d0f1a0e88bdd9753d65d132acf75bbd1e987225921131c3e556119","target":"graph","created_at":"2026-05-18T00:50:14Z","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":"In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates it, i.e., that wins (almost surely) against a super set of adversarial strategies. We prove that admissible strategies always exist in concurrent games, and we characterise them precisely. Then, when the objectives of the players are omega-regular, we show how to perform assume-admissible synthesis, i.e., how to compute admissible strategies that win (almost s","authors_text":"Gilles Geeraerts, Jean-Fran\\c{c}ois Raskin, Nicolas Basset, Ocan Sankur","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","title":"Admissibility in Concurrent Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06439","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:c36393b38efdf382b9327ac644fd9530a27924798a18e80c7feaca6f3e99f9e7","target":"record","created_at":"2026-05-18T00:50:14Z","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":"6e8e4319027acebed1c951b4ac59b90617f195a3aa6574e37fb916b13b6bbe18","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-21T15:30:28Z","title_canon_sha256":"b3d6c6d38cfc2d05ffba3215f1c63f3a78381d17ae070dd681861bd77b1116d9"},"schema_version":"1.0","source":{"id":"1702.06439","kind":"arxiv","version":1}},"canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08b140d0e127d897cd1cc231b32decfdda1a5ad2ee680c96d8f1533711bea323","first_computed_at":"2026-05-18T00:50:14.139206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:14.139206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8EIHxBrRcj8CrnRREEPzLLDMOcA46GNfYK3OOmijMaXeinrjJUisF8vFwJUiCNUVsIBf8W0BrT9loKlAzIdDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:14.139672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c36393b38efdf382b9327ac644fd9530a27924798a18e80c7feaca6f3e99f9e7","sha256:f019e368d8d0f1a0e88bdd9753d65d132acf75bbd1e987225921131c3e556119"],"state_sha256":"da908b9cf996e50e9d92146024199d6ad12cc41e88baaf2a86687ff40e919e76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5fKVOCYuB/x81lkBkXa6l211k73Nd4FOthSUgGNIZsep9vEHAkJNkdIQeiV/co7+cWaayE9riz4oXoqkUGxGDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:03:14.640257Z","bundle_sha256":"3a38aed559eda99c20a2ca26f0b994b57a16aeecb9f1280a5ccb5bf2874ef2bd"}}