{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SEVBORW6CJYENCBN62X3SLGHIP","short_pith_number":"pith:SEVBORW6","schema_version":"1.0","canonical_sha256":"912a1746de127046882df6afb92cc743c818447324d3f4fb77ab1103ab8ac9c1","source":{"kind":"arxiv","id":"2308.11256","version":2},"attestation_state":"computed","paper":{"title":"Efficient Last-iterate Convergence Algorithms in Solving Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Bo An, Linjian Meng, Shangdong Yang, Tianpei Yang, Tianyu Ding, Wenbin Li, Yang Gao, Youzhi Zhang, Zhenxing Ge","submitted_at":"2023-08-22T07:59:49Z","abstract_excerpt":"To establish last-iterate convergence for Counterfactual Regret Minimization (CFR) algorithms in learning a Nash equilibrium (NE) of extensive-form games (EFGs), recent studies reformulate learning an NE of the original EFG as learning the NEs of a sequence of (perturbed) regularized EFGs. Consequently, proving last-iterate convergence in solving the original EFG reduces to proving last-iterate convergence in solving (perturbed) regularized EFGs. However, the empirical convergence rates of the algorithms in these studies are suboptimal, since they do not utilize Regret Matching (RM)-based CFR "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2308.11256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-08-22T07:59:49Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"167ad29419b2d4fc7488cabb3b29e3b1a77e711806c48ff3986bb5f81c27eb31","abstract_canon_sha256":"af072a35aeb84d5382daef7a1d7bc3d6ee1211a0ee94e11d77d25b8d4817d699"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:30.520397Z","signature_b64":"rkJCDz+aJ9I+eG9z1g4Z5vXmE9L3gdiVUsLLiVutvbLciSHyBJnc0xGRQeac+IUcWhGORqPdGh4GPZ1SdVBhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"912a1746de127046882df6afb92cc743c818447324d3f4fb77ab1103ab8ac9c1","last_reissued_at":"2026-07-05T10:33:30.519679Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:30.519679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Last-iterate Convergence Algorithms in Solving Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Bo An, Linjian Meng, Shangdong Yang, Tianpei Yang, Tianyu Ding, Wenbin Li, Yang Gao, Youzhi Zhang, Zhenxing Ge","submitted_at":"2023-08-22T07:59:49Z","abstract_excerpt":"To establish last-iterate convergence for Counterfactual Regret Minimization (CFR) algorithms in learning a Nash equilibrium (NE) of extensive-form games (EFGs), recent studies reformulate learning an NE of the original EFG as learning the NEs of a sequence of (perturbed) regularized EFGs. Consequently, proving last-iterate convergence in solving the original EFG reduces to proving last-iterate convergence in solving (perturbed) regularized EFGs. However, the empirical convergence rates of the algorithms in these studies are suboptimal, since they do not utilize Regret Matching (RM)-based CFR "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11256","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/2308.11256/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.11256","created_at":"2026-07-05T10:33:30.519788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.11256v2","created_at":"2026-07-05T10:33:30.519788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11256","created_at":"2026-07-05T10:33:30.519788+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEVBORW6CJYE","created_at":"2026-07-05T10:33:30.519788+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEVBORW6CJYENCBN","created_at":"2026-07-05T10:33:30.519788+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEVBORW6","created_at":"2026-07-05T10:33:30.519788+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.07699","citing_title":"Last-Iterate Convergence in Adaptive Regret Minimization for Approximate Extensive-Form Perfect Equilibrium","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP","json":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP.json","graph_json":"https://pith.science/api/pith-number/SEVBORW6CJYENCBN62X3SLGHIP/graph.json","events_json":"https://pith.science/api/pith-number/SEVBORW6CJYENCBN62X3SLGHIP/events.json","paper":"https://pith.science/paper/SEVBORW6"},"agent_actions":{"view_html":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP","download_json":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP.json","view_paper":"https://pith.science/paper/SEVBORW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.11256&json=true","fetch_graph":"https://pith.science/api/pith-number/SEVBORW6CJYENCBN62X3SLGHIP/graph.json","fetch_events":"https://pith.science/api/pith-number/SEVBORW6CJYENCBN62X3SLGHIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP/action/storage_attestation","attest_author":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP/action/author_attestation","sign_citation":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP/action/citation_signature","submit_replication":"https://pith.science/pith/SEVBORW6CJYENCBN62X3SLGHIP/action/replication_record"}},"created_at":"2026-07-05T10:33:30.519788+00:00","updated_at":"2026-07-05T10:33:30.519788+00:00"}