{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TS725GMOTNQRKCF35JAP53SIOK","short_pith_number":"pith:TS725GMO","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"},"canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","source":{"kind":"arxiv","id":"2105.12328","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12328","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12328v2","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12328","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"TS725GMOTNQR","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_16","alias_value":"TS725GMOTNQRKCF3","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_8","alias_value":"TS725GMO","created_at":"2026-07-05T03:44:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TS725GMOTNQRKCF35JAP53SIOK","target":"record","payload":{"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"},"canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","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"},"source_kind":"arxiv","source_id":"2105.12328","source_version":2,"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-07-05T03:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjjoAjpix610luIR0hruG4NSL95lFxtmszqX7rUk0vCQO8xtqZXFVBBAL8L5vncNyK4nkz8MtIG6aEKf9/teDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:34:04.342296Z"},"content_sha256":"15bfb1eea963068914a60932f8472ed9f15951a957aae9a1313b889a088f1ced","schema_version":"1.0","event_id":"sha256:15bfb1eea963068914a60932f8472ed9f15951a957aae9a1313b889a088f1ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TS725GMOTNQRKCF35JAP53SIOK","target":"graph","payload":{"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"},"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-07-05T03:44:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UM4TXseuAgvdIqsPhSpyYNBmxCUT5xJEzTfPMlAgivuhxq1OJupkCBG6gkB6RlHWgiMSzCwyt38alk9heY2TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:34:04.342743Z"},"content_sha256":"6bc811b70aedfce1db3fc72fb46c9872261ebd08ea7552709f64b2db424d84cf","schema_version":"1.0","event_id":"sha256:6bc811b70aedfce1db3fc72fb46c9872261ebd08ea7552709f64b2db424d84cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/bundle.json","state_url":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TS725GMOTNQRKCF35JAP53SIOK/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-07-07T04:34:04Z","links":{"resolver":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK","bundle":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/bundle.json","state":"https://pith.science/pith/TS725GMOTNQRKCF35JAP53SIOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TS725GMOTNQRKCF35JAP53SIOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TS725GMOTNQRKCF35JAP53SIOK","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":"7e06eccdbbf5ff219586f23bbcac1b853ef869669f65e56a8080c8b0a28e8589","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-05-26T04:58:36Z","title_canon_sha256":"d3671a4be95c22ea3e7905a84191cdc5bcf189acbc0bf38ed6aca258f1d46527"},"schema_version":"1.0","source":{"id":"2105.12328","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.12328","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"arxiv_version","alias_value":"2105.12328v2","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.12328","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_12","alias_value":"TS725GMOTNQR","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_16","alias_value":"TS725GMOTNQRKCF3","created_at":"2026-07-05T03:44:53Z"},{"alias_kind":"pith_short_8","alias_value":"TS725GMO","created_at":"2026-07-05T03:44:53Z"}],"graph_snapshots":[{"event_id":"sha256:6bc811b70aedfce1db3fc72fb46c9872261ebd08ea7552709f64b2db424d84cf","target":"graph","created_at":"2026-07-05T03:44:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.12328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Huale Li, Jiajia Zhang, Shuhan Qi, Xuan Wang, Zengyue Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-05-26T04:58:36Z","title":"D2CFR: Minimize Counterfactual Regret with Deep Dueling Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.12328","kind":"arxiv","version":2},"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:15bfb1eea963068914a60932f8472ed9f15951a957aae9a1313b889a088f1ced","target":"record","created_at":"2026-07-05T03:44:53Z","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":"7e06eccdbbf5ff219586f23bbcac1b853ef869669f65e56a8080c8b0a28e8589","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-05-26T04:58:36Z","title_canon_sha256":"d3671a4be95c22ea3e7905a84191cdc5bcf189acbc0bf38ed6aca258f1d46527"},"schema_version":"1.0","source":{"id":"2105.12328","kind":"arxiv","version":2}},"canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cbfae998e9b611508bbea40feee48729365cb1ddab16f70ec25137c26952c56","first_computed_at":"2026-07-05T03:44:53.775688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:44:53.775688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xrnMRYfurY8vdjrvTwAxeuOWq3gH467HTMrWisQwic/vEkkfumhSpawUoTt0e8Wpp3dJjmX4nN2H37hMzw7DA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:44:53.776164Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.12328","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15bfb1eea963068914a60932f8472ed9f15951a957aae9a1313b889a088f1ced","sha256:6bc811b70aedfce1db3fc72fb46c9872261ebd08ea7552709f64b2db424d84cf"],"state_sha256":"cd0714e5469cf231fc68eeceb9cd6211db9dafd444b3bbb75fc3ed651616f9d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7Vi7ywFsyoIevlLT/bF6mZ3Obrkaxe3PGzCNMrq3RiOFPQsZQ5QnfR/SWzzsKI8Ci6PCfz1FNe70VVBtdt8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:34:04.344691Z","bundle_sha256":"73a139788946b0b3e404113ade81107007f82ba20e76e2b16e4a45e95e4d0e0e"}}