{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DKFON3UKQHNSB3A3Z54ATKLGLS","short_pith_number":"pith:DKFON3UK","canonical_record":{"source":{"id":"1809.03075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-10T01:28:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"a95cec98f47c8a0e5c88221a24b274f9e52d5f24aab3631db789350028711523","abstract_canon_sha256":"edd236f1df2476b13d188da0bb66dcade1943a171e15d0573caf210b020b1fc1"},"schema_version":"1.0"},"canonical_sha256":"1a8ae6ee8a81db20ec1bcf7809a9665cae2eda391108fff7e2f83c70ae76044f","source":{"kind":"arxiv","id":"1809.03075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03075","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03075v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03075","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"DKFON3UKQHNS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKFON3UKQHNSB3A3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKFON3UK","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DKFON3UKQHNSB3A3Z54ATKLGLS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-10T01:28:24Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"a95cec98f47c8a0e5c88221a24b274f9e52d5f24aab3631db789350028711523","abstract_canon_sha256":"edd236f1df2476b13d188da0bb66dcade1943a171e15d0573caf210b020b1fc1"},"schema_version":"1.0"},"canonical_sha256":"1a8ae6ee8a81db20ec1bcf7809a9665cae2eda391108fff7e2f83c70ae76044f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.139768Z","signature_b64":"+VOGivbKiq3/HKoLz5gv4O/Gfzl0DzZ6Iu+LA3gw4ySE1uST1SVZDetq+OPDVnFxFlEdmAfofIuMm/gra0qQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a8ae6ee8a81db20ec1bcf7809a9665cae2eda391108fff7e2f83c70ae76044f","last_reissued_at":"2026-05-18T00:06:10.139109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.139109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03075","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXaPlsq78MXNJzsLJPv2pntQ/FGbWiKnAubzExsoNMs/1Gg63BwFUs4R92vq4k3Z98d07zsZpZ8KeF0Di6ApDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:02.150044Z"},"content_sha256":"d1e904f47dc889b7b102b2b19ef08b32869bd15fe27654e534ebebf4ef3ffbe9","schema_version":"1.0","event_id":"sha256:d1e904f47dc889b7b102b2b19ef08b32869bd15fe27654e534ebebf4ef3ffbe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DKFON3UKQHNSB3A3Z54ATKLGLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","submitted_at":"2018-09-10T01:28:24Z","abstract_excerpt":"Regret minimization is a powerful tool for solving large-scale extensive-form games. State-of-the-art methods rely on minimizing regret locally at each decision point. In this work we derive a new framework for regret minimization on sequential decision problems and extensive-form games with general compact convex sets at each decision point and general convex losses, as opposed to prior work which has been for simplex decision points and linear losses. We call our framework laminar regret decomposition. It generalizes the CFR algorithm to this more general setting. Furthermore, our framework "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03075","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FLq0PA/TLfBw5C1wFCeQTn9XeDizmPfQVIpvvcUl7m77fnNQ7K2wsPGRKuxkgckC/owSl7aeelEksTIusBrgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:02.150664Z"},"content_sha256":"27cc4f466639f8bd0a63e6cb6fcab630154a0d7e5b4ed19fba721002341df5b1","schema_version":"1.0","event_id":"sha256:27cc4f466639f8bd0a63e6cb6fcab630154a0d7e5b4ed19fba721002341df5b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/bundle.json","state_url":"https://pith.science/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/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-28T02:20:02Z","links":{"resolver":"https://pith.science/pith/DKFON3UKQHNSB3A3Z54ATKLGLS","bundle":"https://pith.science/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/bundle.json","state":"https://pith.science/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DKFON3UKQHNSB3A3Z54ATKLGLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DKFON3UKQHNSB3A3Z54ATKLGLS","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":"edd236f1df2476b13d188da0bb66dcade1943a171e15d0573caf210b020b1fc1","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-10T01:28:24Z","title_canon_sha256":"a95cec98f47c8a0e5c88221a24b274f9e52d5f24aab3631db789350028711523"},"schema_version":"1.0","source":{"id":"1809.03075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03075","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03075v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03075","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"DKFON3UKQHNS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DKFON3UKQHNSB3A3","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DKFON3UK","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:27cc4f466639f8bd0a63e6cb6fcab630154a0d7e5b4ed19fba721002341df5b1","target":"graph","created_at":"2026-05-18T00:06:10Z","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":"Regret minimization is a powerful tool for solving large-scale extensive-form games. State-of-the-art methods rely on minimizing regret locally at each decision point. In this work we derive a new framework for regret minimization on sequential decision problems and extensive-form games with general compact convex sets at each decision point and general convex losses, as opposed to prior work which has been for simplex decision points and linear losses. We call our framework laminar regret decomposition. It generalizes the CFR algorithm to this more general setting. Furthermore, our framework ","authors_text":"Christian Kroer, Gabriele Farina, Tuomas Sandholm","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-10T01:28:24Z","title":"Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03075","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:d1e904f47dc889b7b102b2b19ef08b32869bd15fe27654e534ebebf4ef3ffbe9","target":"record","created_at":"2026-05-18T00:06:10Z","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":"edd236f1df2476b13d188da0bb66dcade1943a171e15d0573caf210b020b1fc1","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-09-10T01:28:24Z","title_canon_sha256":"a95cec98f47c8a0e5c88221a24b274f9e52d5f24aab3631db789350028711523"},"schema_version":"1.0","source":{"id":"1809.03075","kind":"arxiv","version":1}},"canonical_sha256":"1a8ae6ee8a81db20ec1bcf7809a9665cae2eda391108fff7e2f83c70ae76044f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a8ae6ee8a81db20ec1bcf7809a9665cae2eda391108fff7e2f83c70ae76044f","first_computed_at":"2026-05-18T00:06:10.139109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.139109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+VOGivbKiq3/HKoLz5gv4O/Gfzl0DzZ6Iu+LA3gw4ySE1uST1SVZDetq+OPDVnFxFlEdmAfofIuMm/gra0qQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.139768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1e904f47dc889b7b102b2b19ef08b32869bd15fe27654e534ebebf4ef3ffbe9","sha256:27cc4f466639f8bd0a63e6cb6fcab630154a0d7e5b4ed19fba721002341df5b1"],"state_sha256":"c0aed35ec01003e3596d90bdc4acf3ccceaa1018eaebfab76de2ffd0eadf8b9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zD0/6WXziBH1VSyR9E6NVA3bvH1/4QVMlQ+ywpWdt0eoMscVOWyzs5ohiQbNDkjqd6/FjCNb613kcPNPpnL+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:20:02.153496Z","bundle_sha256":"93ce54d921f48afc3a4f586155701884b5ef47eb1757c5c67e53318675ef1677"}}