{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YTMBEBYYGYWOO5UDXTTU5HS6JM","short_pith_number":"pith:YTMBEBYY","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"},"canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","source":{"kind":"arxiv","id":"1812.10607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10607","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10607v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10607","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"YTMBEBYYGYWO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YTMBEBYYGYWOO5UD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YTMBEBYY","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YTMBEBYYGYWOO5UDXTTU5HS6JM","target":"record","payload":{"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"},"canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","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"},"source_kind":"arxiv","source_id":"1812.10607","source_version":1,"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-05-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EMJFlw178FI8X9A5fECbqQ7QSSIA48U16m1Uv9zi5khNlvh1uywH/raEI3PixufiLlwtDJlxcUJz/XM7Uf3SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:52:43.587666Z"},"content_sha256":"661e812038c6d2c242eed85d74d02aabba9482b7209a721bb4cec2adbcae0085","schema_version":"1.0","event_id":"sha256:661e812038c6d2c242eed85d74d02aabba9482b7209a721bb4cec2adbcae0085"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YTMBEBYYGYWOO5UDXTTU5HS6JM","target":"graph","payload":{"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"},"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-05-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rBIzz+stydPCRbCrLjFPRg1D5ezHYVmWGVWVoQCzP1Q7cK5z0MF/hEx04fwBPHGCvB2jI42oY5bPWb3MaxPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:52:43.588058Z"},"content_sha256":"1264dee211d9f311a66942fac08f82f41f52023ca69ecdde35c935bbed2e79fc","schema_version":"1.0","event_id":"sha256:1264dee211d9f311a66942fac08f82f41f52023ca69ecdde35c935bbed2e79fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/bundle.json","state_url":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/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-06-01T06:52:43Z","links":{"resolver":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM","bundle":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/bundle.json","state":"https://pith.science/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTMBEBYYGYWOO5UDXTTU5HS6JM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YTMBEBYYGYWOO5UDXTTU5HS6JM","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":"a71a8dc5b4c4b579632d725ee6d94c65276b18931daf15de8d44fea2f15da0ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-27T03:31:33Z","title_canon_sha256":"8a8aa110bcc81755febd01918b9262addeb87f54b1975fc2e2452c621d9bd38a"},"schema_version":"1.0","source":{"id":"1812.10607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10607","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10607v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10607","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"YTMBEBYYGYWO","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YTMBEBYYGYWOO5UD","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YTMBEBYY","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:1264dee211d9f311a66942fac08f82f41f52023ca69ecdde35c935bbed2e79fc","target":"graph","created_at":"2026-05-17T23:57:20Z","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"},"paper":{"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","authors_text":"Hui Li, Kailiang Hu, Le Song, Tao Jiang, Yuan Qi, Zhibang Ge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-27T03:31:33Z","title":"Double Neural Counterfactual Regret Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10607","kind":"arxiv","version":1},"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:661e812038c6d2c242eed85d74d02aabba9482b7209a721bb4cec2adbcae0085","target":"record","created_at":"2026-05-17T23:57:20Z","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":"a71a8dc5b4c4b579632d725ee6d94c65276b18931daf15de8d44fea2f15da0ec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-12-27T03:31:33Z","title_canon_sha256":"8a8aa110bcc81755febd01918b9262addeb87f54b1975fc2e2452c621d9bd38a"},"schema_version":"1.0","source":{"id":"1812.10607","kind":"arxiv","version":1}},"canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4d8120718362ce77683bce74e9e5e4b0cf10c50f8326fb2b93227ab6715e27d","first_computed_at":"2026-05-17T23:57:20.510700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:20.510700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iPsdDhLwQhaSnCTA+l1jZ+swfo5rtvtSRjl0LRxgdXcMXnQ1nKKDT7XVkDHf4EOhrIvpwgPbBbpnvJYeOIO0BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:20.511221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:661e812038c6d2c242eed85d74d02aabba9482b7209a721bb4cec2adbcae0085","sha256:1264dee211d9f311a66942fac08f82f41f52023ca69ecdde35c935bbed2e79fc"],"state_sha256":"112dd96fa9136b56f48dab122827d6e4c0013cb047c1625cbb85e9197009a995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nWIshXoehVH0N4kExUx4c5IPNkzOGGHlQl3KTQQ7izW5j1RlX60/4KOcjj1gq2JZVIAZ5f9uXc4YV0OQI0gfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:52:43.590424Z","bundle_sha256":"3226dba514b9202b3f385292fe9a6b44c74e86d1121659fca47af3e81ea949fc"}}