{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TEHB44VRD3EJXY4W7Z7TI7DWO6","short_pith_number":"pith:TEHB44VR","schema_version":"1.0","canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","source":{"kind":"arxiv","id":"1605.00267","version":2},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Aggregative Games on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedi\\'c, Jayash Koshal, Uday V. Shanbhag","submitted_at":"2016-05-01T15:48:56Z","abstract_excerpt":"We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an estimate of this aggregate, and the players exchange this information with their local neighbors over a connected network. We study distributed synchronous and asynchronous algorithms for information exchange and equilibrium computation over such a network. Under standard conditions, we establish the almost-sure convergence of the obtained sequences to the equili"},"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":"1605.00267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-01T15:48:56Z","cross_cats_sorted":[],"title_canon_sha256":"fbbe9a6b5ce9bcb63a8527fbb1ff5fac90ac2e58a0ec76ca2c43022db90d0015","abstract_canon_sha256":"9926a096420a751ebfba6439fd8e2a9bb9aff897f44745bf25bcb83dbe88da8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:40.206153Z","signature_b64":"ceiav5sa8XI2mHm0UDmIXPs49F18GLUOnLfUMqOo1eaC+IvwKjZVXV8sj+q4KyydDNp6tqw/JkuC/bXRzrdmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","last_reissued_at":"2026-05-18T01:12:40.205809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:40.205809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Aggregative Games on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedi\\'c, Jayash Koshal, Uday V. Shanbhag","submitted_at":"2016-05-01T15:48:56Z","abstract_excerpt":"We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an estimate of this aggregate, and the players exchange this information with their local neighbors over a connected network. We study distributed synchronous and asynchronous algorithms for information exchange and equilibrium computation over such a network. Under standard conditions, we establish the almost-sure convergence of the obtained sequences to the equili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00267","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.00267","created_at":"2026-05-18T01:12:40.205866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00267v2","created_at":"2026-05-18T01:12:40.205866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00267","created_at":"2026-05-18T01:12:40.205866+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEHB44VRD3EJ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEHB44VRD3EJXY4W","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEHB44VR","created_at":"2026-05-18T12:30:44.179134+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/TEHB44VRD3EJXY4W7Z7TI7DWO6","json":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6.json","graph_json":"https://pith.science/api/pith-number/TEHB44VRD3EJXY4W7Z7TI7DWO6/graph.json","events_json":"https://pith.science/api/pith-number/TEHB44VRD3EJXY4W7Z7TI7DWO6/events.json","paper":"https://pith.science/paper/TEHB44VR"},"agent_actions":{"view_html":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6","download_json":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6.json","view_paper":"https://pith.science/paper/TEHB44VR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00267&json=true","fetch_graph":"https://pith.science/api/pith-number/TEHB44VRD3EJXY4W7Z7TI7DWO6/graph.json","fetch_events":"https://pith.science/api/pith-number/TEHB44VRD3EJXY4W7Z7TI7DWO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/action/storage_attestation","attest_author":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/action/author_attestation","sign_citation":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/action/citation_signature","submit_replication":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/action/replication_record"}},"created_at":"2026-05-18T01:12:40.205866+00:00","updated_at":"2026-05-18T01:12:40.205866+00:00"}