{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AGQGOAQWKH5QMH5HKUNAYHESA4","short_pith_number":"pith:AGQGOAQW","canonical_record":{"source":{"id":"1205.0622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-03T05:54:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c39dcd9d5a3881509331f48b71e8018329812d03ce183dbbfa7bff04753d269e","abstract_canon_sha256":"544823763da58680ace23a78c9322488e5f3e9a39e9c78500e7791c581fd6da2"},"schema_version":"1.0"},"canonical_sha256":"01a067021651fb061fa7551a0c1c92071e1bd8e10fa6286d5e903ad47801e9b8","source":{"kind":"arxiv","id":"1205.0622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0622","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0622v1","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0622","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"AGQGOAQWKH5Q","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AGQGOAQWKH5QMH5H","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AGQGOAQW","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AGQGOAQWKH5QMH5HKUNAYHESA4","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-03T05:54:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c39dcd9d5a3881509331f48b71e8018329812d03ce183dbbfa7bff04753d269e","abstract_canon_sha256":"544823763da58680ace23a78c9322488e5f3e9a39e9c78500e7791c581fd6da2"},"schema_version":"1.0"},"canonical_sha256":"01a067021651fb061fa7551a0c1c92071e1bd8e10fa6286d5e903ad47801e9b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:25.384307Z","signature_b64":"TsBVy5j/G2ICRAeY6BBx7HL9hwFAwJBR/hMaZrfRt/zsRUGTS7KMGKAb4ZFU+jqPeXo2AP554LmrO/WFIk+PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01a067021651fb061fa7551a0c1c92071e1bd8e10fa6286d5e903ad47801e9b8","last_reissued_at":"2026-05-18T03:56:25.383667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:25.383667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0622","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-18T03:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BvX7a2Iq9h/fWMridHeqKQmpbmdhXQghGbiTzdQUUCax2m3jv6MFaRhy/wPXW+xqlFcOdFBeU/zJk2chTnOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:29:57.106720Z"},"content_sha256":"9cd4429876b38c1047b7030a046783378b9cfcd541cf4d274c0bec38f0f21d5c","schema_version":"1.0","event_id":"sha256:9cd4429876b38c1047b7030a046783378b9cfcd541cf4d274c0bec38f0f21d5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AGQGOAQWKH5QMH5HKUNAYHESA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No-Regret Learning in Extensive-Form Games with Imperfect Recall","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Marc Lanctot, Martin Zinkevich, Michael Bowling, Neil Burch, Richard Gibson","submitted_at":"2012-05-03T05:54:14Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR) is an efficient no-regret learning algorithm for decision problems modeled as extensive games. CFR's regret bounds depend on the requirement of perfect recall: players always remember information that was revealed to them and the order in which it was revealed. In games without perfect recall, however, CFR's guarantees do not apply. In this paper, we present the first regret bound for CFR when applied to a general class of games with imperfect recall. In addition, we show that CFR applied to any abstraction belonging to our general class results in a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0622","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-18T03:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXUSjaYuHQfrdqQ65IvG74lOn/08CXS+BCKndbyuX9MQ8bCdFXIA1UxNCyiC5auFhJ9yGC9u3lfoktkiyfUhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:29:57.107903Z"},"content_sha256":"7b99e86dfe6dc87e3615d90414cbdbe8f918ba173aab6c0a54700723e615a3f5","schema_version":"1.0","event_id":"sha256:7b99e86dfe6dc87e3615d90414cbdbe8f918ba173aab6c0a54700723e615a3f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/bundle.json","state_url":"https://pith.science/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/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-06-11T03:29:57Z","links":{"resolver":"https://pith.science/pith/AGQGOAQWKH5QMH5HKUNAYHESA4","bundle":"https://pith.science/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/bundle.json","state":"https://pith.science/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGQGOAQWKH5QMH5HKUNAYHESA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AGQGOAQWKH5QMH5HKUNAYHESA4","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":"544823763da58680ace23a78c9322488e5f3e9a39e9c78500e7791c581fd6da2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-03T05:54:14Z","title_canon_sha256":"c39dcd9d5a3881509331f48b71e8018329812d03ce183dbbfa7bff04753d269e"},"schema_version":"1.0","source":{"id":"1205.0622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0622","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0622v1","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0622","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"AGQGOAQWKH5Q","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AGQGOAQWKH5QMH5H","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AGQGOAQW","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:7b99e86dfe6dc87e3615d90414cbdbe8f918ba173aab6c0a54700723e615a3f5","target":"graph","created_at":"2026-05-18T03:56:25Z","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 an efficient no-regret learning algorithm for decision problems modeled as extensive games. CFR's regret bounds depend on the requirement of perfect recall: players always remember information that was revealed to them and the order in which it was revealed. In games without perfect recall, however, CFR's guarantees do not apply. In this paper, we present the first regret bound for CFR when applied to a general class of games with imperfect recall. In addition, we show that CFR applied to any abstraction belonging to our general class results in a re","authors_text":"Marc Lanctot, Martin Zinkevich, Michael Bowling, Neil Burch, Richard Gibson","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-03T05:54:14Z","title":"No-Regret Learning in Extensive-Form Games with Imperfect Recall"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0622","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:9cd4429876b38c1047b7030a046783378b9cfcd541cf4d274c0bec38f0f21d5c","target":"record","created_at":"2026-05-18T03:56:25Z","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":"544823763da58680ace23a78c9322488e5f3e9a39e9c78500e7791c581fd6da2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-05-03T05:54:14Z","title_canon_sha256":"c39dcd9d5a3881509331f48b71e8018329812d03ce183dbbfa7bff04753d269e"},"schema_version":"1.0","source":{"id":"1205.0622","kind":"arxiv","version":1}},"canonical_sha256":"01a067021651fb061fa7551a0c1c92071e1bd8e10fa6286d5e903ad47801e9b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01a067021651fb061fa7551a0c1c92071e1bd8e10fa6286d5e903ad47801e9b8","first_computed_at":"2026-05-18T03:56:25.383667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:25.383667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TsBVy5j/G2ICRAeY6BBx7HL9hwFAwJBR/hMaZrfRt/zsRUGTS7KMGKAb4ZFU+jqPeXo2AP554LmrO/WFIk+PDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:25.384307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cd4429876b38c1047b7030a046783378b9cfcd541cf4d274c0bec38f0f21d5c","sha256:7b99e86dfe6dc87e3615d90414cbdbe8f918ba173aab6c0a54700723e615a3f5"],"state_sha256":"c5b1abd61c83955314d72f8586309bc5386064153830f09137a2c16c0a8c0f45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UFzD4/21X/wR8YYO8zXCVoJf9RKcg4nupUHB5PruwyK5EFhsDwLWEKYvTKCkOVL1umkVI+bmLqDMYkFbwhIBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:29:57.112072Z","bundle_sha256":"b6c572ad00d448a1f02ee8a07056e17d02b0f79e747e57d0cbfa300d045a47a2"}}