{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5MK5BQTOFIOVDK7RIRHX5FW3B6","short_pith_number":"pith:5MK5BQTO","schema_version":"1.0","canonical_sha256":"eb15d0c26e2a1d51abf1444f7e96db0fbb09748413541a13f195d49dddb3dcd7","source":{"kind":"arxiv","id":"1303.4476","version":1},"attestation_state":"computed","paper":{"title":"A distributed adaptive steplength stochastic approximation method for monotone stochastic Nash Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Farzad Yousefian, Uday V. Shanbhag","submitted_at":"2013-03-19T03:17:59Z","abstract_excerpt":"We consider a distributed stochastic approximation (SA) scheme for computing an equilibrium of a stochastic Nash game. Standard SA schemes employ diminishing steplength sequences that are square summable but not summable. Such requirements provide a little or no guidance for how to leverage Lipschitzian and monotonicity properties of the problem and naive choices generally do not preform uniformly well on a breadth of problems. While a centralized adaptive stepsize SA scheme is proposed in [1] for the optimization framework, such a scheme provides no freedom for the agents in choosing their ow"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1303.4476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-03-19T03:17:59Z","cross_cats_sorted":[],"title_canon_sha256":"d560e307e1de79e1b0e7ff52469d2d70ac7b85b2af73c226d1206d8735a10368","abstract_canon_sha256":"36f0ee0e5e5e97c3ec95ac14a796e6c7a5b5de04cc10937f720dcba065573cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:27.072445Z","signature_b64":"TXLLzY9kiqx0eDC6wK346NsGDhF3s5qcUEJ68SmlQ6b0+B2i+lsVrgp2PGoTZKVBBeQztJleMqhVjQBI7dUNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb15d0c26e2a1d51abf1444f7e96db0fbb09748413541a13f195d49dddb3dcd7","last_reissued_at":"2026-05-18T03:30:27.071681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:27.071681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distributed adaptive steplength stochastic approximation method for monotone stochastic Nash Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Farzad Yousefian, Uday V. Shanbhag","submitted_at":"2013-03-19T03:17:59Z","abstract_excerpt":"We consider a distributed stochastic approximation (SA) scheme for computing an equilibrium of a stochastic Nash game. Standard SA schemes employ diminishing steplength sequences that are square summable but not summable. Such requirements provide a little or no guidance for how to leverage Lipschitzian and monotonicity properties of the problem and naive choices generally do not preform uniformly well on a breadth of problems. While a centralized adaptive stepsize SA scheme is proposed in [1] for the optimization framework, such a scheme provides no freedom for the agents in choosing their ow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4476","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.4476","created_at":"2026-05-18T03:30:27.071830+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4476v1","created_at":"2026-05-18T03:30:27.071830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4476","created_at":"2026-05-18T03:30:27.071830+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MK5BQTOFIOV","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MK5BQTOFIOVDK7R","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MK5BQTO","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6","json":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6.json","graph_json":"https://pith.science/api/pith-number/5MK5BQTOFIOVDK7RIRHX5FW3B6/graph.json","events_json":"https://pith.science/api/pith-number/5MK5BQTOFIOVDK7RIRHX5FW3B6/events.json","paper":"https://pith.science/paper/5MK5BQTO"},"agent_actions":{"view_html":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6","download_json":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6.json","view_paper":"https://pith.science/paper/5MK5BQTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4476&json=true","fetch_graph":"https://pith.science/api/pith-number/5MK5BQTOFIOVDK7RIRHX5FW3B6/graph.json","fetch_events":"https://pith.science/api/pith-number/5MK5BQTOFIOVDK7RIRHX5FW3B6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6/action/storage_attestation","attest_author":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6/action/author_attestation","sign_citation":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6/action/citation_signature","submit_replication":"https://pith.science/pith/5MK5BQTOFIOVDK7RIRHX5FW3B6/action/replication_record"}},"created_at":"2026-05-18T03:30:27.071830+00:00","updated_at":"2026-05-18T03:30:27.071830+00:00"}