{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:22FLD55TJAERZMZCANUZOK554M","short_pith_number":"pith:22FLD55T","canonical_record":{"source":{"id":"1911.06458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-15T03:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"4b79ae443bf5aa98fc41a92b0b9b7ecfd690531cc69a979b6124cef65724a0ca","abstract_canon_sha256":"e86021da69e9c0bd46e92c549a3c548515266b98f11874897ae8d158f69b6e95"},"schema_version":"1.0"},"canonical_sha256":"d68ab1f7b348091cb3220369972bbde30baf640138f4f4905b9ac9bec9a42679","source":{"kind":"arxiv","id":"1911.06458","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06458","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06458v2","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06458","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"22FLD55TJAER","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"22FLD55TJAERZMZC","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"22FLD55T","created_at":"2026-07-05T03:37:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:22FLD55TJAERZMZCANUZOK554M","target":"record","payload":{"canonical_record":{"source":{"id":"1911.06458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-15T03:02:12Z","cross_cats_sorted":[],"title_canon_sha256":"4b79ae443bf5aa98fc41a92b0b9b7ecfd690531cc69a979b6124cef65724a0ca","abstract_canon_sha256":"e86021da69e9c0bd46e92c549a3c548515266b98f11874897ae8d158f69b6e95"},"schema_version":"1.0"},"canonical_sha256":"d68ab1f7b348091cb3220369972bbde30baf640138f4f4905b9ac9bec9a42679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:37.404074Z","signature_b64":"wowza4kAxxxbr33/hoSigG9PZdsVqBrY8FeqWLJjxDOCtvenxNgnlSYY7NaR6MptGM0S+vP/QKQVjt34S1bzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d68ab1f7b348091cb3220369972bbde30baf640138f4f4905b9ac9bec9a42679","last_reissued_at":"2026-07-05T03:37:37.403693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:37.403693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.06458","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-07-05T03:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TH8Mi+tCy34uYrRL8PZLt3NzpqqOLhyKN/BdKDnVEgjCJHg9yfsPgD8l+T95fOsw3lL2daEE4Hh+bZ7zc/CrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:58:26.722370Z"},"content_sha256":"a214ae1a54b75df34a2134e5106957c5e037113d6b2899dabd6acad4d9131dfa","schema_version":"1.0","event_id":"sha256:a214ae1a54b75df34a2134e5106957c5e037113d6b2899dabd6acad4d9131dfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:22FLD55TJAERZMZCANUZOK554M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kaixiang Peng, Peng Yi, Shu Liang, Yiguang Hong","submitted_at":"2019-11-15T03:02:12Z","abstract_excerpt":"Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and distributed average tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. We obtain an exponential convergence of the proposed algorithm to the Nash equilibrium. Numerical examples illustrate the effectiveness of our methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06458","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/1911.06458/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"},"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-07-05T03:37:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvKut9HpXlIzqjvKY/5bEjyduOOKnZvIlVVDyjJSLipYDFjgYQQBHz66nAYA+GBeFI6eZW/11y/o3GiXsWmlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:58:26.722737Z"},"content_sha256":"45b8bad1b4a5097695941ad816d66963909a4352a2f6a4c1d3ade7e953d7d107","schema_version":"1.0","event_id":"sha256:45b8bad1b4a5097695941ad816d66963909a4352a2f6a4c1d3ade7e953d7d107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22FLD55TJAERZMZCANUZOK554M/bundle.json","state_url":"https://pith.science/pith/22FLD55TJAERZMZCANUZOK554M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22FLD55TJAERZMZCANUZOK554M/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-07-07T07:58:26Z","links":{"resolver":"https://pith.science/pith/22FLD55TJAERZMZCANUZOK554M","bundle":"https://pith.science/pith/22FLD55TJAERZMZCANUZOK554M/bundle.json","state":"https://pith.science/pith/22FLD55TJAERZMZCANUZOK554M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22FLD55TJAERZMZCANUZOK554M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:22FLD55TJAERZMZCANUZOK554M","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":"e86021da69e9c0bd46e92c549a3c548515266b98f11874897ae8d158f69b6e95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-15T03:02:12Z","title_canon_sha256":"4b79ae443bf5aa98fc41a92b0b9b7ecfd690531cc69a979b6124cef65724a0ca"},"schema_version":"1.0","source":{"id":"1911.06458","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.06458","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"arxiv_version","alias_value":"1911.06458v2","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06458","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_12","alias_value":"22FLD55TJAER","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_16","alias_value":"22FLD55TJAERZMZC","created_at":"2026-07-05T03:37:37Z"},{"alias_kind":"pith_short_8","alias_value":"22FLD55T","created_at":"2026-07-05T03:37:37Z"}],"graph_snapshots":[{"event_id":"sha256:45b8bad1b4a5097695941ad816d66963909a4352a2f6a4c1d3ade7e953d7d107","target":"graph","created_at":"2026-07-05T03:37:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.06458/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and distributed average tracking dynamics, and is applicable to games with constrained strategy sets and weight-balanced communication graphs. We obtain an exponential convergence of the proposed algorithm to the Nash equilibrium. Numerical examples illustrate the effectiveness of our methods.","authors_text":"Kaixiang Peng, Peng Yi, Shu Liang, Yiguang Hong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-15T03:02:12Z","title":"Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06458","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:a214ae1a54b75df34a2134e5106957c5e037113d6b2899dabd6acad4d9131dfa","target":"record","created_at":"2026-07-05T03:37:37Z","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":"e86021da69e9c0bd46e92c549a3c548515266b98f11874897ae8d158f69b6e95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-11-15T03:02:12Z","title_canon_sha256":"4b79ae443bf5aa98fc41a92b0b9b7ecfd690531cc69a979b6124cef65724a0ca"},"schema_version":"1.0","source":{"id":"1911.06458","kind":"arxiv","version":2}},"canonical_sha256":"d68ab1f7b348091cb3220369972bbde30baf640138f4f4905b9ac9bec9a42679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d68ab1f7b348091cb3220369972bbde30baf640138f4f4905b9ac9bec9a42679","first_computed_at":"2026-07-05T03:37:37.403693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:37.403693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wowza4kAxxxbr33/hoSigG9PZdsVqBrY8FeqWLJjxDOCtvenxNgnlSYY7NaR6MptGM0S+vP/QKQVjt34S1bzCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:37.404074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.06458","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a214ae1a54b75df34a2134e5106957c5e037113d6b2899dabd6acad4d9131dfa","sha256:45b8bad1b4a5097695941ad816d66963909a4352a2f6a4c1d3ade7e953d7d107"],"state_sha256":"6fd30ef545ce17a19264e72860db43dec478010c01da58502f9a9fe6705a3c11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mtvYh5xczzDO98qwM93MXkiqYHgQ9WGjc2AtUJsaG3Hf3ii/Y34KlPemtSE0+fFYboZ5rQePipqJWbo/0cGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:58:26.724832Z","bundle_sha256":"8c14d88639a159da922720ea3217258ed17ed115164f3c2d36ed178304291f3d"}}