{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:F4VKEYX765ZK6E6VEEJDK7CCSM","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":"9a924ce2467d778094e62a43517127d66117241254e6be55a3d43e4df905a147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","title_canon_sha256":"b013eab58a03a769aa515a17cee852ea409659debf7f167781c5091d2bdf7a74"},"schema_version":"1.0","source":{"id":"2108.02144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.02144","created_at":"2026-07-05T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2108.02144v1","created_at":"2026-07-05T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02144","created_at":"2026-07-05T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"F4VKEYX765ZK","created_at":"2026-07-05T03:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"F4VKEYX765ZK6E6V","created_at":"2026-07-05T03:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"F4VKEYX7","created_at":"2026-07-05T03:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:1b3c03d4647f45b3472917780c303d8682379e1553b09aaaec73865a51161fc8","target":"graph","created_at":"2026-07-05T03:03:22Z","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/2108.02144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider a distributed learning problem in a subnetwork zero-sum game, where agents are competing in different subnetworks. These agents are connected through time-varying graphs where each agent has its own cost function and can receive information from its neighbors. We propose a distributed mirror descent algorithm for computing a Nash equilibrium and establish a sublinear regret bound on the sequence of iterates when the graphs are uniformly strongly connected and the cost functions are convex-concave. Moreover, we prove its convergence with suitably selected diminishing ","authors_text":"Jie Chen, Jinlong Lei, Shijie Huang, Uday V. Shanbhag, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","title":"No-regret distributed learning in subnetwork zero-sum games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02144","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:5cf2f1d39120936d3fdcf25f36b470cfb9111c4747643c215bbab392b407b391","target":"record","created_at":"2026-07-05T03:03:22Z","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":"9a924ce2467d778094e62a43517127d66117241254e6be55a3d43e4df905a147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","title_canon_sha256":"b013eab58a03a769aa515a17cee852ea409659debf7f167781c5091d2bdf7a74"},"schema_version":"1.0","source":{"id":"2108.02144","kind":"arxiv","version":1}},"canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","first_computed_at":"2026-07-05T03:03:22.035424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:22.035424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"piylu7Nrsaqqvy2n21oDMcrGt5mLENKLVxMLHZ8eTlbhi38Up8pjg95K9Q03HvzgBRwpizlyOe9mAp7Glk+EBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:22.035865Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.02144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf2f1d39120936d3fdcf25f36b470cfb9111c4747643c215bbab392b407b391","sha256:1b3c03d4647f45b3472917780c303d8682379e1553b09aaaec73865a51161fc8"],"state_sha256":"678ae3abbb35b81c0a314af0d3ae839d352587d23d7eb51ccda05637117f57cf"}