{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YTMBEBYYGYWOO5UDXTTU5HS6JM","short_pith_number":"pith:YTMBEBYY","schema_version":"1.0","canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","source":{"kind":"arxiv","id":"1812.10607","version":1},"attestation_state":"computed","paper":{"title":"Double Neural Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hui Li, Kailiang Hu, Le Song, Tao Jiang, Yuan Qi, Zhibang Ge","submitted_at":"2018-12-27T03:31:33Z","abstract_excerpt":"Counterfactual Regret Minimization (CRF) is a fundamental and effective technique for solving Imperfect Information Games (IIG). However, the original CRF algorithm only works for discrete state and action spaces, and the resulting strategy is maintained as a tabular representation. Such tabular representation limits the method from being directly applied to large games and continuing to improve from a poor strategy profile. In this paper, we propose a double neural representation for the imperfect information games, where one neural network represents the cumulative regret, and the other repr"},"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":"1812.10607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-27T03:31:33Z","cross_cats_sorted":[],"title_canon_sha256":"8a8aa110bcc81755febd01918b9262addeb87f54b1975fc2e2452c621d9bd38a","abstract_canon_sha256":"a71a8dc5b4c4b579632d725ee6d94c65276b18931daf15de8d44fea2f15da0ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.511221Z","signature_b64":"iPsdDhLwQhaSnCTA+l1jZ+swfo5rtvtSRjl0LRxgdXcMXnQ1nKKDT7XVkDHf4EOhrIvpwgPbBbpnvJYeOIO0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","last_reissued_at":"2026-05-17T23:57:20.510700Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.510700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Neural Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hui Li, Kailiang Hu, Le Song, Tao Jiang, Yuan Qi, Zhibang Ge","submitted_at":"2018-12-27T03:31:33Z","abstract_excerpt":"Counterfactual Regret Minimization (CRF) is a fundamental and effective technique for solving Imperfect Information Games (IIG). However, the original CRF algorithm only works for discrete state and action spaces, and the resulting strategy is maintained as a tabular representation. Such tabular representation limits the method from being directly applied to large games and continuing to improve from a poor strategy profile. In this paper, we propose a double neural representation for the imperfect information games, where one neural network represents the cumulative regret, and the other repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10607","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":"1812.10607","created_at":"2026-05-17T23:57:20.510788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.10607v1","created_at":"2026-05-17T23:57:20.510788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10607","created_at":"2026-05-17T23:57:20.510788+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTMBEBYYGYWO","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTMBEBYYGYWOO5UD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTMBEBYY","created_at":"2026-05-18T12:33:04.347982+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/YTMBEBYYGYWOO5UDXTTU5HS6JM","json":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM.json","graph_json":"https://pith.science/api/pith-number/YTMBEBYYGYWOO5UDXTTU5HS6JM/graph.json","events_json":"https://pith.science/api/pith-number/YTMBEBYYGYWOO5UDXTTU5HS6JM/events.json","paper":"https://pith.science/paper/YTMBEBYY"},"agent_actions":{"view_html":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM","download_json":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM.json","view_paper":"https://pith.science/paper/YTMBEBYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.10607&json=true","fetch_graph":"https://pith.science/api/pith-number/YTMBEBYYGYWOO5UDXTTU5HS6JM/graph.json","fetch_events":"https://pith.science/api/pith-number/YTMBEBYYGYWOO5UDXTTU5HS6JM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/action/storage_attestation","attest_author":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/action/author_attestation","sign_citation":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/action/citation_signature","submit_replication":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/action/replication_record"}},"created_at":"2026-05-17T23:57:20.510788+00:00","updated_at":"2026-05-17T23:57:20.510788+00:00"}