{"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"}