{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DTI7CXT7BUTUB3QP27WXDRK6Y6","short_pith_number":"pith:DTI7CXT7","canonical_record":{"source":{"id":"2203.14126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:12:40Z","cross_cats_sorted":["cs.LG","econ.TH"],"title_canon_sha256":"aedee11076f2a34fa8db52ada30fc98953d617b8ddccc8b79f103069fd1cfffa","abstract_canon_sha256":"e57c4b69303750c5102d09c58ad51f4ec72f809a1b27a71babaecdf0b1c6762d"},"schema_version":"1.0"},"canonical_sha256":"1cd1f15e7f0d2740ee0fd7ed71c55ec79e0ee3931fd2e8391858ac3d507e14d9","source":{"kind":"arxiv","id":"2203.14126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.14126","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"2203.14126v2","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14126","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"DTI7CXT7BUTU","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_16","alias_value":"DTI7CXT7BUTUB3QP","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_8","alias_value":"DTI7CXT7","created_at":"2026-07-05T04:14:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DTI7CXT7BUTUB3QP27WXDRK6Y6","target":"record","payload":{"canonical_record":{"source":{"id":"2203.14126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:12:40Z","cross_cats_sorted":["cs.LG","econ.TH"],"title_canon_sha256":"aedee11076f2a34fa8db52ada30fc98953d617b8ddccc8b79f103069fd1cfffa","abstract_canon_sha256":"e57c4b69303750c5102d09c58ad51f4ec72f809a1b27a71babaecdf0b1c6762d"},"schema_version":"1.0"},"canonical_sha256":"1cd1f15e7f0d2740ee0fd7ed71c55ec79e0ee3931fd2e8391858ac3d507e14d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:14:42.538602Z","signature_b64":"H29OlXbZECg+SY3jOan7ZxwbFDRRScq3zSR5HYffo3ug5CnE8ZPHgln/mWUPHdcJ7OG/DKtOckcKjkgLFu1BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd1f15e7f0d2740ee0fd7ed71c55ec79e0ee3931fd2e8391858ac3d507e14d9","last_reissued_at":"2026-07-05T04:14:42.538160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:14:42.538160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.14126","source_version":2,"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-07-05T04:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mz0o5g5iGjufNCbw5Rm42Nx6LV5IBcpFK2927BdN+u/eVaD90aPtW7ONe2yRaT7lWflexrsCwuNlE/1DEcP+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:57:13.032129Z"},"content_sha256":"fac524422d57d2006585c44f8edd55b772f0b154e0497701d79fa0736cb7652b","schema_version":"1.0","event_id":"sha256:fac524422d57d2006585c44f8edd55b772f0b154e0497701d79fa0736cb7652b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DTI7CXT7BUTUB3QP27WXDRK6Y6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust No-Regret Learning in Min-Max Stackelberg Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"Amy Greenwald, Denizalp Goktas, Jiayi Zhao","submitted_at":"2022-03-26T18:12:40Z","abstract_excerpt":"The behavior of no-regret learning algorithms is well understood in two-player min-max (i.e, zero-sum) games. In this paper, we investigate the behavior of no-regret learning in min-max games with dependent strategy sets, where the strategy of the first player constrains the behavior of the second. Such games are best understood as sequential, i.e., min-max Stackelberg, games. We consider two settings, one in which only the first player chooses their actions using a no-regret algorithm while the second player best responds, and one in which both players use no-regret algorithms. For the former"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14126","kind":"arxiv","version":2},"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/2203.14126/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"},"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-07-05T04:14:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZ3JmK8+mep4E6RgCm2kNrl15OkS7V1GPoeeox6weI1EsfV/bZFCWq2de48TTFVDcD/biXt5e0qRrQ43fw2BAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T01:57:13.032787Z"},"content_sha256":"0d78852077313fbe19ce4ce4cc89f6f61d17631ca831f0a44fde8e29c726afac","schema_version":"1.0","event_id":"sha256:0d78852077313fbe19ce4ce4cc89f6f61d17631ca831f0a44fde8e29c726afac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/bundle.json","state_url":"https://pith.science/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/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-08-14T01:57:13Z","links":{"resolver":"https://pith.science/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6","bundle":"https://pith.science/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/bundle.json","state":"https://pith.science/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTI7CXT7BUTUB3QP27WXDRK6Y6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DTI7CXT7BUTUB3QP27WXDRK6Y6","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":"e57c4b69303750c5102d09c58ad51f4ec72f809a1b27a71babaecdf0b1c6762d","cross_cats_sorted":["cs.LG","econ.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:12:40Z","title_canon_sha256":"aedee11076f2a34fa8db52ada30fc98953d617b8ddccc8b79f103069fd1cfffa"},"schema_version":"1.0","source":{"id":"2203.14126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.14126","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"2203.14126v2","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14126","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"DTI7CXT7BUTU","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_16","alias_value":"DTI7CXT7BUTUB3QP","created_at":"2026-07-05T04:14:42Z"},{"alias_kind":"pith_short_8","alias_value":"DTI7CXT7","created_at":"2026-07-05T04:14:42Z"}],"graph_snapshots":[{"event_id":"sha256:0d78852077313fbe19ce4ce4cc89f6f61d17631ca831f0a44fde8e29c726afac","target":"graph","created_at":"2026-07-05T04:14:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.14126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The behavior of no-regret learning algorithms is well understood in two-player min-max (i.e, zero-sum) games. In this paper, we investigate the behavior of no-regret learning in min-max games with dependent strategy sets, where the strategy of the first player constrains the behavior of the second. Such games are best understood as sequential, i.e., min-max Stackelberg, games. We consider two settings, one in which only the first player chooses their actions using a no-regret algorithm while the second player best responds, and one in which both players use no-regret algorithms. For the former","authors_text":"Amy Greenwald, Denizalp Goktas, Jiayi Zhao","cross_cats":["cs.LG","econ.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:12:40Z","title":"Robust No-Regret Learning in Min-Max Stackelberg Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14126","kind":"arxiv","version":2},"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:fac524422d57d2006585c44f8edd55b772f0b154e0497701d79fa0736cb7652b","target":"record","created_at":"2026-07-05T04:14:42Z","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":"e57c4b69303750c5102d09c58ad51f4ec72f809a1b27a71babaecdf0b1c6762d","cross_cats_sorted":["cs.LG","econ.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-03-26T18:12:40Z","title_canon_sha256":"aedee11076f2a34fa8db52ada30fc98953d617b8ddccc8b79f103069fd1cfffa"},"schema_version":"1.0","source":{"id":"2203.14126","kind":"arxiv","version":2}},"canonical_sha256":"1cd1f15e7f0d2740ee0fd7ed71c55ec79e0ee3931fd2e8391858ac3d507e14d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd1f15e7f0d2740ee0fd7ed71c55ec79e0ee3931fd2e8391858ac3d507e14d9","first_computed_at":"2026-07-05T04:14:42.538160Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:14:42.538160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H29OlXbZECg+SY3jOan7ZxwbFDRRScq3zSR5HYffo3ug5CnE8ZPHgln/mWUPHdcJ7OG/DKtOckcKjkgLFu1BDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:14:42.538602Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.14126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fac524422d57d2006585c44f8edd55b772f0b154e0497701d79fa0736cb7652b","sha256:0d78852077313fbe19ce4ce4cc89f6f61d17631ca831f0a44fde8e29c726afac"],"state_sha256":"427ba3e4f6db00fd29867099c2cad38004e89dd65569353f1ef8342bc280c60d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kL0RkB4wDLCtwu/IblqohuR0xEW0CNuYfLfTtRGinJV6boMDOel4VHes+Zebcb1r3BPKXjYJHFI8T6pQYKmAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T01:57:13.036604Z","bundle_sha256":"5f1efbfb817d2b0d902457a3159108eed7299a615a8fcc2ecae5faf2e59cac44"}}