{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FMZZ3TOJQQLPOKXKSPPJ2Y2JOC","short_pith_number":"pith:FMZZ3TOJ","schema_version":"1.0","canonical_sha256":"2b339dcdc98416f72aea93de9d634970b0f22ccb306898b552ccc55b8d358861","source":{"kind":"arxiv","id":"2605.14283","version":1},"attestation_state":"computed","paper":{"title":"Watermarking Game-Playing Agents in Perfect-Information Extensive-Form Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Game strategies in perfect-information extensive-form games can be watermarked for statistical detection while bounding expected utility loss.","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.GT","authors_text":"Fei Fang, Juho Kim, Tuomas Sandholm","submitted_at":"2026-05-14T02:33:30Z","abstract_excerpt":"Watermarking techniques for large language models (LLMs), which encode hidden information in the output so its source can be verified, have gained significant attention in recent days, thanks to their potential capability to detect accidental or deliberate misuse. Similar challenges involving model misuse also exist in the context of game-playing, such as when detecting the unauthorized use of AI tools in gaming platforms (e.g., cheating in online chess). In this paper, we initiate the study of how game-playing strategies can be watermarked. We show how the KGW watermark for LLMs can be adapte"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14283","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-05-14T02:33:30Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"8ab5b1aa99d77f5ea01f4078356c8762c03b5d1a1f6c70b133482b1a4db04116","abstract_canon_sha256":"5b34ca34670439f523db35b24382462e652c784a2d678a0da8eef893fd4097a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:10.267668Z","signature_b64":"yE9Fw1iDRxG0RBYR1cxnyNWkiQ25iL+rMcGiqQXUEfmrKEY+cQTKKYfEaou7Mo2MX5sE7qoJEHlaso1DuAQ9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b339dcdc98416f72aea93de9d634970b0f22ccb306898b552ccc55b8d358861","last_reissued_at":"2026-05-17T23:39:10.267072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:10.267072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Watermarking Game-Playing Agents in Perfect-Information Extensive-Form Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Game strategies in perfect-information extensive-form games can be watermarked for statistical detection while bounding expected utility loss.","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.GT","authors_text":"Fei Fang, Juho Kim, Tuomas Sandholm","submitted_at":"2026-05-14T02:33:30Z","abstract_excerpt":"Watermarking techniques for large language models (LLMs), which encode hidden information in the output so its source can be verified, have gained significant attention in recent days, thanks to their potential capability to detect accidental or deliberate misuse. Similar challenges involving model misuse also exist in the context of game-playing, such as when detecting the unauthorized use of AI tools in gaming platforms (e.g., cheating in online chess). In this paper, we initiate the study of how game-playing strategies can be watermarked. We show how the KGW watermark for LLMs can be adapte"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that the degradation in the quality of the watermarked strategy profile, quantified by the expected utility, can be bounded, but there is a tradeoff between detectability and quality.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The adaptation assumes that the strategy profile in a perfect-information extensive-form game can be modified by embedding a watermark pattern without violating the information structure or equilibrium properties of the original game.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Adapting the KGW watermark to game strategies in extensive-form games enables statistical detection of watermarked agents with bounded expected-utility degradation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Game strategies in perfect-information extensive-form games can be watermarked for statistical detection while bounding expected utility loss.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e262129613e96509032f4618e3e43d380223381fc6d3d771e52f204d29273ffa"},"source":{"id":"2605.14283","kind":"arxiv","version":1},"verdict":{"id":"608bee0c-4574-491a-a6b9-5f76f3d4358d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:32:12.877885Z","strongest_claim":"We show that the degradation in the quality of the watermarked strategy profile, quantified by the expected utility, can be bounded, but there is a tradeoff between detectability and quality.","one_line_summary":"Adapting the KGW watermark to game strategies in extensive-form games enables statistical detection of watermarked agents with bounded expected-utility degradation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The adaptation assumes that the strategy profile in a perfect-information extensive-form game can be modified by embedding a watermark pattern without violating the information structure or equilibrium properties of the original game.","pith_extraction_headline":"Game strategies in perfect-information extensive-form games can be watermarked for statistical detection while bounding expected utility loss."},"references":{"count":24,"sample":[{"doi":"","year":2018,"title":"N. Brown and T. Sandholm. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals.Science, 359(6374):418–424, 2018","work_id":"ef7b56a3-56e6-44b7-91f5-2599930721da","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"N. Brown and T. Sandholm. Superhuman AI for multiplayer poker.Science, 365(6456):885–890, 2019","work_id":"deee810e-0e04-44e2-a5ee-100c7117dc2d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"M. Campbell, A. J. Hoane, Jr., and F. Hsu. Deep Blue.Artificial Intelligence, 134(1):57–83, 2002","work_id":"b4952e3c-d6be-4919-888a-fe1717a8ca99","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"C.-C. Chang and I. Echizen. Steganography in game actions.IEEE Access, 13:21029–21042, 2025","work_id":"1288912d-6af4-4005-a708-2c518b297709","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Y . Chang, K. Krishna, A. Houmansadr, J. F. Wieting, and M. Iyyer. PostMark: A robust blackbox watermark for large language models. InProceedings of the Conference on Empirical Methods in Natural Lang","work_id":"c2f1f8f8-5ad5-4503-8eef-017dedfe2e92","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":24,"snapshot_sha256":"2ade13faf2374ff18335c669d4bdbe519562c835f2ff0bf80d3d1d2b40b967c8","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":"2605.14283","created_at":"2026-05-17T23:39:10.267173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14283v1","created_at":"2026-05-17T23:39:10.267173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14283","created_at":"2026-05-17T23:39:10.267173+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMZZ3TOJQQLP","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMZZ3TOJQQLPOKXK","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMZZ3TOJ","created_at":"2026-05-18T12:33:37.589309+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/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC","json":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC.json","graph_json":"https://pith.science/api/pith-number/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/graph.json","events_json":"https://pith.science/api/pith-number/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/events.json","paper":"https://pith.science/paper/FMZZ3TOJ"},"agent_actions":{"view_html":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC","download_json":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC.json","view_paper":"https://pith.science/paper/FMZZ3TOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14283&json=true","fetch_graph":"https://pith.science/api/pith-number/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/graph.json","fetch_events":"https://pith.science/api/pith-number/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/action/storage_attestation","attest_author":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/action/author_attestation","sign_citation":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/action/citation_signature","submit_replication":"https://pith.science/pith/FMZZ3TOJQQLPOKXKSPPJ2Y2JOC/action/replication_record"}},"created_at":"2026-05-17T23:39:10.267173+00:00","updated_at":"2026-05-17T23:39:10.267173+00:00"}