{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q3I6VWP6RXTAXS43U42E2K4JOC","short_pith_number":"pith:Q3I6VWP6","canonical_record":{"source":{"id":"1811.00164","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-01T00:07:02Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"038e19988be18e71d067d3a8a879b8c39e769a8f2685423bb84428ae38bd1b2b","abstract_canon_sha256":"3cde50dff8cc463e399ddecb17410ffc3535b5f4baa930d30badbc2d39510fb9"},"schema_version":"1.0"},"canonical_sha256":"86d1ead9fe8de60bcb9ba7344d2b897095d994f7ead8b34aa0a35d02fc9490ff","source":{"kind":"arxiv","id":"1811.00164","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00164","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00164v3","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00164","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q3I6VWP6RXTA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q3I6VWP6RXTAXS43","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q3I6VWP6","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q3I6VWP6RXTAXS43U42E2K4JOC","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00164","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-01T00:07:02Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"038e19988be18e71d067d3a8a879b8c39e769a8f2685423bb84428ae38bd1b2b","abstract_canon_sha256":"3cde50dff8cc463e399ddecb17410ffc3535b5f4baa930d30badbc2d39510fb9"},"schema_version":"1.0"},"canonical_sha256":"86d1ead9fe8de60bcb9ba7344d2b897095d994f7ead8b34aa0a35d02fc9490ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:22.462900Z","signature_b64":"41dsSYkeu6U6JMaWr3MlLQ0ISLQy7Mu2wxUZqfBoWkN6hw+jpGT/cJIaewXKlMHtGnmgeCpKXOiKr9oYuBbFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86d1ead9fe8de60bcb9ba7344d2b897095d994f7ead8b34aa0a35d02fc9490ff","last_reissued_at":"2026-05-17T23:45:22.462550Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:22.462550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00164","source_version":3,"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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bi/Ps9KmNYILUnBGBC3pjp3HvJRsSDBFAEceFoNEPbLzK4UpUzNL7nmeMXkhmQ9Xcwn3JDuNysgiy9xCwZg5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:33:54.420682Z"},"content_sha256":"0493a31475820644105a4959a393b84f4c4c7a964d78e7ca92c98a935fb795fe","schema_version":"1.0","event_id":"sha256:0493a31475820644105a4959a393b84f4c4c7a964d78e7ca92c98a935fb795fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q3I6VWP6RXTAXS43U42E2K4JOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Counterfactual Regret Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.AI","authors_text":"Adam Lerer, Noam Brown, Sam Gross, Tuomas Sandholm","submitted_at":"2018-11-01T00:07:02Z","abstract_excerpt":"Counterfactual Regret Minimization (CFR) is the leading framework for solving large imperfect-information games. It converges to an equilibrium by iteratively traversing the game tree. In order to deal with extremely large games, abstraction is typically applied before running CFR. The abstracted game is solved with tabular CFR, and its solution is mapped back to the full game. This process can be problematic because aspects of abstraction are often manual and domain specific, abstraction algorithms may miss important strategic nuances of the game, and there is a chicken-and-egg problem becaus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00164","kind":"arxiv","version":3},"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:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glcUHFCAledcMGqBmvyeEUe9ArO0Ew6Oi5Ww+uzwlGw+GlBNxLYSNFIgn9dkCC+9/nkxf3CYK2iSjRmcxxYmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:33:54.421035Z"},"content_sha256":"0a40eaea003e30994ca887502a8c068236da4328a01b5891069b35a667a90451","schema_version":"1.0","event_id":"sha256:0a40eaea003e30994ca887502a8c068236da4328a01b5891069b35a667a90451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/bundle.json","state_url":"https://pith.science/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/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-04T00:33:54Z","links":{"resolver":"https://pith.science/pith/Q3I6VWP6RXTAXS43U42E2K4JOC","bundle":"https://pith.science/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/bundle.json","state":"https://pith.science/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3I6VWP6RXTAXS43U42E2K4JOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q3I6VWP6RXTAXS43U42E2K4JOC","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":"3cde50dff8cc463e399ddecb17410ffc3535b5f4baa930d30badbc2d39510fb9","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-01T00:07:02Z","title_canon_sha256":"038e19988be18e71d067d3a8a879b8c39e769a8f2685423bb84428ae38bd1b2b"},"schema_version":"1.0","source":{"id":"1811.00164","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00164","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00164v3","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00164","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"Q3I6VWP6RXTA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q3I6VWP6RXTAXS43","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q3I6VWP6","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:0a40eaea003e30994ca887502a8c068236da4328a01b5891069b35a667a90451","target":"graph","created_at":"2026-05-17T23:45:22Z","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 the leading framework for solving large imperfect-information games. It converges to an equilibrium by iteratively traversing the game tree. In order to deal with extremely large games, abstraction is typically applied before running CFR. The abstracted game is solved with tabular CFR, and its solution is mapped back to the full game. This process can be problematic because aspects of abstraction are often manual and domain specific, abstraction algorithms may miss important strategic nuances of the game, and there is a chicken-and-egg problem becaus","authors_text":"Adam Lerer, Noam Brown, Sam Gross, Tuomas Sandholm","cross_cats":["cs.GT","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-01T00:07:02Z","title":"Deep Counterfactual Regret Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00164","kind":"arxiv","version":3},"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:0493a31475820644105a4959a393b84f4c4c7a964d78e7ca92c98a935fb795fe","target":"record","created_at":"2026-05-17T23:45:22Z","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":"3cde50dff8cc463e399ddecb17410ffc3535b5f4baa930d30badbc2d39510fb9","cross_cats_sorted":["cs.GT","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-01T00:07:02Z","title_canon_sha256":"038e19988be18e71d067d3a8a879b8c39e769a8f2685423bb84428ae38bd1b2b"},"schema_version":"1.0","source":{"id":"1811.00164","kind":"arxiv","version":3}},"canonical_sha256":"86d1ead9fe8de60bcb9ba7344d2b897095d994f7ead8b34aa0a35d02fc9490ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86d1ead9fe8de60bcb9ba7344d2b897095d994f7ead8b34aa0a35d02fc9490ff","first_computed_at":"2026-05-17T23:45:22.462550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:22.462550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"41dsSYkeu6U6JMaWr3MlLQ0ISLQy7Mu2wxUZqfBoWkN6hw+jpGT/cJIaewXKlMHtGnmgeCpKXOiKr9oYuBbFDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:22.462900Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00164","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0493a31475820644105a4959a393b84f4c4c7a964d78e7ca92c98a935fb795fe","sha256:0a40eaea003e30994ca887502a8c068236da4328a01b5891069b35a667a90451"],"state_sha256":"e20bbcd8abe18864fc896b47f9377a9109511948e16fc06f2d31271e4f6ebd60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ucve+0a8R/mgy/NdMe1p9X1lgJtrUn6xHNDxiwcxToI5nQPoX55ur6QhomtGv122o+r1ocGUD8jdr7iMj+XpCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:33:54.423233Z","bundle_sha256":"fba8607d4b52edf3d5c55c2cae55e00ae2f040060335a3e6388d88b3f098bbd8"}}