{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","short_pith_number":"pith:JUUQ3E2J","canonical_record":{"source":{"id":"1810.10891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"48e7fb0bc559d023ede9394c4fceb01709df5c9b5ea9f7bff3bc75b9eec8af05","abstract_canon_sha256":"be75b9ffccb3b03dc3858aa51f4ab05c6e860390aa90b71026f4df9d14c699e2"},"schema_version":"1.0"},"canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","source":{"kind":"arxiv","id":"1810.10891","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.10891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"48e7fb0bc559d023ede9394c4fceb01709df5c9b5ea9f7bff3bc75b9eec8af05","abstract_canon_sha256":"be75b9ffccb3b03dc3858aa51f4ab05c6e860390aa90b71026f4df9d14c699e2"},"schema_version":"1.0"},"canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.918693Z","signature_b64":"ZckQP6v3354we6W7FMFA+wedlsikjR7hW0ZJcPVggEBi/RhCOEuKrdGrmPi6lAwUZ/WNvGk7G1PovkrdydDiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","last_reissued_at":"2026-05-18T00:02:18.918099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.918099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.10891","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdqNceK+mOiDUBUcxiUxwurw6oY8NYHuucVzfdpM7DBe5zuTgS1kHCovqym7YXOJiQESaE4N1TExCRypnpRVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:50:59.624956Z"},"content_sha256":"6878ce9d55c8d5852e14263bd92cf9c7b1bd9ebeeb1754e2b999a99a1b472fe3","schema_version":"1.0","event_id":"sha256:6878ce9d55c8d5852e14263bd92cf9c7b1bd9ebeeb1754e2b999a99a1b472fe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinlong Lei, Uday V. Shanbhag","submitted_at":"2018-10-25T14:25:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10891","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-18T00:02:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83wZdOgvw9OewkMKV9GnYhHO81PnhM+DV22f8/fnbmbLfZweuQP6iSbEPq6kqRqUHnjjkstI84NFXpS3asaMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:50:59.625706Z"},"content_sha256":"b4781ab771cc52e3cebb488506d3fe10272206b76fe1542357786ed2e3c4c7ea","schema_version":"1.0","event_id":"sha256:b4781ab771cc52e3cebb488506d3fe10272206b76fe1542357786ed2e3c4c7ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/bundle.json","state_url":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/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-11T08:50:59Z","links":{"resolver":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","bundle":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/bundle.json","state":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxfaEEo/3d4Kk7a5mD5ksp0vg2KpFA5ZFntGzEuoldNp/SA3pqZGmlU3/OJ3Voym+hbTUaem1UHosxzQxJ+VAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:50:59.630624Z","bundle_sha256":"7cbaa533221e51102f43d88ec50ab9c39a0d401b85be56e63606a9e74218cbf8"}}