{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","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":"be75b9ffccb3b03dc3858aa51f4ab05c6e860390aa90b71026f4df9d14c699e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","title_canon_sha256":"48e7fb0bc559d023ede9394c4fceb01709df5c9b5ea9f7bff3bc75b9eec8af05"},"schema_version":"1.0","source":{"id":"1810.10891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10891","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10891v1","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10891","created_at":"2026-05-18T00:02:18Z"},{"alias_kind":"pith_short_12","alias_value":"JUUQ3E2JNTAE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUUQ3E2JNTAEC7BM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUUQ3E2J","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:b4781ab771cc52e3cebb488506d3fe10272206b76fe1542357786ed2e3c4c7ea","target":"graph","created_at":"2026-05-18T00:02:18Z","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":"This paper considers an $N$-player stochastic Nash game in which the $i$th player minimizes a composite objective $f_i(x) + r_i(x_i)$, where $f_i$ is expectation-valued and $r_i$ has an efficient prox-evaluation. In this context, we make the following contributions. (i) Under a strong monotonicity assumption on the concatenated gradient map, we derive ({\\bf optimal}) rate statements and oracle complexity bounds for the proposed variable sample-size proximal stochastic gradient-response (VS-PGR) scheme; (ii) We overlay (VS-PGR) with a consensus phase with a view towards developing distributed p","authors_text":"Jinlong Lei, Uday V. Shanbhag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","title":"Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10891","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:6878ce9d55c8d5852e14263bd92cf9c7b1bd9ebeeb1754e2b999a99a1b472fe3","target":"record","created_at":"2026-05-18T00:02:18Z","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":"be75b9ffccb3b03dc3858aa51f4ab05c6e860390aa90b71026f4df9d14c699e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","title_canon_sha256":"48e7fb0bc559d023ede9394c4fceb01709df5c9b5ea9f7bff3bc75b9eec8af05"},"schema_version":"1.0","source":{"id":"1810.10891","kind":"arxiv","version":1}},"canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","first_computed_at":"2026-05-18T00:02:18.918099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:18.918099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZckQP6v3354we6W7FMFA+wedlsikjR7hW0ZJcPVggEBi/RhCOEuKrdGrmPi6lAwUZ/WNvGk7G1PovkrdydDiCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:18.918693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6878ce9d55c8d5852e14263bd92cf9c7b1bd9ebeeb1754e2b999a99a1b472fe3","sha256:b4781ab771cc52e3cebb488506d3fe10272206b76fe1542357786ed2e3c4c7ea"],"state_sha256":"a87e579e72765e284b2fafa0297accc895fedcc48e670b53e7a1df0a0576254f"}