{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:XC3ZGKZYD7YSLEG76N3EHVSWEN","short_pith_number":"pith:XC3ZGKZY","schema_version":"1.0","canonical_sha256":"b8b7932b381ff12590dff37643d6562375f47dcce3d3b7975d557ecd82536e01","source":{"kind":"arxiv","id":"2210.04110","version":1},"attestation_state":"computed","paper":{"title":"Optimization frameworks and sensitivity analysis of Stackelberg mean-field games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anran Hu, Jiacheng Zhang, Xin Guo","submitted_at":"2022-10-08T21:48:25Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2210.04110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-10-08T21:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"6e5822a9ad6ad35df18289589aa4a04a212d7db6a32976898a8152465c2026cd","abstract_canon_sha256":"966453b83bf930c567f7fa5668f547f4d7685175a8bea6760b964b188e2e84e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:35.892972Z","signature_b64":"9mfr/HqcIlizQUGYYfQPyAjobmtxrC3yi+rSDAU4AS0dfX5PH7oSIW2hwoEpO3jM8mPjuo5M9bFOepY3cAT4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8b7932b381ff12590dff37643d6562375f47dcce3d3b7975d557ecd82536e01","last_reissued_at":"2026-07-05T05:04:35.892491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:35.892491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization frameworks and sensitivity analysis of Stackelberg mean-field games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anran Hu, Jiacheng Zhang, Xin Guo","submitted_at":"2022-10-08T21:48:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04110","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04110/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.04110","created_at":"2026-07-05T05:04:35.892546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04110v1","created_at":"2026-07-05T05:04:35.892546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04110","created_at":"2026-07-05T05:04:35.892546+00:00"},{"alias_kind":"pith_short_12","alias_value":"XC3ZGKZYD7YS","created_at":"2026-07-05T05:04:35.892546+00:00"},{"alias_kind":"pith_short_16","alias_value":"XC3ZGKZYD7YSLEG7","created_at":"2026-07-05T05:04:35.892546+00:00"},{"alias_kind":"pith_short_8","alias_value":"XC3ZGKZY","created_at":"2026-07-05T05:04:35.892546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.01039","citing_title":"Approximation of Discrete-Time Infinite-Horizon Mean-Field Equilibria via Finite-Horizon Mean-Field Equilibria","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN","json":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN.json","graph_json":"https://pith.science/api/pith-number/XC3ZGKZYD7YSLEG76N3EHVSWEN/graph.json","events_json":"https://pith.science/api/pith-number/XC3ZGKZYD7YSLEG76N3EHVSWEN/events.json","paper":"https://pith.science/paper/XC3ZGKZY"},"agent_actions":{"view_html":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN","download_json":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN.json","view_paper":"https://pith.science/paper/XC3ZGKZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04110&json=true","fetch_graph":"https://pith.science/api/pith-number/XC3ZGKZYD7YSLEG76N3EHVSWEN/graph.json","fetch_events":"https://pith.science/api/pith-number/XC3ZGKZYD7YSLEG76N3EHVSWEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN/action/storage_attestation","attest_author":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN/action/author_attestation","sign_citation":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN/action/citation_signature","submit_replication":"https://pith.science/pith/XC3ZGKZYD7YSLEG76N3EHVSWEN/action/replication_record"}},"created_at":"2026-07-05T05:04:35.892546+00:00","updated_at":"2026-07-05T05:04:35.892546+00:00"}