{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ANIW5Y7T7UA6JZADB72JXBPSML","short_pith_number":"pith:ANIW5Y7T","schema_version":"1.0","canonical_sha256":"03516ee3f3fd01e4e4030ff49b85f262f6e17d4dd6ceca2aec2ba8eec0f37257","source":{"kind":"arxiv","id":"1612.07179","version":2},"attestation_state":"computed","paper":{"title":"Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY"],"primary_cat":"eess.SY","authors_text":"Farzad Salehisadaghiani, Lacra Pavel","submitted_at":"2016-12-21T15:23:16Z","abstract_excerpt":"A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players' actions to/from the other local players according to a gossip communication protocol. Due to asymmetric information exchange between the players, a non-doubly (row) stochastic weight matrix is defined. We show that, due to the non-doubly stochastic property, the total average of all players' estimates is not pr"},"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":"1612.07179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2016-12-21T15:23:16Z","cross_cats_sorted":["cs.GT","cs.SY"],"title_canon_sha256":"9eae4d18ccd71c5dba16d12693522e9799f18e1d862d624c71c9898e8909500c","abstract_canon_sha256":"10975727c753263b1da48866f7b2ae77b089c59374adeb853909388a0cb6a0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T18:10:21.824869Z","signature_b64":"JKthZdD+9RXhA5w7bWAii6hUIHtgyKI5hrM77EQqe7cvkzANjDsFMqmufnmENDh2xlcdT/dVMfrrCUNC5X3EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03516ee3f3fd01e4e4030ff49b85f262f6e17d4dd6ceca2aec2ba8eec0f37257","last_reissued_at":"2026-06-04T18:10:21.824356Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T18:10:21.824356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY"],"primary_cat":"eess.SY","authors_text":"Farzad Salehisadaghiani, Lacra Pavel","submitted_at":"2016-12-21T15:23:16Z","abstract_excerpt":"A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to send/receive the estimates of the other players' actions to/from the other local players according to a gossip communication protocol. Due to asymmetric information exchange between the players, a non-doubly (row) stochastic weight matrix is defined. We show that, due to the non-doubly stochastic property, the total average of all players' estimates is not pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07179","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/1612.07179/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":"1612.07179","created_at":"2026-06-04T18:10:21.824416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07179v2","created_at":"2026-06-04T18:10:21.824416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07179","created_at":"2026-06-04T18:10:21.824416+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANIW5Y7T7UA6","created_at":"2026-06-04T18:10:21.824416+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANIW5Y7T7UA6JZAD","created_at":"2026-06-04T18:10:21.824416+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANIW5Y7T","created_at":"2026-06-04T18:10:21.824416+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/ANIW5Y7T7UA6JZADB72JXBPSML","json":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML.json","graph_json":"https://pith.science/api/pith-number/ANIW5Y7T7UA6JZADB72JXBPSML/graph.json","events_json":"https://pith.science/api/pith-number/ANIW5Y7T7UA6JZADB72JXBPSML/events.json","paper":"https://pith.science/paper/ANIW5Y7T"},"agent_actions":{"view_html":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML","download_json":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML.json","view_paper":"https://pith.science/paper/ANIW5Y7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07179&json=true","fetch_graph":"https://pith.science/api/pith-number/ANIW5Y7T7UA6JZADB72JXBPSML/graph.json","fetch_events":"https://pith.science/api/pith-number/ANIW5Y7T7UA6JZADB72JXBPSML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML/action/storage_attestation","attest_author":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML/action/author_attestation","sign_citation":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML/action/citation_signature","submit_replication":"https://pith.science/pith/ANIW5Y7T7UA6JZADB72JXBPSML/action/replication_record"}},"created_at":"2026-06-04T18:10:21.824416+00:00","updated_at":"2026-06-04T18:10:21.824416+00:00"}