{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:X5FJC4PM4IQQVTYFWRWIZP32QG","short_pith_number":"pith:X5FJC4PM","schema_version":"1.0","canonical_sha256":"bf4a9171ece2210acf05b46c8cbf7a81995182bf0f3756b2b516482a89a6a54b","source":{"kind":"arxiv","id":"2509.04125","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Bluffing by DQN and CFR in Leduc Hold'em Poker","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aske Plaat, K. Joost Batenburg, Tarik Zaciragic","submitted_at":"2025-09-04T11:40:24Z","abstract_excerpt":"In the game of poker, being unpredictable, or bluffing, is an essential skill. When humans play poker, they bluff. However, most works on computer-poker focus on performance metrics such as win rates, while bluffing is overlooked. In this paper we study whether two popular algorithms, DQN (based on reinforcement learning) and CFR (based on game theory), exhibit bluffing behavior in Leduc Hold'em, a simplified version of poker. We designed an experiment where we let the DQN and CFR agent play against each other while we log their actions. We find that both DQN and CFR exhibit bluffing behavior,"},"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":"2509.04125","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-09-04T11:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"42f6fb37f47e8e41ce84514636d47898bb64a41690cd34dccceb05638c08f3ba","abstract_canon_sha256":"40e57eac33848ef52d1dba0d0640a16a073065feb7a727d1d9142229b12b71fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:53.823273Z","signature_b64":"27i6/CRxHsfIGiPpRk1kXAQTPXsxZGcCHKDnsFCuhwWSZU9CEIMiVjd57P2AN9k4uUDmtiAtI4mPJAFt/BYWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf4a9171ece2210acf05b46c8cbf7a81995182bf0f3756b2b516482a89a6a54b","last_reissued_at":"2026-07-05T12:04:53.822737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:53.822737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Bluffing by DQN and CFR in Leduc Hold'em Poker","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aske Plaat, K. Joost Batenburg, Tarik Zaciragic","submitted_at":"2025-09-04T11:40:24Z","abstract_excerpt":"In the game of poker, being unpredictable, or bluffing, is an essential skill. When humans play poker, they bluff. However, most works on computer-poker focus on performance metrics such as win rates, while bluffing is overlooked. In this paper we study whether two popular algorithms, DQN (based on reinforcement learning) and CFR (based on game theory), exhibit bluffing behavior in Leduc Hold'em, a simplified version of poker. We designed an experiment where we let the DQN and CFR agent play against each other while we log their actions. We find that both DQN and CFR exhibit bluffing behavior,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.04125","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.04125/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2509.04125","created_at":"2026-07-05T12:04:53.822796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.04125v1","created_at":"2026-07-05T12:04:53.822796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.04125","created_at":"2026-07-05T12:04:53.822796+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5FJC4PM4IQQ","created_at":"2026-07-05T12:04:53.822796+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5FJC4PM4IQQVTYF","created_at":"2026-07-05T12:04:53.822796+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5FJC4PM","created_at":"2026-07-05T12:04:53.822796+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/X5FJC4PM4IQQVTYFWRWIZP32QG","json":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG.json","graph_json":"https://pith.science/api/pith-number/X5FJC4PM4IQQVTYFWRWIZP32QG/graph.json","events_json":"https://pith.science/api/pith-number/X5FJC4PM4IQQVTYFWRWIZP32QG/events.json","paper":"https://pith.science/paper/X5FJC4PM"},"agent_actions":{"view_html":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG","download_json":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG.json","view_paper":"https://pith.science/paper/X5FJC4PM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.04125&json=true","fetch_graph":"https://pith.science/api/pith-number/X5FJC4PM4IQQVTYFWRWIZP32QG/graph.json","fetch_events":"https://pith.science/api/pith-number/X5FJC4PM4IQQVTYFWRWIZP32QG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG/action/storage_attestation","attest_author":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG/action/author_attestation","sign_citation":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG/action/citation_signature","submit_replication":"https://pith.science/pith/X5FJC4PM4IQQVTYFWRWIZP32QG/action/replication_record"}},"created_at":"2026-07-05T12:04:53.822796+00:00","updated_at":"2026-07-05T12:04:53.822796+00:00"}