{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YCP5YRHRT6CVCS25HIJWU3CNDS","short_pith_number":"pith:YCP5YRHR","canonical_record":{"source":{"id":"1706.04634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-14T18:52:35Z","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"title_canon_sha256":"9dd7913ec9cbdff534c559cd33eece71a376a255f44ee6b79d892cc2fd530812","abstract_canon_sha256":"ac57026e16486a042e7b10431a0663037b6f55316632dbb94410f1f8b5820b2f"},"schema_version":"1.0"},"canonical_sha256":"c09fdc44f19f85514b5d3a136a6c4d1c9d7046b1fc2591fc0654ed15ae1c8223","source":{"kind":"arxiv","id":"1706.04634","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04634","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04634v2","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04634","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"YCP5YRHRT6CV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YCP5YRHRT6CVCS25","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YCP5YRHR","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YCP5YRHRT6CVCS25HIJWU3CNDS","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04634","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-14T18:52:35Z","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"title_canon_sha256":"9dd7913ec9cbdff534c559cd33eece71a376a255f44ee6b79d892cc2fd530812","abstract_canon_sha256":"ac57026e16486a042e7b10431a0663037b6f55316632dbb94410f1f8b5820b2f"},"schema_version":"1.0"},"canonical_sha256":"c09fdc44f19f85514b5d3a136a6c4d1c9d7046b1fc2591fc0654ed15ae1c8223","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:42.735101Z","signature_b64":"uFfkB67SplYhtjRlD3fg3C9oiTdLECUPTvRED2Eo3BTu7W0JeNqU+1qbrFZMhVX1FpPE66EAoSDrRvnrNTpJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c09fdc44f19f85514b5d3a136a6c4d1c9d7046b1fc2591fc0654ed15ae1c8223","last_reissued_at":"2026-05-18T00:32:42.734362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:42.734362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04634","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-18T00:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QP60RSv0GJuAJf+I/FhM9YCmqmQgS0RXZmNSKIziyDbnMJl6HeBuaccybbvrIAcSRMhhKqkpwP6z3LQ9Y+xjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:31.658384Z"},"content_sha256":"cc5c5a03d1073c494882a47a84e876c75004adc912261411e43cc4907e580fef","schema_version":"1.0","event_id":"sha256:cc5c5a03d1073c494882a47a84e876c75004adc912261411e43cc4907e580fef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YCP5YRHRT6CVCS25HIJWU3CNDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A distributed algorithm for average aggregative games with coupling constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.SI","math.OC"],"primary_cat":"cs.SY","authors_text":"Basilio Gentile, Francesca Parise, John Lygeros","submitted_at":"2017-06-14T18:52:35Z","abstract_excerpt":"We consider the framework of average aggregative games, where the cost function of each agent depends on his own strategy and on the average population strategy. We focus on the case in which the agents are coupled not only via their cost functions, but also via constraints coupling their strategies. We propose a distributed algorithm that achieves an almost Nash equilibrium by requiring only local communications of the agents, as specified by a sparse communication network. The proof of convergence of the algorithm relies on the auxiliary class of network aggregative games and exploits a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04634","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-18T00:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQq3CCBo5c4Va2Z2WTHahE4r4UJgqWaIvWIQk0M5z9g/ipx99Hhl1dWKYKLbgUo6+SvJvAvsCrccTCZb728mAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:11:31.659036Z"},"content_sha256":"b5ab48b6eaf76a2fcc0ffc3db9b17e3d3d03eee3f1a2417468348abde2464556","schema_version":"1.0","event_id":"sha256:b5ab48b6eaf76a2fcc0ffc3db9b17e3d3d03eee3f1a2417468348abde2464556"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/bundle.json","state_url":"https://pith.science/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/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-07T06:11:31Z","links":{"resolver":"https://pith.science/pith/YCP5YRHRT6CVCS25HIJWU3CNDS","bundle":"https://pith.science/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/bundle.json","state":"https://pith.science/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCP5YRHRT6CVCS25HIJWU3CNDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YCP5YRHRT6CVCS25HIJWU3CNDS","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":"ac57026e16486a042e7b10431a0663037b6f55316632dbb94410f1f8b5820b2f","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-14T18:52:35Z","title_canon_sha256":"9dd7913ec9cbdff534c559cd33eece71a376a255f44ee6b79d892cc2fd530812"},"schema_version":"1.0","source":{"id":"1706.04634","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04634","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04634v2","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04634","created_at":"2026-05-18T00:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"YCP5YRHRT6CV","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YCP5YRHRT6CVCS25","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YCP5YRHR","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:b5ab48b6eaf76a2fcc0ffc3db9b17e3d3d03eee3f1a2417468348abde2464556","target":"graph","created_at":"2026-05-18T00:32:42Z","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 the framework of average aggregative games, where the cost function of each agent depends on his own strategy and on the average population strategy. We focus on the case in which the agents are coupled not only via their cost functions, but also via constraints coupling their strategies. We propose a distributed algorithm that achieves an almost Nash equilibrium by requiring only local communications of the agents, as specified by a sparse communication network. The proof of convergence of the algorithm relies on the auxiliary class of network aggregative games and exploits a nove","authors_text":"Basilio Gentile, Francesca Parise, John Lygeros","cross_cats":["cs.GT","cs.MA","cs.SI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-14T18:52:35Z","title":"A distributed algorithm for average aggregative games with coupling constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04634","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:cc5c5a03d1073c494882a47a84e876c75004adc912261411e43cc4907e580fef","target":"record","created_at":"2026-05-18T00:32:42Z","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":"ac57026e16486a042e7b10431a0663037b6f55316632dbb94410f1f8b5820b2f","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-06-14T18:52:35Z","title_canon_sha256":"9dd7913ec9cbdff534c559cd33eece71a376a255f44ee6b79d892cc2fd530812"},"schema_version":"1.0","source":{"id":"1706.04634","kind":"arxiv","version":2}},"canonical_sha256":"c09fdc44f19f85514b5d3a136a6c4d1c9d7046b1fc2591fc0654ed15ae1c8223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c09fdc44f19f85514b5d3a136a6c4d1c9d7046b1fc2591fc0654ed15ae1c8223","first_computed_at":"2026-05-18T00:32:42.734362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:42.734362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uFfkB67SplYhtjRlD3fg3C9oiTdLECUPTvRED2Eo3BTu7W0JeNqU+1qbrFZMhVX1FpPE66EAoSDrRvnrNTpJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:42.735101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04634","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc5c5a03d1073c494882a47a84e876c75004adc912261411e43cc4907e580fef","sha256:b5ab48b6eaf76a2fcc0ffc3db9b17e3d3d03eee3f1a2417468348abde2464556"],"state_sha256":"21165a24df2707ba8d2a3207f23c2335860d9ef6efd231f9a6792515a5c40a66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"peOXzlPZAk8eZ2zDpfnVIFM22I0mkal2wXJiZTewCIgoFVXA8TYsLynkJKuj5nzwn13J1rURPYxTf8Kqi/JbAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:11:31.662557Z","bundle_sha256":"301bf94ff342cb0081c2bfbb71db2da53d41618ba30319ea78a54fa1dd9a935b"}}