{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BEHDKPTSXAYJQLPNZX7DGMWKSQ","short_pith_number":"pith:BEHDKPTS","canonical_record":{"source":{"id":"1810.04433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T09:24:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7c7a8a08c660b729a7da8348b8b2e43457d2b8cefd2ffbbf1b9341d617f8aec4","abstract_canon_sha256":"7b8d4d6736b223db75db7ba41df8762cbf35d6568aed5a7cd0bfaf8124a743f6"},"schema_version":"1.0"},"canonical_sha256":"090e353e72b830982dedcdfe3332ca940ca9bf266698d09711a500e65a30a977","source":{"kind":"arxiv","id":"1810.04433","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04433","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04433v3","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04433","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"BEHDKPTSXAYJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BEHDKPTSXAYJQLPN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BEHDKPTS","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BEHDKPTSXAYJQLPNZX7DGMWKSQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T09:24:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7c7a8a08c660b729a7da8348b8b2e43457d2b8cefd2ffbbf1b9341d617f8aec4","abstract_canon_sha256":"7b8d4d6736b223db75db7ba41df8762cbf35d6568aed5a7cd0bfaf8124a743f6"},"schema_version":"1.0"},"canonical_sha256":"090e353e72b830982dedcdfe3332ca940ca9bf266698d09711a500e65a30a977","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:31.089429Z","signature_b64":"do6gKoHCp67eGdyq8zMThqiS3Ln5MwmizX49hBULPl+uyO88WVWGgl+Zx8BtRs5HZWnybZEwNjVoOBPrJsKCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"090e353e72b830982dedcdfe3332ca940ca9bf266698d09711a500e65a30a977","last_reissued_at":"2026-05-17T23:57:31.088793Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:31.088793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04433","source_version":3,"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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaWj1q1UQpgYt1zTSUwwn9Awz8c5s10yhTPwUaZtbO+NVjHqRqZKVjEclxqBHSbM8Zj69loQmjBYVo6XLsJDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:44:22.640351Z"},"content_sha256":"cb70b1d08a0eec8bfabffbf69fc77ec5fd01937a55462c6e8664975e41c6291d","schema_version":"1.0","event_id":"sha256:cb70b1d08a0eec8bfabffbf69fc77ec5fd01937a55462c6e8664975e41c6291d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BEHDKPTSXAYJQLPNZX7DGMWKSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lazy-CFR: fast and near optimal regret minimization for extensive games with imperfect information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dong Yan, Jialian Li, Jun Zhu, Tongzheng Ren, Yichi Zhou","submitted_at":"2018-10-10T09:24:39Z","abstract_excerpt":"Counterfactual regret minimization (CFR) is the most popular algorithm on solving two-player zero-sum extensive games with imperfect information and achieves state-of-the-art performance in practice. However, the performance of CFR is not fully understood, since empirical results on the regret are much better than the upper bound proved in \\cite{zinkevich2008regret}. Another issue is that CFR has to traverse the whole game tree in each round, which is time-consuming in large scale games. In this paper, we present a novel technique, lazy update, which can avoid traversing the whole game tree in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04433","kind":"arxiv","version":3},"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:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iXWLjh0JMb26ohL3HtfL740X8yLqx8sYuoKpTRYWVE7k3qZ06g1A/NodNGGmKgxNG0HlVsEgsrS7iw4KAwPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:44:22.640706Z"},"content_sha256":"c967233e687aa23fdd6a352b182ada364b2c095b26268750e091769be10d3989","schema_version":"1.0","event_id":"sha256:c967233e687aa23fdd6a352b182ada364b2c095b26268750e091769be10d3989"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/bundle.json","state_url":"https://pith.science/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/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-05-30T08:44:22Z","links":{"resolver":"https://pith.science/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ","bundle":"https://pith.science/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/bundle.json","state":"https://pith.science/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BEHDKPTSXAYJQLPNZX7DGMWKSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BEHDKPTSXAYJQLPNZX7DGMWKSQ","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":"7b8d4d6736b223db75db7ba41df8762cbf35d6568aed5a7cd0bfaf8124a743f6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T09:24:39Z","title_canon_sha256":"7c7a8a08c660b729a7da8348b8b2e43457d2b8cefd2ffbbf1b9341d617f8aec4"},"schema_version":"1.0","source":{"id":"1810.04433","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04433","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04433v3","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04433","created_at":"2026-05-17T23:57:31Z"},{"alias_kind":"pith_short_12","alias_value":"BEHDKPTSXAYJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BEHDKPTSXAYJQLPN","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BEHDKPTS","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:c967233e687aa23fdd6a352b182ada364b2c095b26268750e091769be10d3989","target":"graph","created_at":"2026-05-17T23:57:31Z","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 (CFR) is the most popular algorithm on solving two-player zero-sum extensive games with imperfect information and achieves state-of-the-art performance in practice. However, the performance of CFR is not fully understood, since empirical results on the regret are much better than the upper bound proved in \\cite{zinkevich2008regret}. Another issue is that CFR has to traverse the whole game tree in each round, which is time-consuming in large scale games. In this paper, we present a novel technique, lazy update, which can avoid traversing the whole game tree in","authors_text":"Dong Yan, Jialian Li, Jun Zhu, Tongzheng Ren, Yichi Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T09:24:39Z","title":"Lazy-CFR: fast and near optimal regret minimization for extensive games with imperfect information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04433","kind":"arxiv","version":3},"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:cb70b1d08a0eec8bfabffbf69fc77ec5fd01937a55462c6e8664975e41c6291d","target":"record","created_at":"2026-05-17T23:57:31Z","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":"7b8d4d6736b223db75db7ba41df8762cbf35d6568aed5a7cd0bfaf8124a743f6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-10T09:24:39Z","title_canon_sha256":"7c7a8a08c660b729a7da8348b8b2e43457d2b8cefd2ffbbf1b9341d617f8aec4"},"schema_version":"1.0","source":{"id":"1810.04433","kind":"arxiv","version":3}},"canonical_sha256":"090e353e72b830982dedcdfe3332ca940ca9bf266698d09711a500e65a30a977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"090e353e72b830982dedcdfe3332ca940ca9bf266698d09711a500e65a30a977","first_computed_at":"2026-05-17T23:57:31.088793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:31.088793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"do6gKoHCp67eGdyq8zMThqiS3Ln5MwmizX49hBULPl+uyO88WVWGgl+Zx8BtRs5HZWnybZEwNjVoOBPrJsKCCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:31.089429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04433","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb70b1d08a0eec8bfabffbf69fc77ec5fd01937a55462c6e8664975e41c6291d","sha256:c967233e687aa23fdd6a352b182ada364b2c095b26268750e091769be10d3989"],"state_sha256":"8f0336b7a2201037523f3984f9f0674ad2fa7762d73bbe8ccbeec5c2436b8eb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQQwJQE/cs55p51Oax8TpvxJDA0+pb5tnICvHZ2AK3Ka+zpDU0XerTuLRa7CQGG7/sf9s4U1zwZyhdlCpd/9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:44:22.642788Z","bundle_sha256":"2c8da16e0eb35f60527851e82ecf58bcf52b54fb6dddf223099688013bb016ee"}}