{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QXXOMWIYHEJGTEZMSDPKSXG7R6","short_pith_number":"pith:QXXOMWIY","canonical_record":{"source":{"id":"1312.7050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"dae4a9f240f185fb79d625630a7df466d46ff248f35070670c83420ebbf5af7a","abstract_canon_sha256":"60a95c5ce51c5f08c44534da561896395ff80b69008cbf73f976e91d384f8430"},"schema_version":"1.0"},"canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","source":{"kind":"arxiv","id":"1312.7050","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7050","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7050v2","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7050","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"QXXOMWIYHEJG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXXOMWIYHEJGTEZM","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXXOMWIY","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QXXOMWIYHEJGTEZMSDPKSXG7R6","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"dae4a9f240f185fb79d625630a7df466d46ff248f35070670c83420ebbf5af7a","abstract_canon_sha256":"60a95c5ce51c5f08c44534da561896395ff80b69008cbf73f976e91d384f8430"},"schema_version":"1.0"},"canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.893874Z","signature_b64":"aUXAbTRGsC5yU+G18mgrdKjd2V8ALitbZR1nOEcu0k1CDdwniMm/dMyCPw3ZTZua5ZyK3oCy+K7Nktg3lEydCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","last_reissued_at":"2026-05-18T01:25:55.893076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.893076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7050","source_version":2,"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-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxYcg5oD58VoXg3aGkoJAceowO8kzh6FuRi90MBf9gJbUtU35u20WOwC0abdKYdl+PKBvZ4MEAslT230DjKgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:26:39.979383Z"},"content_sha256":"a2d137ba00692adb5bc0c0d03aec478ea32368cd33ce1f9e95370e2db218d9bc","schema_version":"1.0","event_id":"sha256:a2d137ba00692adb5bc0c0d03aec478ea32368cd33ce1f9e95370e2db218d9bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QXXOMWIYHEJGTEZMSDPKSXG7R6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Guodong Shi, Karl Henrik Johansson, Lihua Xie, Yiguang Hong, Youcheng Lou","submitted_at":"2013-12-26T04:19:12Z","abstract_excerpt":"In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7050","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T01:25:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzHcIqELaA2nHv/2J7j12Vzs0eiQhxQH1V9dJWRz54pgWCLa20g8sl7PeoTp7WkH9m00R/bXHOTkdVtvnCndCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:26:39.979724Z"},"content_sha256":"ec4d615c3c729514aa171ba71aa20f36ac3c3daa9adcc8c1fb880bd3aa8e6cad","schema_version":"1.0","event_id":"sha256:ec4d615c3c729514aa171ba71aa20f36ac3c3daa9adcc8c1fb880bd3aa8e6cad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/bundle.json","state_url":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/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-06-30T20:26:39Z","links":{"resolver":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6","bundle":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/bundle.json","state":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QXXOMWIYHEJGTEZMSDPKSXG7R6","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":"60a95c5ce51c5f08c44534da561896395ff80b69008cbf73f976e91d384f8430","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","title_canon_sha256":"dae4a9f240f185fb79d625630a7df466d46ff248f35070670c83420ebbf5af7a"},"schema_version":"1.0","source":{"id":"1312.7050","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7050","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7050v2","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7050","created_at":"2026-05-18T01:25:55Z"},{"alias_kind":"pith_short_12","alias_value":"QXXOMWIYHEJG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXXOMWIYHEJGTEZM","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXXOMWIY","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:ec4d615c3c729514aa171ba71aa20f36ac3c3daa9adcc8c1fb880bd3aa8e6cad","target":"graph","created_at":"2026-05-18T01:25:55Z","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"},"paper":{"abstract_excerpt":"In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilib","authors_text":"Guodong Shi, Karl Henrik Johansson, Lihua Xie, Yiguang Hong, Youcheng Lou","cross_cats":["cs.GT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","title":"Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7050","kind":"arxiv","version":2},"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:a2d137ba00692adb5bc0c0d03aec478ea32368cd33ce1f9e95370e2db218d9bc","target":"record","created_at":"2026-05-18T01:25:55Z","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":"60a95c5ce51c5f08c44534da561896395ff80b69008cbf73f976e91d384f8430","cross_cats_sorted":["cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","title_canon_sha256":"dae4a9f240f185fb79d625630a7df466d46ff248f35070670c83420ebbf5af7a"},"schema_version":"1.0","source":{"id":"1312.7050","kind":"arxiv","version":2}},"canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","first_computed_at":"2026-05-18T01:25:55.893076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:55.893076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aUXAbTRGsC5yU+G18mgrdKjd2V8ALitbZR1nOEcu0k1CDdwniMm/dMyCPw3ZTZua5ZyK3oCy+K7Nktg3lEydCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:55.893874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7050","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2d137ba00692adb5bc0c0d03aec478ea32368cd33ce1f9e95370e2db218d9bc","sha256:ec4d615c3c729514aa171ba71aa20f36ac3c3daa9adcc8c1fb880bd3aa8e6cad"],"state_sha256":"27ef770ea9714f17174e5ec33c7c01faf3b9101fd1f297c0dd1dc9d8ec36b5b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYkM263TvwRwvUCe13BQFS+iO8HkE4ANhdDr1+1ndgBnjWkPxFjNenAPQd29H5vWJIGpcI5+BDPh9vO/ED1ACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:26:39.981544Z","bundle_sha256":"c6772435e1314034d7d3d0e053a025c3f4243585624b400f3f4ba8ca4af1fa4d"}}