{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:GGROESJWAEDKJAB477CFEEELV3","short_pith_number":"pith:GGROESJW","canonical_record":{"source":{"id":"2008.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-08-06T14:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"bc0c4bd2daa2daaccebec0701ad9a5ae9df90a9b8802736270ef5ae79ff0bcd9","abstract_canon_sha256":"f0eefea8bd094ac1551704843e52a99e33c2f36909447acd7b028364f0aa0fd0"},"schema_version":"1.0"},"canonical_sha256":"31a2e249360106a4803cffc452108baef800d7d004a3b860566d9a5e496be30e","source":{"kind":"arxiv","id":"2008.02679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02679","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02679v2","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02679","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_12","alias_value":"GGROESJWAEDK","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_16","alias_value":"GGROESJWAEDKJAB4","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_8","alias_value":"GGROESJW","created_at":"2026-07-05T01:56:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:GGROESJWAEDKJAB477CFEEELV3","target":"record","payload":{"canonical_record":{"source":{"id":"2008.02679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-08-06T14:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"bc0c4bd2daa2daaccebec0701ad9a5ae9df90a9b8802736270ef5ae79ff0bcd9","abstract_canon_sha256":"f0eefea8bd094ac1551704843e52a99e33c2f36909447acd7b028364f0aa0fd0"},"schema_version":"1.0"},"canonical_sha256":"31a2e249360106a4803cffc452108baef800d7d004a3b860566d9a5e496be30e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:55.697044Z","signature_b64":"OCgSZrr7ZNIhLo2AFN24PjrQ8ABXmgbULJnxzbsbbV5855yyqZ4I33mGDz7CYGPOFEH7dZ7w5H8QN7CdkRATBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a2e249360106a4803cffc452108baef800d7d004a3b860566d9a5e496be30e","last_reissued_at":"2026-07-05T01:56:55.696586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:55.696586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.02679","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-05T01:56:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROP8+hSGOE+LHNAHjVAhngyvIKv4N4jy8htBWs0Bsn7NV1/uBFfkVzUePTIsQp9m7iorjEkWTQlyRAgqc1ArBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:10:31.934208Z"},"content_sha256":"1a61a7a741f1d627f98b20fc3ca7612ecbb20fd691f74e034a96d5e93a02a96a","schema_version":"1.0","event_id":"sha256:1a61a7a741f1d627f98b20fc3ca7612ecbb20fd691f74e034a96d5e93a02a96a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:GGROESJWAEDKJAB477CFEEELV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving imperfect-information games via exponential counterfactual regret minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Fengwei Jia, Huale Li, Jiajia Zhang, Shuhan Qi, Xuan Wang, Yang Liu, Yulin Wu","submitted_at":"2020-08-06T14:21:26Z","abstract_excerpt":"In general, two-agent decision-making problems can be modeled as a two-player game, and a typical solution is to find a Nash equilibrium in such game. Counterfactual regret minimization (CFR) is a well-known method to find a Nash equilibrium strategy in a two-player zero-sum game with imperfect information. The CFR method adopts a regret matching algorithm iteratively to reduce regret values progressively, enabling the average strategy to approach a Nash equilibrium. Although CFR-based methods have achieved significant success in the field of imperfect information games, there is still scope f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02679","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/2008.02679/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-05T01:56:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxQmZ4E7pXwZGgCU4DtNsH8GQm19virJo38qtGs6sbjPdp5i/q9iKE38x+yU8WMgUbZuhfXlkZka6iA7GjSMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:10:31.934593Z"},"content_sha256":"b3a5103c8fa0184a9bb884ed56a9e248ea609c9fa37095fc771f677ab129a3b3","schema_version":"1.0","event_id":"sha256:b3a5103c8fa0184a9bb884ed56a9e248ea609c9fa37095fc771f677ab129a3b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGROESJWAEDKJAB477CFEEELV3/bundle.json","state_url":"https://pith.science/pith/GGROESJWAEDKJAB477CFEEELV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGROESJWAEDKJAB477CFEEELV3/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-07T13:10:31Z","links":{"resolver":"https://pith.science/pith/GGROESJWAEDKJAB477CFEEELV3","bundle":"https://pith.science/pith/GGROESJWAEDKJAB477CFEEELV3/bundle.json","state":"https://pith.science/pith/GGROESJWAEDKJAB477CFEEELV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGROESJWAEDKJAB477CFEEELV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:GGROESJWAEDKJAB477CFEEELV3","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":"f0eefea8bd094ac1551704843e52a99e33c2f36909447acd7b028364f0aa0fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-08-06T14:21:26Z","title_canon_sha256":"bc0c4bd2daa2daaccebec0701ad9a5ae9df90a9b8802736270ef5ae79ff0bcd9"},"schema_version":"1.0","source":{"id":"2008.02679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.02679","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"arxiv_version","alias_value":"2008.02679v2","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.02679","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_12","alias_value":"GGROESJWAEDK","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_16","alias_value":"GGROESJWAEDKJAB4","created_at":"2026-07-05T01:56:55Z"},{"alias_kind":"pith_short_8","alias_value":"GGROESJW","created_at":"2026-07-05T01:56:55Z"}],"graph_snapshots":[{"event_id":"sha256:b3a5103c8fa0184a9bb884ed56a9e248ea609c9fa37095fc771f677ab129a3b3","target":"graph","created_at":"2026-07-05T01:56:55Z","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/2008.02679/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In general, two-agent decision-making problems can be modeled as a two-player game, and a typical solution is to find a Nash equilibrium in such game. Counterfactual regret minimization (CFR) is a well-known method to find a Nash equilibrium strategy in a two-player zero-sum game with imperfect information. The CFR method adopts a regret matching algorithm iteratively to reduce regret values progressively, enabling the average strategy to approach a Nash equilibrium. Although CFR-based methods have achieved significant success in the field of imperfect information games, there is still scope f","authors_text":"Fengwei Jia, Huale Li, Jiajia Zhang, Shuhan Qi, Xuan Wang, Yang Liu, Yulin Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-08-06T14:21:26Z","title":"Solving imperfect-information games via exponential counterfactual regret minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.02679","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:1a61a7a741f1d627f98b20fc3ca7612ecbb20fd691f74e034a96d5e93a02a96a","target":"record","created_at":"2026-07-05T01:56:55Z","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":"f0eefea8bd094ac1551704843e52a99e33c2f36909447acd7b028364f0aa0fd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-08-06T14:21:26Z","title_canon_sha256":"bc0c4bd2daa2daaccebec0701ad9a5ae9df90a9b8802736270ef5ae79ff0bcd9"},"schema_version":"1.0","source":{"id":"2008.02679","kind":"arxiv","version":2}},"canonical_sha256":"31a2e249360106a4803cffc452108baef800d7d004a3b860566d9a5e496be30e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31a2e249360106a4803cffc452108baef800d7d004a3b860566d9a5e496be30e","first_computed_at":"2026-07-05T01:56:55.696586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:56:55.696586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OCgSZrr7ZNIhLo2AFN24PjrQ8ABXmgbULJnxzbsbbV5855yyqZ4I33mGDz7CYGPOFEH7dZ7w5H8QN7CdkRATBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:56:55.697044Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.02679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a61a7a741f1d627f98b20fc3ca7612ecbb20fd691f74e034a96d5e93a02a96a","sha256:b3a5103c8fa0184a9bb884ed56a9e248ea609c9fa37095fc771f677ab129a3b3"],"state_sha256":"d4381782c1c2183f6502e12a460740218ab56ebe1c822f72c9d94e49814fcc51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3g+AnagiYnlfjejd/uLCdvYnnCor6U8bgLWBXvQpwHeOur0Kp5HnB/fW32Jz74/9ONCTB7MMrfHIksbEbdXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:10:31.936496Z","bundle_sha256":"04c12881c3259a49fde02221022a43799d464c745fe7e55889743f27bdce35a7"}}