{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:L57FN4GLGNPK63TBER55EGP7B5","short_pith_number":"pith:L57FN4GL","canonical_record":{"source":{"id":"2104.10845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T03:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"9b7626a83b2df0f7df0dd5eb4649d14c8e59c91459c55b0d20420d84a0ab1f17","abstract_canon_sha256":"dfb532fb12dc5efa79183c9f22cb659da2edb14e61e5adb10ae252e58a13dec4"},"schema_version":"1.0"},"canonical_sha256":"5f7e56f0cb335eaf6e61247bd219ff0f548594d22225671b560dd7702910a83c","source":{"kind":"arxiv","id":"2104.10845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.10845","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"2104.10845v1","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10845","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"L57FN4GLGNPK","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_16","alias_value":"L57FN4GLGNPK63TB","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_8","alias_value":"L57FN4GL","created_at":"2026-07-05T02:34:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:L57FN4GLGNPK63TBER55EGP7B5","target":"record","payload":{"canonical_record":{"source":{"id":"2104.10845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T03:24:23Z","cross_cats_sorted":[],"title_canon_sha256":"9b7626a83b2df0f7df0dd5eb4649d14c8e59c91459c55b0d20420d84a0ab1f17","abstract_canon_sha256":"dfb532fb12dc5efa79183c9f22cb659da2edb14e61e5adb10ae252e58a13dec4"},"schema_version":"1.0"},"canonical_sha256":"5f7e56f0cb335eaf6e61247bd219ff0f548594d22225671b560dd7702910a83c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:14.797366Z","signature_b64":"lH6BJtjnx438zogWAsybLXTA5hWm/M+DuSCWq1ls5EuKY4zonYXhA4fyrclNs+JyL0uN2XxsAiFinkB/OCpqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f7e56f0cb335eaf6e61247bd219ff0f548594d22225671b560dd7702910a83c","last_reissued_at":"2026-07-05T02:34:14.796877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:14.796877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.10845","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-07-05T02:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bU+hSCCGs6ZelVgIyzWDVuXmX/5OsdTc3ow+wUNhQX2JTwJO49t8wApzU8oyPC0ihK2IZdQfKpXvsSOh2grABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:52:05.973051Z"},"content_sha256":"ae40a4d632a396e0be69f3e9d23f7845c879d7c324e215bf5168cdfb94dc0c59","schema_version":"1.0","event_id":"sha256:ae40a4d632a396e0be69f3e9d23f7845c879d7c324e215bf5168cdfb94dc0c59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:L57FN4GLGNPK63TBER55EGP7B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimize Neural Fictitious Self-Play in Regret Minimization Thinking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gang Pan, Li Zhang, Shijian Li, Yuxuan Chen","submitted_at":"2021-04-22T03:24:23Z","abstract_excerpt":"Optimization of deep learning algorithms to approach Nash Equilibrium remains a significant problem in imperfect information games, e.g. StarCraft and poker. Neural Fictitious Self-Play (NFSP) has provided an effective way to learn approximate Nash Equilibrium without prior domain knowledge in imperfect information games. However, optimality gap was left as an optimization problem of NFSP and by solving the problem, the performance of NFSP could be improved. In this study, focusing on the optimality gap of NFSP, we have proposed a new method replacing NFSP's best response computation with regr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10845","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.10845/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-05T02:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fw7Nu8EUyDY/NfwOe4FYqImt9zHGirZn39fPD06lJdq5tSgFocYD6WDJ4vaf0LoP1eyNHh5Wp1xR8/zR/YeZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:52:05.974896Z"},"content_sha256":"64767b2d099a9be559b98abad49eda695f9906db8526772803181910a2ff766d","schema_version":"1.0","event_id":"sha256:64767b2d099a9be559b98abad49eda695f9906db8526772803181910a2ff766d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L57FN4GLGNPK63TBER55EGP7B5/bundle.json","state_url":"https://pith.science/pith/L57FN4GLGNPK63TBER55EGP7B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L57FN4GLGNPK63TBER55EGP7B5/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-08-06T21:52:05Z","links":{"resolver":"https://pith.science/pith/L57FN4GLGNPK63TBER55EGP7B5","bundle":"https://pith.science/pith/L57FN4GLGNPK63TBER55EGP7B5/bundle.json","state":"https://pith.science/pith/L57FN4GLGNPK63TBER55EGP7B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L57FN4GLGNPK63TBER55EGP7B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:L57FN4GLGNPK63TBER55EGP7B5","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":"dfb532fb12dc5efa79183c9f22cb659da2edb14e61e5adb10ae252e58a13dec4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T03:24:23Z","title_canon_sha256":"9b7626a83b2df0f7df0dd5eb4649d14c8e59c91459c55b0d20420d84a0ab1f17"},"schema_version":"1.0","source":{"id":"2104.10845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.10845","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"2104.10845v1","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10845","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"L57FN4GLGNPK","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_16","alias_value":"L57FN4GLGNPK63TB","created_at":"2026-07-05T02:34:14Z"},{"alias_kind":"pith_short_8","alias_value":"L57FN4GL","created_at":"2026-07-05T02:34:14Z"}],"graph_snapshots":[{"event_id":"sha256:64767b2d099a9be559b98abad49eda695f9906db8526772803181910a2ff766d","target":"graph","created_at":"2026-07-05T02:34:14Z","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/2104.10845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimization of deep learning algorithms to approach Nash Equilibrium remains a significant problem in imperfect information games, e.g. StarCraft and poker. Neural Fictitious Self-Play (NFSP) has provided an effective way to learn approximate Nash Equilibrium without prior domain knowledge in imperfect information games. However, optimality gap was left as an optimization problem of NFSP and by solving the problem, the performance of NFSP could be improved. In this study, focusing on the optimality gap of NFSP, we have proposed a new method replacing NFSP's best response computation with regr","authors_text":"Gang Pan, Li Zhang, Shijian Li, Yuxuan Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T03:24:23Z","title":"Optimize Neural Fictitious Self-Play in Regret Minimization Thinking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10845","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:ae40a4d632a396e0be69f3e9d23f7845c879d7c324e215bf5168cdfb94dc0c59","target":"record","created_at":"2026-07-05T02:34:14Z","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":"dfb532fb12dc5efa79183c9f22cb659da2edb14e61e5adb10ae252e58a13dec4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-04-22T03:24:23Z","title_canon_sha256":"9b7626a83b2df0f7df0dd5eb4649d14c8e59c91459c55b0d20420d84a0ab1f17"},"schema_version":"1.0","source":{"id":"2104.10845","kind":"arxiv","version":1}},"canonical_sha256":"5f7e56f0cb335eaf6e61247bd219ff0f548594d22225671b560dd7702910a83c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f7e56f0cb335eaf6e61247bd219ff0f548594d22225671b560dd7702910a83c","first_computed_at":"2026-07-05T02:34:14.796877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:14.796877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lH6BJtjnx438zogWAsybLXTA5hWm/M+DuSCWq1ls5EuKY4zonYXhA4fyrclNs+JyL0uN2XxsAiFinkB/OCpqBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:14.797366Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.10845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae40a4d632a396e0be69f3e9d23f7845c879d7c324e215bf5168cdfb94dc0c59","sha256:64767b2d099a9be559b98abad49eda695f9906db8526772803181910a2ff766d"],"state_sha256":"f7ff3616d5f88764db85b9d4f03ba88156e8289b0927e63c52ce167b5ab3aba8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eA8uJc2l/bo08Hhmv13/L8sbQw3NCrFhehn7TXGG16L5WepzTcOeMzrfrkH20ctzKzchoktClb1UNZZ0GksCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:52:05.983066Z","bundle_sha256":"80f4078513f7d3023247afc60b03bbbffa003a4e52105a182a1b9e6647ecc4ef"}}