{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:66WKQ5JXANTAF7EA6FIY3DELIL","short_pith_number":"pith:66WKQ5JX","canonical_record":{"source":{"id":"1506.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-06-25T12:19:03Z","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"title_canon_sha256":"af3e9f20c87190e578a804dde51c8d8d18664a91745c15feb459616ff2fa1c07","abstract_canon_sha256":"11874a92bad11c42c1b2f39d58ebf7d645ecae4daf3c20f738ea88b591ccf1a1"},"schema_version":"1.0"},"canonical_sha256":"f7aca87537036602fc80f1518d8c8b42d124057727be25dd79ced0db133ee6d2","source":{"kind":"arxiv","id":"1506.07719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07719","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07719v1","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07719","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"pith_short_12","alias_value":"66WKQ5JXANTA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"66WKQ5JXANTAF7EA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"66WKQ5JX","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:66WKQ5JXANTAF7EA6FIY3DELIL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-06-25T12:19:03Z","cross_cats_sorted":["cs.GT","cs.MA","cs.SI","math.OC"],"title_canon_sha256":"af3e9f20c87190e578a804dde51c8d8d18664a91745c15feb459616ff2fa1c07","abstract_canon_sha256":"11874a92bad11c42c1b2f39d58ebf7d645ecae4daf3c20f738ea88b591ccf1a1"},"schema_version":"1.0"},"canonical_sha256":"f7aca87537036602fc80f1518d8c8b42d124057727be25dd79ced0db133ee6d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:51.068388Z","signature_b64":"DOqhu3arLR4jUmyCB2lAbekAQ6VwCde3RvQhaWvJo3qyaxt7peWFi0994SFsOZODlBttBHOuzV+rm1VXj9v8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7aca87537036602fc80f1518d8c8b42d124057727be25dd79ced0db133ee6d2","last_reissued_at":"2026-05-18T01:38:51.067645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:51.067645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07719","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-18T01:38:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cdi7V6g6LiA6j7VLInpMe1kL9n1tAsy0t+ML//BMAsCxQ72IKq/TFdU77q87xGCCs8sOjlnHfUbep4gm6GYqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:32:38.110706Z"},"content_sha256":"54753122ba8211c9621395c71509d42c126604394f68268ef1d4d6b9469a299f","schema_version":"1.0","event_id":"sha256:54753122ba8211c9621395c71509d42c126604394f68268ef1d4d6b9469a299f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:66WKQ5JXANTAF7EA6FIY3DELIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Aggregative Games and Distributed Mean Field Control via Consensus Theory","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, Sergio Grammatico","submitted_at":"2015-06-25T12:19:03Z","abstract_excerpt":"We consider network aggregative games to model and study multi-agent populations in which each rational agent is influenced by the aggregate behavior of its neighbors, as specified by an underlying network. Specifically, we examine systems where each agent minimizes a quadratic cost function, that depends on its own strategy and on a convex combination of the strategies of its neighbors, and is subject to personalized convex constraints. We analyze the best response dynamics and we propose alternative distributed algorithms to steer the strategies of the rational agents to a Nash equilibrium c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07719","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-18T01:38:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fZwlYT1VaZ+ZTBZMCVajSE65LpQf75uGQaNCexeemxid04fBFWzADbprVowhdxW6deJubCPJ+76QLBRT1RRlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:32:38.111393Z"},"content_sha256":"477232e76436074140dc5f5580c4a15ddd7aa945362e988bf180da0a136b8593","schema_version":"1.0","event_id":"sha256:477232e76436074140dc5f5580c4a15ddd7aa945362e988bf180da0a136b8593"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66WKQ5JXANTAF7EA6FIY3DELIL/bundle.json","state_url":"https://pith.science/pith/66WKQ5JXANTAF7EA6FIY3DELIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66WKQ5JXANTAF7EA6FIY3DELIL/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-11T03:32:38Z","links":{"resolver":"https://pith.science/pith/66WKQ5JXANTAF7EA6FIY3DELIL","bundle":"https://pith.science/pith/66WKQ5JXANTAF7EA6FIY3DELIL/bundle.json","state":"https://pith.science/pith/66WKQ5JXANTAF7EA6FIY3DELIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66WKQ5JXANTAF7EA6FIY3DELIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:66WKQ5JXANTAF7EA6FIY3DELIL","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":"11874a92bad11c42c1b2f39d58ebf7d645ecae4daf3c20f738ea88b591ccf1a1","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":"2015-06-25T12:19:03Z","title_canon_sha256":"af3e9f20c87190e578a804dde51c8d8d18664a91745c15feb459616ff2fa1c07"},"schema_version":"1.0","source":{"id":"1506.07719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07719","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07719v1","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07719","created_at":"2026-05-18T01:38:51Z"},{"alias_kind":"pith_short_12","alias_value":"66WKQ5JXANTA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"66WKQ5JXANTAF7EA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"66WKQ5JX","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:477232e76436074140dc5f5580c4a15ddd7aa945362e988bf180da0a136b8593","target":"graph","created_at":"2026-05-18T01:38:51Z","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 network aggregative games to model and study multi-agent populations in which each rational agent is influenced by the aggregate behavior of its neighbors, as specified by an underlying network. Specifically, we examine systems where each agent minimizes a quadratic cost function, that depends on its own strategy and on a convex combination of the strategies of its neighbors, and is subject to personalized convex constraints. We analyze the best response dynamics and we propose alternative distributed algorithms to steer the strategies of the rational agents to a Nash equilibrium c","authors_text":"Basilio Gentile, Francesca Parise, John Lygeros, Sergio Grammatico","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":"2015-06-25T12:19:03Z","title":"Network Aggregative Games and Distributed Mean Field Control via Consensus Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07719","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:54753122ba8211c9621395c71509d42c126604394f68268ef1d4d6b9469a299f","target":"record","created_at":"2026-05-18T01:38:51Z","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":"11874a92bad11c42c1b2f39d58ebf7d645ecae4daf3c20f738ea88b591ccf1a1","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":"2015-06-25T12:19:03Z","title_canon_sha256":"af3e9f20c87190e578a804dde51c8d8d18664a91745c15feb459616ff2fa1c07"},"schema_version":"1.0","source":{"id":"1506.07719","kind":"arxiv","version":1}},"canonical_sha256":"f7aca87537036602fc80f1518d8c8b42d124057727be25dd79ced0db133ee6d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7aca87537036602fc80f1518d8c8b42d124057727be25dd79ced0db133ee6d2","first_computed_at":"2026-05-18T01:38:51.067645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:38:51.067645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DOqhu3arLR4jUmyCB2lAbekAQ6VwCde3RvQhaWvJo3qyaxt7peWFi0994SFsOZODlBttBHOuzV+rm1VXj9v8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:38:51.068388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54753122ba8211c9621395c71509d42c126604394f68268ef1d4d6b9469a299f","sha256:477232e76436074140dc5f5580c4a15ddd7aa945362e988bf180da0a136b8593"],"state_sha256":"10010021ead06a2d3ac2f29cd980a34e4229ae54aa552093327a64a193b0d05e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSpsVjFKIbD+f/4mGcHYxC+43+gSVX+ZjKNyUb2FBOo+Uhk6ngl1OnrQ6s+9Cp1dRqUzI0xbptgnykoohG+BAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:32:38.115244Z","bundle_sha256":"c28c7336ceac8d3fb6be49096aed279bd26b632de3f0851670bb77080ff5fa1b"}}