{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VZ7ENE535BXF24X2ZHJQ4PAQPI","short_pith_number":"pith:VZ7ENE53","schema_version":"1.0","canonical_sha256":"ae7e4693bbe86e5d72fac9d30e3c107a380916a205754f78a824c71a22667c54","source":{"kind":"arxiv","id":"1910.13928","version":2},"attestation_state":"computed","paper":{"title":"Privacy and Robustness Guarantees in Distributed Dynamics for Aggregative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudio De Persis, Mehran Shakarami, Nima Monshizadeh","submitted_at":"2019-10-30T15:28:44Z","abstract_excerpt":"This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that the actions of the players converge to NE by communicating to each other through a connected network. A major concern in communicative schemes among strategic agents is that their private information may be revealed to other agents or to a curious third party who can eavesdrop the communications. We address this concern for the presented algorithm and show th"},"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":"1910.13928","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-30T15:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"4acda43574407e5bcaf0b451963e25bad9c8dba8adf2deb05be192a716ad49ab","abstract_canon_sha256":"257a8aba8a8629c06191a3a0b5cabb3d67f9c389a86976d39d7b63045d1148db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:22.323766Z","signature_b64":"yYzucJxJmaqzv8FhObnNh4dL1dRDMKnewwoQYhemKxXU/hPAwIhgHLFUwfx62tG4xbQxnc0G6ONZ31iSiqV3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae7e4693bbe86e5d72fac9d30e3c107a380916a205754f78a824c71a22667c54","last_reissued_at":"2026-07-05T00:16:22.323394Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:22.323394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy and Robustness Guarantees in Distributed Dynamics for Aggregative Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Claudio De Persis, Mehran Shakarami, Nima Monshizadeh","submitted_at":"2019-10-30T15:28:44Z","abstract_excerpt":"This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that the actions of the players converge to NE by communicating to each other through a connected network. A major concern in communicative schemes among strategic agents is that their private information may be revealed to other agents or to a curious third party who can eavesdrop the communications. We address this concern for the presented algorithm and show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13928","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.13928/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.13928","created_at":"2026-07-05T00:16:22.323446+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.13928v2","created_at":"2026-07-05T00:16:22.323446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13928","created_at":"2026-07-05T00:16:22.323446+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZ7ENE535BXF","created_at":"2026-07-05T00:16:22.323446+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZ7ENE535BXF24X2","created_at":"2026-07-05T00:16:22.323446+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZ7ENE53","created_at":"2026-07-05T00:16:22.323446+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/VZ7ENE535BXF24X2ZHJQ4PAQPI","json":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI.json","graph_json":"https://pith.science/api/pith-number/VZ7ENE535BXF24X2ZHJQ4PAQPI/graph.json","events_json":"https://pith.science/api/pith-number/VZ7ENE535BXF24X2ZHJQ4PAQPI/events.json","paper":"https://pith.science/paper/VZ7ENE53"},"agent_actions":{"view_html":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI","download_json":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI.json","view_paper":"https://pith.science/paper/VZ7ENE53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.13928&json=true","fetch_graph":"https://pith.science/api/pith-number/VZ7ENE535BXF24X2ZHJQ4PAQPI/graph.json","fetch_events":"https://pith.science/api/pith-number/VZ7ENE535BXF24X2ZHJQ4PAQPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI/action/storage_attestation","attest_author":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI/action/author_attestation","sign_citation":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI/action/citation_signature","submit_replication":"https://pith.science/pith/VZ7ENE535BXF24X2ZHJQ4PAQPI/action/replication_record"}},"created_at":"2026-07-05T00:16:22.323446+00:00","updated_at":"2026-07-05T00:16:22.323446+00:00"}