{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:47HAXLX5AQBATN6KZCT6GRMKDP","short_pith_number":"pith:47HAXLX5","canonical_record":{"source":{"id":"1711.03441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-09T16:05:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"01c6c963af64d62c7cee184deadcccdab2f64733d71a96ae9162e04d4b5a9ead","abstract_canon_sha256":"b25615c3b0a51651bf56f1bc74f7335c689b9915b354c95e0d6483797dbbf157"},"schema_version":"1.0"},"canonical_sha256":"e7ce0baefd040209b7cac8a7e3458a1becbda5da6c9d858d84c1f7eaadf4751b","source":{"kind":"arxiv","id":"1711.03441","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03441","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03441v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03441","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"47HAXLX5AQBA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"47HAXLX5AQBATN6K","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"47HAXLX5","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:47HAXLX5AQBATN6KZCT6GRMKDP","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-09T16:05:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"01c6c963af64d62c7cee184deadcccdab2f64733d71a96ae9162e04d4b5a9ead","abstract_canon_sha256":"b25615c3b0a51651bf56f1bc74f7335c689b9915b354c95e0d6483797dbbf157"},"schema_version":"1.0"},"canonical_sha256":"e7ce0baefd040209b7cac8a7e3458a1becbda5da6c9d858d84c1f7eaadf4751b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.091940Z","signature_b64":"ddFNjbr/6jplTwV5KtGSswkvAhUctXlcnKtts8xyC845AS8yCvLoke490HtmGsyQruYe1HxM/MbXO0p4LK/NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7ce0baefd040209b7cac8a7e3458a1becbda5da6c9d858d84c1f7eaadf4751b","last_reissued_at":"2026-05-18T00:30:56.091285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.091285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03441","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-18T00:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIkSciv6lkplHZk+qqW/4ln/eR4qVZgoLM6/i0AK3nxZfANVtI61lHdXJqkVC2piiJrbz+iXYZV8P7zgyfrBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:06:37.976974Z"},"content_sha256":"3bbb40e95e6505aee3ec84b7ec0d0f99b581396b7efc927ed5f2a845abac6b02","schema_version":"1.0","event_id":"sha256:3bbb40e95e6505aee3ec84b7ec0d0f99b581396b7efc927ed5f2a845abac6b02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:47HAXLX5AQBATN6KZCT6GRMKDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret Minimization in Behaviorally-Constrained Zero-Sum Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","submitted_at":"2017-11-09T16:05:39Z","abstract_excerpt":"No-regret learning has emerged as a powerful tool for solving extensive-form games. This was facilitated by the counterfactual-regret minimization (CFR) framework, which relies on the instantiation of regret minimizers for simplexes at each information set of the game. We use an instantiation of the CFR framework to develop algorithms for solving behaviorally-constrained (and, as a special case, perturbed in the Selten sense) extensive-form games, which allows us to compute approximate Nash equilibrium refinements. Nash equilibrium refinements are motivated by a major deficiency in Nash equili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03441","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-18T00:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGlZO5eckT/LwRaeTqKjiZuz2WcbrSYi13rY3W/1XeChxBbZ6seqXcdnVwqPlnx72sJ0sh+yYtCkfVRT3ndgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:06:37.977347Z"},"content_sha256":"11a38fa29ccda360d6868975514977865500b173446de707d1e393968eda069d","schema_version":"1.0","event_id":"sha256:11a38fa29ccda360d6868975514977865500b173446de707d1e393968eda069d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47HAXLX5AQBATN6KZCT6GRMKDP/bundle.json","state_url":"https://pith.science/pith/47HAXLX5AQBATN6KZCT6GRMKDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47HAXLX5AQBATN6KZCT6GRMKDP/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-28T04:06:37Z","links":{"resolver":"https://pith.science/pith/47HAXLX5AQBATN6KZCT6GRMKDP","bundle":"https://pith.science/pith/47HAXLX5AQBATN6KZCT6GRMKDP/bundle.json","state":"https://pith.science/pith/47HAXLX5AQBATN6KZCT6GRMKDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47HAXLX5AQBATN6KZCT6GRMKDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:47HAXLX5AQBATN6KZCT6GRMKDP","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":"b25615c3b0a51651bf56f1bc74f7335c689b9915b354c95e0d6483797dbbf157","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-09T16:05:39Z","title_canon_sha256":"01c6c963af64d62c7cee184deadcccdab2f64733d71a96ae9162e04d4b5a9ead"},"schema_version":"1.0","source":{"id":"1711.03441","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03441","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03441v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03441","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"47HAXLX5AQBA","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"47HAXLX5AQBATN6K","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"47HAXLX5","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:11a38fa29ccda360d6868975514977865500b173446de707d1e393968eda069d","target":"graph","created_at":"2026-05-18T00:30:56Z","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":"No-regret learning has emerged as a powerful tool for solving extensive-form games. This was facilitated by the counterfactual-regret minimization (CFR) framework, which relies on the instantiation of regret minimizers for simplexes at each information set of the game. We use an instantiation of the CFR framework to develop algorithms for solving behaviorally-constrained (and, as a special case, perturbed in the Selten sense) extensive-form games, which allows us to compute approximate Nash equilibrium refinements. Nash equilibrium refinements are motivated by a major deficiency in Nash equili","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-09T16:05:39Z","title":"Regret Minimization in Behaviorally-Constrained Zero-Sum Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03441","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:3bbb40e95e6505aee3ec84b7ec0d0f99b581396b7efc927ed5f2a845abac6b02","target":"record","created_at":"2026-05-18T00:30:56Z","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":"b25615c3b0a51651bf56f1bc74f7335c689b9915b354c95e0d6483797dbbf157","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-09T16:05:39Z","title_canon_sha256":"01c6c963af64d62c7cee184deadcccdab2f64733d71a96ae9162e04d4b5a9ead"},"schema_version":"1.0","source":{"id":"1711.03441","kind":"arxiv","version":1}},"canonical_sha256":"e7ce0baefd040209b7cac8a7e3458a1becbda5da6c9d858d84c1f7eaadf4751b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7ce0baefd040209b7cac8a7e3458a1becbda5da6c9d858d84c1f7eaadf4751b","first_computed_at":"2026-05-18T00:30:56.091285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:56.091285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ddFNjbr/6jplTwV5KtGSswkvAhUctXlcnKtts8xyC845AS8yCvLoke490HtmGsyQruYe1HxM/MbXO0p4LK/NAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:56.091940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03441","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bbb40e95e6505aee3ec84b7ec0d0f99b581396b7efc927ed5f2a845abac6b02","sha256:11a38fa29ccda360d6868975514977865500b173446de707d1e393968eda069d"],"state_sha256":"c8374fed7b950dd707f9c488faa433de3eea8877e3ad1e58bb6179c25d853780"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDY0nAUisdvmoJF4HWNDuXtyJPHcEnwZGQ1/rPxcxgprbj8GETBru5c01owr21oN7NMvr4n+UOqRjg93z+a5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:06:37.979618Z","bundle_sha256":"4180fd20bcf54089577439b6bddfab33e794b6759296742188bbae63d4d1d41e"}}