{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TETIELRWFYU6M7PPPSZ5OACJ4E","short_pith_number":"pith:TETIELRW","canonical_record":{"source":{"id":"1902.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"de1d5db7d993ce81306c18bd04baf6569f393bebcdffda6aca44632b4eda483f","abstract_canon_sha256":"9739ea985625448bef1dd7ac40e28a68499a90a953db6f51226e8dd56f6a892e"},"schema_version":"1.0"},"canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","source":{"kind":"arxiv","id":"1902.04982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04982","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04982v1","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04982","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"TETIELRWFYU6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TETIELRWFYU6M7PP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TETIELRW","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TETIELRWFYU6M7PPPSZ5OACJ4E","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC","stat.ML"],"title_canon_sha256":"de1d5db7d993ce81306c18bd04baf6569f393bebcdffda6aca44632b4eda483f","abstract_canon_sha256":"9739ea985625448bef1dd7ac40e28a68499a90a953db6f51226e8dd56f6a892e"},"schema_version":"1.0"},"canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:03.743799Z","signature_b64":"+PIc3TfuBqA2uaTjPjLyCuVOHgRYQMxCaZfqscbxKHzc5c5FGnIa+8fPcGAVfwNciaAR09y4kGsXpksUhiMEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","last_reissued_at":"2026-05-17T23:54:03.743246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:03.743246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04982","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-05-17T23:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LQkdRdpEvIeLX1Xa5FY0HsKWmzTlW5Ika02G/+Z4qDkj+JG0mLinNZgr6TwW0u8BomXaaux/bivhkkOsHm/YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:32.562432Z"},"content_sha256":"b16ce48f495a5a88cfd5480adca5d0a94af5058605677c9054fe5b1e524e42f2","schema_version":"1.0","event_id":"sha256:b16ce48f495a5a88cfd5480adca5d0a94af5058605677c9054fe5b1e524e42f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TETIELRWFYU6M7PPPSZ5OACJ4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stable-Predictive Optimistic Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC","stat.ML"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Noam Brown, Tuomas Sandholm","submitted_at":"2019-02-13T16:18:21Z","abstract_excerpt":"The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number of iterations. In contrast, first-order methods can be used to achieve a $O(T^{-1})$ dependence on iterations, yet these methods have been less successful in practice. In this work we present the first CFR variant that breaks the square-root dependence on iterations. By combining and extending recent advances on predictive and stable regret "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04982","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":""},"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:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I9Fk3RUa0Hives8qonPYGdzs4jB5vJr+SrVAhMgqqvp3rQyyXd1tR1JJ/r3lfqULeiTTQCXjmTjJDWAYBRpDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:32:32.562797Z"},"content_sha256":"c8a2c9869f592291960c56e8bd542678e5e3626bb885eab22f80505e7275adde","schema_version":"1.0","event_id":"sha256:c8a2c9869f592291960c56e8bd542678e5e3626bb885eab22f80505e7275adde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/bundle.json","state_url":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/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-28T07:32:32Z","links":{"resolver":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E","bundle":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/bundle.json","state":"https://pith.science/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TETIELRWFYU6M7PPPSZ5OACJ4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TETIELRWFYU6M7PPPSZ5OACJ4E","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":"9739ea985625448bef1dd7ac40e28a68499a90a953db6f51226e8dd56f6a892e","cross_cats_sorted":["cs.AI","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","title_canon_sha256":"de1d5db7d993ce81306c18bd04baf6569f393bebcdffda6aca44632b4eda483f"},"schema_version":"1.0","source":{"id":"1902.04982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04982","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04982v1","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04982","created_at":"2026-05-17T23:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"TETIELRWFYU6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TETIELRWFYU6M7PP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TETIELRW","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c8a2c9869f592291960c56e8bd542678e5e3626bb885eab22f80505e7275adde","target":"graph","created_at":"2026-05-17T23:54:03Z","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":"The CFR framework has been a powerful tool for solving large-scale extensive-form games in practice. However, the theoretical rate at which past CFR-based algorithms converge to the Nash equilibrium is on the order of $O(T^{-1/2})$, where $T$ is the number of iterations. In contrast, first-order methods can be used to achieve a $O(T^{-1})$ dependence on iterations, yet these methods have been less successful in practice. In this work we present the first CFR variant that breaks the square-root dependence on iterations. By combining and extending recent advances on predictive and stable regret ","authors_text":"Christian Kroer, Gabriele Farina, Noam Brown, Tuomas Sandholm","cross_cats":["cs.AI","cs.LG","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","title":"Stable-Predictive Optimistic Counterfactual Regret Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04982","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:b16ce48f495a5a88cfd5480adca5d0a94af5058605677c9054fe5b1e524e42f2","target":"record","created_at":"2026-05-17T23:54:03Z","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":"9739ea985625448bef1dd7ac40e28a68499a90a953db6f51226e8dd56f6a892e","cross_cats_sorted":["cs.AI","cs.LG","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-02-13T16:18:21Z","title_canon_sha256":"de1d5db7d993ce81306c18bd04baf6569f393bebcdffda6aca44632b4eda483f"},"schema_version":"1.0","source":{"id":"1902.04982","kind":"arxiv","version":1}},"canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9926822e362e29e67def7cb3d70049e1330211da5b7b534e3fe6adf182e9a4c7","first_computed_at":"2026-05-17T23:54:03.743246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:03.743246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+PIc3TfuBqA2uaTjPjLyCuVOHgRYQMxCaZfqscbxKHzc5c5FGnIa+8fPcGAVfwNciaAR09y4kGsXpksUhiMEBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:03.743799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b16ce48f495a5a88cfd5480adca5d0a94af5058605677c9054fe5b1e524e42f2","sha256:c8a2c9869f592291960c56e8bd542678e5e3626bb885eab22f80505e7275adde"],"state_sha256":"cc212d9afd440211a9b1ff57ebe2c3ce78478b62697dc9969cc4d0bb396c49ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6vbwOvHXh0FXumjhXxTWPkliKftD1Cwj3o/QoEutWa8sAZ57PNPOMqQm6arA21Fz/yfgMSXBXgInUtlwuw4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:32:32.565120Z","bundle_sha256":"43e4fa904f9765e7a9c0f44d1c9409b0e43efd3a40f315857066a912fae4e204"}}