{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OHKF2IPBB4OSEKAKTNBQ5LNQFQ","short_pith_number":"pith:OHKF2IPB","schema_version":"1.0","canonical_sha256":"71d45d21e10f1d22280a9b430eadb02c1c6a660fa7d3b68b5b925406517160b9","source":{"kind":"arxiv","id":"1810.11542","version":2},"attestation_state":"computed","paper":{"title":"Revisiting CFR+ and Alternating Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Schmid, Matej Moravcik, Neil Burch","submitted_at":"2018-10-26T21:56:06Z","abstract_excerpt":"The CFR+ algorithm for solving imperfect information games is a variant of the popular CFR algorithm, with faster empirical performance on a range of problems. It was introduced with a theoretical upper bound on solution error, but subsequent work showed an error in one step of the proof. We provide updated proofs to recover the original bound."},"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":"1810.11542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-10-26T21:56:06Z","cross_cats_sorted":[],"title_canon_sha256":"08299ec404ef3e38b7a9b7a46535554896d614f19c88f37545ec69f1364c6f98","abstract_canon_sha256":"3b881a9511d300d2bada46445fae2ab342e53c201e49280e08fd5569ad90d1e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:09.126481Z","signature_b64":"kcWc4kyq6acaZKIM+vgPVenLcrN0zTo8Pik4wvJH+KWPcI8zIF+++Lg2K64YGKZuxbtP/hst4jMyJC6+m9W8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d45d21e10f1d22280a9b430eadb02c1c6a660fa7d3b68b5b925406517160b9","last_reissued_at":"2026-05-17T23:53:09.125776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:09.125776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting CFR+ and Alternating Updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Martin Schmid, Matej Moravcik, Neil Burch","submitted_at":"2018-10-26T21:56:06Z","abstract_excerpt":"The CFR+ algorithm for solving imperfect information games is a variant of the popular CFR algorithm, with faster empirical performance on a range of problems. It was introduced with a theoretical upper bound on solution error, but subsequent work showed an error in one step of the proof. We provide updated proofs to recover the original bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11542","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":""},"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":"1810.11542","created_at":"2026-05-17T23:53:09.125894+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11542v2","created_at":"2026-05-17T23:53:09.125894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11542","created_at":"2026-05-17T23:53:09.125894+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHKF2IPBB4OS","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHKF2IPBB4OSEKAK","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHKF2IPB","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ","json":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ.json","graph_json":"https://pith.science/api/pith-number/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/graph.json","events_json":"https://pith.science/api/pith-number/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/events.json","paper":"https://pith.science/paper/OHKF2IPB"},"agent_actions":{"view_html":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ","download_json":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ.json","view_paper":"https://pith.science/paper/OHKF2IPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11542&json=true","fetch_graph":"https://pith.science/api/pith-number/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/action/storage_attestation","attest_author":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/action/author_attestation","sign_citation":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/action/citation_signature","submit_replication":"https://pith.science/pith/OHKF2IPBB4OSEKAKTNBQ5LNQFQ/action/replication_record"}},"created_at":"2026-05-17T23:53:09.125894+00:00","updated_at":"2026-05-17T23:53:09.125894+00:00"}