{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DOSUBFS6GH2S7VWXSNJJD45C46","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":"cf33faba8469ece014a54d110655f5cd6010c04f1eb6ba1b32e95f0a807d2bff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T02:46:23Z","title_canon_sha256":"a8428eacdb712e17d4b62bf5e4b84cd1c068c7e215342068392f23a8b96d4199"},"schema_version":"1.0","source":{"id":"1701.06717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06717","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06717v1","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06717","created_at":"2026-05-18T00:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"DOSUBFS6GH2S","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DOSUBFS6GH2S7VWX","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DOSUBFS6","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:1d43fc240617c90ebe3b8d657c78500cb9fc9e9d8b8dd9c29fa92f4bfa67caa8","target":"graph","created_at":"2026-05-18T00:52:12Z","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":"This paper studies the complexity of solving two classes of non-cooperative games in a distributed manner in which the players communicate with a set of system nodes over noisy communication channels. The complexity of solving each game class is defined as the minimum number of iterations required to find a Nash equilibrium (NE) of any game in that class with $\\epsilon$ accuracy. First, we consider the class $\\mathcal{G}$ of all $N$-player non-cooperative games with a continuous action space that admit at least one NE. Using information-theoretic inequalities, we derive a lower bound on the co","authors_text":"Ehsan Nekouei, Girish N. Nair, Robin J. Evans, Tansu Alpcan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T02:46:23Z","title":"Lower Bounds on the Complexity of Solving Two Classes of Non-cooperative Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06717","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:a1709bfd164c12a6cd1213fcb4e3a37233c8fbb5ca793605fd3f6f4815e19bd9","target":"record","created_at":"2026-05-18T00:52:12Z","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":"cf33faba8469ece014a54d110655f5cd6010c04f1eb6ba1b32e95f0a807d2bff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-24T02:46:23Z","title_canon_sha256":"a8428eacdb712e17d4b62bf5e4b84cd1c068c7e215342068392f23a8b96d4199"},"schema_version":"1.0","source":{"id":"1701.06717","kind":"arxiv","version":1}},"canonical_sha256":"1ba540965e31f52fd6d7935291f3a2e7b4c303a96bbc2ffb2a474a2d0030dd03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ba540965e31f52fd6d7935291f3a2e7b4c303a96bbc2ffb2a474a2d0030dd03","first_computed_at":"2026-05-18T00:52:12.317344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:12.317344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RQ9F7n4gcnfznvWbB4KAmR6JwG7fsV6aKwX/WB99Mxy7H6geFCgVSYG0XBmAS65ypET2iEYtNP95yMhrFF5ODg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:12.317767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1709bfd164c12a6cd1213fcb4e3a37233c8fbb5ca793605fd3f6f4815e19bd9","sha256:1d43fc240617c90ebe3b8d657c78500cb9fc9e9d8b8dd9c29fa92f4bfa67caa8"],"state_sha256":"32f2245e9a08f173ad0370bfaefcd5750eafaa01a35821bfe04a426a69d82b88"}