{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WGCY4XRINF5N2OSGAGEMF7KB3Z","short_pith_number":"pith:WGCY4XRI","schema_version":"1.0","canonical_sha256":"b1858e5e28697add3a460188c2fd41de70b7445f6b416b7ce4f3bc615ac64caf","source":{"kind":"arxiv","id":"2605.19928","version":1},"attestation_state":"computed","paper":{"title":"Real-Time Parallel Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Boning Li, Longbo Huang","submitted_at":"2026-05-19T14:49:30Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR) is the dominant algorithmic family for solving large imperfect-information games, underpinning breakthroughs such as Libratus and Pluribus in No-Limit Texas Hold'em poker. In real-time game-playing systems, the solver must compute a near-equilibrium strategy within a strict time budget of only a few seconds per decision, and the number of CFR iterations completed in this window directly determines play strength. We present \\textbf{Parallel CFR}, the first parallelization framework for real-time depth-limited CFR solving that seamlessly integrates prunin"},"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":"2605.19928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-05-19T14:49:30Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"295e1f77a0714ddd9f6a3e7a55252c564d0300a1510326c8dc11399776a6f7dc","abstract_canon_sha256":"d373490d4b2f432be034a455810254c7d3513576f506c1facc6eabaed27dc95d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T02:05:55.688092Z","signature_b64":"y9VcirPxiydT79JILHwQ+d0JvJ+XbaZumGKKh0VUFfibGlIV5ET9Pr7AwtSTfmulUf2nd/XkDAfE9fE0iNv0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1858e5e28697add3a460188c2fd41de70b7445f6b416b7ce4f3bc615ac64caf","last_reissued_at":"2026-05-20T02:05:55.687124Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T02:05:55.687124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Parallel Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Boning Li, Longbo Huang","submitted_at":"2026-05-19T14:49:30Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR) is the dominant algorithmic family for solving large imperfect-information games, underpinning breakthroughs such as Libratus and Pluribus in No-Limit Texas Hold'em poker. In real-time game-playing systems, the solver must compute a near-equilibrium strategy within a strict time budget of only a few seconds per decision, and the number of CFR iterations completed in this window directly determines play strength. We present \\textbf{Parallel CFR}, the first parallelization framework for real-time depth-limited CFR solving that seamlessly integrates prunin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19928","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19928/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":"2605.19928","created_at":"2026-05-20T02:05:55.687269+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19928v1","created_at":"2026-05-20T02:05:55.687269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19928","created_at":"2026-05-20T02:05:55.687269+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGCY4XRINF5N","created_at":"2026-05-20T02:05:55.687269+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGCY4XRINF5N2OSG","created_at":"2026-05-20T02:05:55.687269+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGCY4XRI","created_at":"2026-05-20T02:05:55.687269+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/WGCY4XRINF5N2OSGAGEMF7KB3Z","json":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z.json","graph_json":"https://pith.science/api/pith-number/WGCY4XRINF5N2OSGAGEMF7KB3Z/graph.json","events_json":"https://pith.science/api/pith-number/WGCY4XRINF5N2OSGAGEMF7KB3Z/events.json","paper":"https://pith.science/paper/WGCY4XRI"},"agent_actions":{"view_html":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z","download_json":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z.json","view_paper":"https://pith.science/paper/WGCY4XRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19928&json=true","fetch_graph":"https://pith.science/api/pith-number/WGCY4XRINF5N2OSGAGEMF7KB3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/WGCY4XRINF5N2OSGAGEMF7KB3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z/action/storage_attestation","attest_author":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z/action/author_attestation","sign_citation":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z/action/citation_signature","submit_replication":"https://pith.science/pith/WGCY4XRINF5N2OSGAGEMF7KB3Z/action/replication_record"}},"created_at":"2026-05-20T02:05:55.687269+00:00","updated_at":"2026-05-20T02:05:55.687269+00:00"}