{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TEHB44VRD3EJXY4W7Z7TI7DWO6","short_pith_number":"pith:TEHB44VR","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"},"canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","source":{"kind":"arxiv","id":"1605.00267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00267","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00267v2","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00267","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"TEHB44VRD3EJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TEHB44VRD3EJXY4W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TEHB44VR","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TEHB44VRD3EJXY4W7Z7TI7DWO6","target":"record","payload":{"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"},"canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","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"},"source_kind":"arxiv","source_id":"1605.00267","source_version":2,"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-18T01:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q7VX8fezGGa835/dB39xV0hGgs0I1YteeinJLrt+qf/HdjezZw23YXMEMpwIG3Uz3PoyoiQxoWUxWJBHNBoBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:58:47.070273Z"},"content_sha256":"ca23c7b4428f675ea4fac2b124114d2ed4683260f379705a3e4fc67a3e0fa39a","schema_version":"1.0","event_id":"sha256:ca23c7b4428f675ea4fac2b124114d2ed4683260f379705a3e4fc67a3e0fa39a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TEHB44VRD3EJXY4W7Z7TI7DWO6","target":"graph","payload":{"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"},"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-18T01:12:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BlY4Da4OqgJDxfeUguSajfdyeawBy98PcDt9cR74u3ZIizfpVFwK/j4vsP7MoG/xQ349v7JnRIf+GjtC4RncBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:58:47.070626Z"},"content_sha256":"a67ba65119c9b11bb3227893ec909430c09b3637851bd72ddf8f0700ce69adb5","schema_version":"1.0","event_id":"sha256:a67ba65119c9b11bb3227893ec909430c09b3637851bd72ddf8f0700ce69adb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/bundle.json","state_url":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/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-21T21:58:47Z","links":{"resolver":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6","bundle":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/bundle.json","state":"https://pith.science/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEHB44VRD3EJXY4W7Z7TI7DWO6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TEHB44VRD3EJXY4W7Z7TI7DWO6","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":"9926a096420a751ebfba6439fd8e2a9bb9aff897f44745bf25bcb83dbe88da8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-01T15:48:56Z","title_canon_sha256":"fbbe9a6b5ce9bcb63a8527fbb1ff5fac90ac2e58a0ec76ca2c43022db90d0015"},"schema_version":"1.0","source":{"id":"1605.00267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00267","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00267v2","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00267","created_at":"2026-05-18T01:12:40Z"},{"alias_kind":"pith_short_12","alias_value":"TEHB44VRD3EJ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TEHB44VRD3EJXY4W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TEHB44VR","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:a67ba65119c9b11bb3227893ec909430c09b3637851bd72ddf8f0700ce69adb5","target":"graph","created_at":"2026-05-18T01:12:40Z","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 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","authors_text":"Angelia Nedi\\'c, Jayash Koshal, Uday V. Shanbhag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-01T15:48:56Z","title":"Distributed Algorithms for Aggregative Games on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00267","kind":"arxiv","version":2},"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:ca23c7b4428f675ea4fac2b124114d2ed4683260f379705a3e4fc67a3e0fa39a","target":"record","created_at":"2026-05-18T01:12:40Z","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":"9926a096420a751ebfba6439fd8e2a9bb9aff897f44745bf25bcb83dbe88da8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-01T15:48:56Z","title_canon_sha256":"fbbe9a6b5ce9bcb63a8527fbb1ff5fac90ac2e58a0ec76ca2c43022db90d0015"},"schema_version":"1.0","source":{"id":"1605.00267","kind":"arxiv","version":2}},"canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"990e1e72b11ec89be396fe7f347c767789f51cb670b4812d9204a50d255a9185","first_computed_at":"2026-05-18T01:12:40.205809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:40.205809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ceiav5sa8XI2mHm0UDmIXPs49F18GLUOnLfUMqOo1eaC+IvwKjZVXV8sj+q4KyydDNp6tqw/JkuC/bXRzrdmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:40.206153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca23c7b4428f675ea4fac2b124114d2ed4683260f379705a3e4fc67a3e0fa39a","sha256:a67ba65119c9b11bb3227893ec909430c09b3637851bd72ddf8f0700ce69adb5"],"state_sha256":"05eeaad005d681329f256dde4b137a6581935fa5d0a64c6cf13768878122967d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agCAN39/RVxTcEE4xngeI87ParthDMEs6M9J2lyPHxYu/S2DkhT8gYR6koNcf6jEL8pgLrUUWOVYnjEWkek7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:58:47.072515Z","bundle_sha256":"3ede7c0eb162bc5565084783505b3fafe932dd00b6266dfd05eaa648dccbff13"}}