{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F2UAQQSV4ANAVPHPQQW64RQFFU","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":"b6558f165a5fc7d073e9c791f5da7a93f6498f3221c0921f92da5745b260247c","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-28T19:39:26Z","title_canon_sha256":"02522c409ac3be4f7b93c10732a77ead1de4ee1daa099d97f2e5e6b770834ab1"},"schema_version":"1.0","source":{"id":"1703.09765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09765","created_at":"2026-06-04T18:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09765v1","created_at":"2026-06-04T18:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09765","created_at":"2026-06-04T18:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"F2UAQQSV4ANA","created_at":"2026-06-04T18:10:41Z"},{"alias_kind":"pith_short_16","alias_value":"F2UAQQSV4ANAVPHP","created_at":"2026-06-04T18:10:41Z"},{"alias_kind":"pith_short_8","alias_value":"F2UAQQSV","created_at":"2026-06-04T18:10:41Z"}],"graph_snapshots":[{"event_id":"sha256:90894655e0b86996c81e6f8c8ecf8d399c7f515a894e51381aebf93a356fa4b7","target":"graph","created_at":"2026-06-04T18:10:41Z","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/1703.09765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication between players is considered to be limited. A generalized communication graph is designed so that players exchange only their required information. An algorithm is designed whereby players, with possibly par","authors_text":"Farzad Salehisadaghiani, Lacra Pavel","cross_cats":["cs.SY","eess.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-28T19:39:26Z","title":"A Distributed Nash Equilibrium Seeking in Networked Graphical Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09765","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:46f1711ceae86883825624cc3e11c8311bd8632932428eaf245f185eef251bee","target":"record","created_at":"2026-06-04T18:10:41Z","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":"b6558f165a5fc7d073e9c791f5da7a93f6498f3221c0921f92da5745b260247c","cross_cats_sorted":["cs.SY","eess.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-03-28T19:39:26Z","title_canon_sha256":"02522c409ac3be4f7b93c10732a77ead1de4ee1daa099d97f2e5e6b770834ab1"},"schema_version":"1.0","source":{"id":"1703.09765","kind":"arxiv","version":1}},"canonical_sha256":"2ea8084255e01a0abcef842dee46052d382d079848be0d9c104d9bb2e74b809d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea8084255e01a0abcef842dee46052d382d079848be0d9c104d9bb2e74b809d","first_computed_at":"2026-06-04T18:10:41.674231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T18:10:41.674231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z07EytyHGqX4CRauL7HK3XkU+m3VlMjTdKERJju7rISNEjhcIovkXVd2X0d9EgS8+PSUDanbeS68tH4PEzxqAQ==","signature_status":"signed_v1","signed_at":"2026-06-04T18:10:41.674660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46f1711ceae86883825624cc3e11c8311bd8632932428eaf245f185eef251bee","sha256:90894655e0b86996c81e6f8c8ecf8d399c7f515a894e51381aebf93a356fa4b7"],"state_sha256":"8bd454f66433e110076b5225315ae57ff35e31d0933243d626fdb2140badc1f8"}