{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FX533Z6D4IMPADJOINU7I2DRBO","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":"f8dded54aa68db44480562da9717a2f7cb39d6df40c8513cf6ef88971fa40834","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-29T13:42:52Z","title_canon_sha256":"d33de5655202ffc636408ffea07211845be6fc4f390fc665dd9dae562aefc64c"},"schema_version":"1.0","source":{"id":"2205.14662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14662","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14662v1","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14662","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_12","alias_value":"FX533Z6D4IMP","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_16","alias_value":"FX533Z6D4IMPADJO","created_at":"2026-07-05T04:27:19Z"},{"alias_kind":"pith_short_8","alias_value":"FX533Z6D","created_at":"2026-07-05T04:27:19Z"}],"graph_snapshots":[{"event_id":"sha256:e7721c054ee069b4b660044169a32d701b9dda9f6b36299f1f58de932b5ff348","target":"graph","created_at":"2026-07-05T04:27:19Z","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/2205.14662/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"No-regret learning has been widely used to compute a Nash equilibrium in two-person zero-sum games. However, there is still a lack of regret analysis for network stochastic zero-sum games, where players competing in two subnetworks only have access to some local information, and the cost functions include uncertainty. Such a game model can be found in security games, when a group of inspectors work together to detect a group of evaders. In this paper, we propose a distributed stochastic mirror descent (D-SMD) method, and establish the regret bounds $O(\\sqrt{T})$ and $O(\\log T)$ in the expected","authors_text":"Jinlong Lei, Shijie Huang, Yiguang Hong","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-29T13:42:52Z","title":"No-Regret Learning in Network Stochastic Zero-Sum Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14662","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:f68085922c6ce6dbe53a6cc3b4c69631bb6ea13e771ade96ed7f4d0206c0ca60","target":"record","created_at":"2026-07-05T04:27:19Z","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":"f8dded54aa68db44480562da9717a2f7cb39d6df40c8513cf6ef88971fa40834","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-05-29T13:42:52Z","title_canon_sha256":"d33de5655202ffc636408ffea07211845be6fc4f390fc665dd9dae562aefc64c"},"schema_version":"1.0","source":{"id":"2205.14662","kind":"arxiv","version":1}},"canonical_sha256":"2dfbbde7c3e218f00d2e4369f468710b835afe9e1d023db9ab5ad9a6536e0c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dfbbde7c3e218f00d2e4369f468710b835afe9e1d023db9ab5ad9a6536e0c85","first_computed_at":"2026-07-05T04:27:19.821249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:19.821249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6N9Hh43y/vLjkxgbwdq4KivXzTCtFtSkp87M5TkMEJW8yivlJ/JdqqGozmmL718lt4kRB7lquw8ZLg3OTRzBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:19.821716Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f68085922c6ce6dbe53a6cc3b4c69631bb6ea13e771ade96ed7f4d0206c0ca60","sha256:e7721c054ee069b4b660044169a32d701b9dda9f6b36299f1f58de932b5ff348"],"state_sha256":"087050a7daaee72838b893f5f8feaedac6a71ced95aacde4db677c4e44ba531f"}