{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:XC3ZGKZYD7YSLEG76N3EHVSWEN","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":"966453b83bf930c567f7fa5668f547f4d7685175a8bea6760b964b188e2e84e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-08T21:48:25Z","title_canon_sha256":"6e5822a9ad6ad35df18289589aa4a04a212d7db6a32976898a8152465c2026cd"},"schema_version":"1.0","source":{"id":"2210.04110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.04110","created_at":"2026-07-05T05:04:35Z"},{"alias_kind":"arxiv_version","alias_value":"2210.04110v1","created_at":"2026-07-05T05:04:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04110","created_at":"2026-07-05T05:04:35Z"},{"alias_kind":"pith_short_12","alias_value":"XC3ZGKZYD7YS","created_at":"2026-07-05T05:04:35Z"},{"alias_kind":"pith_short_16","alias_value":"XC3ZGKZYD7YSLEG7","created_at":"2026-07-05T05:04:35Z"},{"alias_kind":"pith_short_8","alias_value":"XC3ZGKZY","created_at":"2026-07-05T05:04:35Z"}],"graph_snapshots":[{"event_id":"sha256:bac49a748aadccef9eef7000f007f7e0e12cd60f41435e7d47549a89ccaffa25","target":"graph","created_at":"2026-07-05T05:04:35Z","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/2210.04110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper proposes and studies a class of discrete-time finite-time-horizon Stackelberg mean-field games, with one leader and an infinite number of identical and indistinguishable followers. In this game, the objective of the leader is to maximize her reward considering the worst-case cost over all possible $\\epsilon$-Nash equilibria among followers. A new analytical paradigm is established by showing the equivalence between this Stackelberg mean-field game and a minimax optimization problem. This optimization framework facilitates studying both analytically and numerically the set of Nash eq","authors_text":"Anran Hu, Jiacheng Zhang, Xin Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-08T21:48:25Z","title":"Optimization frameworks and sensitivity analysis of Stackelberg mean-field games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04110","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:77ce4aa6be5ee1e58975eaee7007ee6c5137ad2c396df3f146268ef2fd8128e0","target":"record","created_at":"2026-07-05T05:04:35Z","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":"966453b83bf930c567f7fa5668f547f4d7685175a8bea6760b964b188e2e84e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-08T21:48:25Z","title_canon_sha256":"6e5822a9ad6ad35df18289589aa4a04a212d7db6a32976898a8152465c2026cd"},"schema_version":"1.0","source":{"id":"2210.04110","kind":"arxiv","version":1}},"canonical_sha256":"b8b7932b381ff12590dff37643d6562375f47dcce3d3b7975d557ecd82536e01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8b7932b381ff12590dff37643d6562375f47dcce3d3b7975d557ecd82536e01","first_computed_at":"2026-07-05T05:04:35.892491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:35.892491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9mfr/HqcIlizQUGYYfQPyAjobmtxrC3yi+rSDAU4AS0dfX5PH7oSIW2hwoEpO3jM8mPjuo5M9bFOepY3cAT4CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:35.892972Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.04110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77ce4aa6be5ee1e58975eaee7007ee6c5137ad2c396df3f146268ef2fd8128e0","sha256:bac49a748aadccef9eef7000f007f7e0e12cd60f41435e7d47549a89ccaffa25"],"state_sha256":"56772d4a7a009b8813096f77b98175c678b5887d12f7523bd0e175d63a11a062"}