{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TS725GMOTNQRKCF35JAP53SIOK","short_pith_number":"pith:TS725GMO","schema_version":"1.0","canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","source":{"kind":"arxiv","id":"2105.12328","version":2},"attestation_state":"computed","paper":{"title":"D2CFR: Minimize Counterfactual Regret with Deep Dueling Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Huale Li, Jiajia Zhang, Shuhan Qi, Xuan Wang, Zengyue Guo","submitted_at":"2021-05-26T04:58:36Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR)} is the popular method for finding approximate Nash equilibrium in two-player zero-sum games with imperfect information. CFR solves games by travsersing the full game tree iteratively, which limits its scalability in larger games. When applying CFR to solve large-scale games in previously, large-scale games are abstracted into small-scale games firstly. Secondly, CFR is used to solve the abstract game. And finally, the solution strategy is mapped back to the original large-scale game. However, this process requires considerable expert knowledge, and the"},"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":"2105.12328","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-05-26T04:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"d3671a4be95c22ea3e7905a84191cdc5bcf189acbc0bf38ed6aca258f1d46527","abstract_canon_sha256":"7e06eccdbbf5ff219586f23bbcac1b853ef869669f65e56a8080c8b0a28e8589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:44:53.776164Z","signature_b64":"5xrnMRYfurY8vdjrvTwAxeuOWq3gH467HTMrWisQwic/vEkkfumhSpawUoTt0e8Wpp3dJjmX4nN2H37hMzw7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","last_reissued_at":"2026-07-05T03:44:53.775688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:44:53.775688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D2CFR: Minimize Counterfactual Regret with Deep Dueling Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Huale Li, Jiajia Zhang, Shuhan Qi, Xuan Wang, Zengyue Guo","submitted_at":"2021-05-26T04:58:36Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR)} is the popular method for finding approximate Nash equilibrium in two-player zero-sum games with imperfect information. CFR solves games by travsersing the full game tree iteratively, which limits its scalability in larger games. When applying CFR to solve large-scale games in previously, large-scale games are abstracted into small-scale games firstly. Secondly, CFR is used to solve the abstract game. And finally, the solution strategy is mapped back to the original large-scale game. However, this process requires considerable expert knowledge, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12328","kind":"arxiv","version":2},"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/2105.12328/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":"2105.12328","created_at":"2026-07-05T03:44:53.775747+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.12328v2","created_at":"2026-07-05T03:44:53.775747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12328","created_at":"2026-07-05T03:44:53.775747+00:00"},{"alias_kind":"pith_short_12","alias_value":"TS725GMOTNQR","created_at":"2026-07-05T03:44:53.775747+00:00"},{"alias_kind":"pith_short_16","alias_value":"TS725GMOTNQRKCF3","created_at":"2026-07-05T03:44:53.775747+00:00"},{"alias_kind":"pith_short_8","alias_value":"TS725GMO","created_at":"2026-07-05T03:44:53.775747+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/TS725GMOTNQRKCF35JAP53SIOK","json":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK.json","graph_json":"https://pith.science/api/pith-number/TS725GMOTNQRKCF35JAP53SIOK/graph.json","events_json":"https://pith.science/api/pith-number/TS725GMOTNQRKCF35JAP53SIOK/events.json","paper":"https://pith.science/paper/TS725GMO"},"agent_actions":{"view_html":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK","download_json":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK.json","view_paper":"https://pith.science/paper/TS725GMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.12328&json=true","fetch_graph":"https://pith.science/api/pith-number/TS725GMOTNQRKCF35JAP53SIOK/graph.json","fetch_events":"https://pith.science/api/pith-number/TS725GMOTNQRKCF35JAP53SIOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/action/storage_attestation","attest_author":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/action/author_attestation","sign_citation":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/action/citation_signature","submit_replication":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/action/replication_record"}},"created_at":"2026-07-05T03:44:53.775747+00:00","updated_at":"2026-07-05T03:44:53.775747+00:00"}