{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6IV3NX4Q2NOR2C2ANZW2M7ECXN","short_pith_number":"pith:6IV3NX4Q","canonical_record":{"source":{"id":"1907.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"fa5fb5e52ff5fc1ceb9170c6b56b80cf11f338aa810869afb4085ca36eaa5e2d","abstract_canon_sha256":"00c7c87df4df2e36d5b203a4648ab9b64b6d9534a5100f2603ba4c1ef2be866c"},"schema_version":"1.0"},"canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","source":{"kind":"arxiv","id":"1907.07144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07144","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07144v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07144","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"6IV3NX4Q2NOR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6IV3NX4Q2NOR2C2A","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6IV3NX4Q","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6IV3NX4Q2NOR2C2ANZW2M7ECXN","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"fa5fb5e52ff5fc1ceb9170c6b56b80cf11f338aa810869afb4085ca36eaa5e2d","abstract_canon_sha256":"00c7c87df4df2e36d5b203a4648ab9b64b6d9534a5100f2603ba4c1ef2be866c"},"schema_version":"1.0"},"canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:27.887348Z","signature_b64":"hTa5EiLyfKuUc/krxaag5iNO3WKoUIWeXJeyT29At2bDVZyFPS71133Wjks2dWyN1lz58xWXZVnMXW70WoApCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","last_reissued_at":"2026-05-17T23:40:27.886542Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:27.886542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07144","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-05-17T23:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7CvcVG7ZD5/kzaT+75RQeSwcs0Pgt/t9WeGsmDI0x6DdS2UXo/6yq9TMPV3NF7qv7B6Fz1RfPxuoKqNsbPgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:32:14.700155Z"},"content_sha256":"0d235357f1fdb2f93a35085a2f0172dbeb58b6818e84bef21d86660421dc9c21","schema_version":"1.0","event_id":"sha256:0d235357f1fdb2f93a35085a2f0172dbeb58b6818e84bef21d86660421dc9c21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6IV3NX4Q2NOR2C2ANZW2M7ECXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Tatiana Tatarenko","submitted_at":"2019-07-15T12:22:46Z","abstract_excerpt":"We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has access to her own smooth local cost function and can communicate to her neighbors in some undirected graph. We consider a distributed communication-based gradient algorithm. For this procedure, we prove geometric convergence to a Nash equilibrium. In contrast to our previous works [15], [16], where the proposed algorithms required two parameters to be set up and the analysis was based on a so called augmented game mapp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07144","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":""},"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-17T23:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfsUOHXGvlkrAm+xMtFIW+pW6/sNlp2sYQfxT+Wz6oULaEWNybgkQn7VaxSsOp2QXr1pL/u/ra6dwe5EYQUVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:32:14.700537Z"},"content_sha256":"78bfbb8733e9fd92948140e9caa1b7ec0fdb3b46f7c955d989df3a582f561be8","schema_version":"1.0","event_id":"sha256:78bfbb8733e9fd92948140e9caa1b7ec0fdb3b46f7c955d989df3a582f561be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/bundle.json","state_url":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/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-05-28T04:32:14Z","links":{"resolver":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN","bundle":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/bundle.json","state":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6IV3NX4Q2NOR2C2ANZW2M7ECXN","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":"00c7c87df4df2e36d5b203a4648ab9b64b6d9534a5100f2603ba4c1ef2be866c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","title_canon_sha256":"fa5fb5e52ff5fc1ceb9170c6b56b80cf11f338aa810869afb4085ca36eaa5e2d"},"schema_version":"1.0","source":{"id":"1907.07144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07144","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07144v1","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07144","created_at":"2026-05-17T23:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"6IV3NX4Q2NOR","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6IV3NX4Q2NOR2C2A","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6IV3NX4Q","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:78bfbb8733e9fd92948140e9caa1b7ec0fdb3b46f7c955d989df3a582f561be8","target":"graph","created_at":"2026-05-17T23:40:27Z","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":"We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has access to her own smooth local cost function and can communicate to her neighbors in some undirected graph. We consider a distributed communication-based gradient algorithm. For this procedure, we prove geometric convergence to a Nash equilibrium. In contrast to our previous works [15], [16], where the proposed algorithms required two parameters to be set up and the analysis was based on a so called augmented game mapp","authors_text":"Angelia Nedich, Tatiana Tatarenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","title":"Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07144","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:0d235357f1fdb2f93a35085a2f0172dbeb58b6818e84bef21d86660421dc9c21","target":"record","created_at":"2026-05-17T23:40:27Z","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":"00c7c87df4df2e36d5b203a4648ab9b64b6d9534a5100f2603ba4c1ef2be866c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","title_canon_sha256":"fa5fb5e52ff5fc1ceb9170c6b56b80cf11f338aa810869afb4085ca36eaa5e2d"},"schema_version":"1.0","source":{"id":"1907.07144","kind":"arxiv","version":1}},"canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","first_computed_at":"2026-05-17T23:40:27.886542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:27.886542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hTa5EiLyfKuUc/krxaag5iNO3WKoUIWeXJeyT29At2bDVZyFPS71133Wjks2dWyN1lz58xWXZVnMXW70WoApCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:27.887348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d235357f1fdb2f93a35085a2f0172dbeb58b6818e84bef21d86660421dc9c21","sha256:78bfbb8733e9fd92948140e9caa1b7ec0fdb3b46f7c955d989df3a582f561be8"],"state_sha256":"2d9eebc1aba89d0d5e7825997eb878d78bb8b1c91efb959a1068d523b10785ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Wf7z1+6adc+UqgGjh9SVGhRMByV7ntJaVYlLlsM1ZUv+/+0aCezVHlNPxcJUACivG6JgiW+ed8/wbTxSBy9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:32:14.702519Z","bundle_sha256":"4c2639fbdcd983bfb922755489cd70f5eb83e7d26f494a17fa1a2cd4fcf2135a"}}