{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:F4VKEYX765ZK6E6VEEJDK7CCSM","short_pith_number":"pith:F4VKEYX7","canonical_record":{"source":{"id":"2108.02144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"b013eab58a03a769aa515a17cee852ea409659debf7f167781c5091d2bdf7a74","abstract_canon_sha256":"9a924ce2467d778094e62a43517127d66117241254e6be55a3d43e4df905a147"},"schema_version":"1.0"},"canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","source":{"kind":"arxiv","id":"2108.02144","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:F4VKEYX765ZK6E6VEEJDK7CCSM","target":"record","payload":{"canonical_record":{"source":{"id":"2108.02144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"b013eab58a03a769aa515a17cee852ea409659debf7f167781c5091d2bdf7a74","abstract_canon_sha256":"9a924ce2467d778094e62a43517127d66117241254e6be55a3d43e4df905a147"},"schema_version":"1.0"},"canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:22.035865Z","signature_b64":"piylu7Nrsaqqvy2n21oDMcrGt5mLENKLVxMLHZ8eTlbhi38Up8pjg95K9Q03HvzgBRwpizlyOe9mAp7Glk+EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","last_reissued_at":"2026-07-05T03:03:22.035424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:22.035424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.02144","source_version":1,"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-05T03:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOleMlF2EfyZ02P3GpLf5Me0xDULoORKpcrcmh3fQIwmbK3HROK+MUWY/gpkHmu3PiUH7yhxRMnwb+eDgwpqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:02.073114Z"},"content_sha256":"5cf2f1d39120936d3fdcf25f36b470cfb9111c4747643c215bbab392b407b391","schema_version":"1.0","event_id":"sha256:5cf2f1d39120936d3fdcf25f36b470cfb9111c4747643c215bbab392b407b391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:F4VKEYX765ZK6E6VEEJDK7CCSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No-regret distributed learning in subnetwork zero-sum games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Shijie Huang, Uday V. Shanbhag, Yiguang Hong","submitted_at":"2021-08-04T16:15:32Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02144","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/2108.02144/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-05T03:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+h7J3T2Pox4Ny539Z82K/OPQSVvQhElXQWxw4FmJj8/cEEzDw6WiUs4Tm3M8NW3JP8oGgN7kOovz4asmdfUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:02.073507Z"},"content_sha256":"1b3c03d4647f45b3472917780c303d8682379e1553b09aaaec73865a51161fc8","schema_version":"1.0","event_id":"sha256:1b3c03d4647f45b3472917780c303d8682379e1553b09aaaec73865a51161fc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/bundle.json","state_url":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/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-07-07T13:36:02Z","links":{"resolver":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM","bundle":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/bundle.json","state":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/4z/vKPYi3Y9RBiZg5GuXrU8nrxUj3QmEfT5thnGx5qVdZe14LCa+phxlX0VkhLqY4ARE3LDGg7T2PXWU58Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:36:02.075487Z","bundle_sha256":"075ea4eb2a3b22e1ee55ab522c34fba033e95bc8a5eb737f4baa1b40e9fbf35f"}}