{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SASJDP25VB5SW3WCEVPWZLLPKL","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":"9cde30c309e1146c5f4cc038a4a2e32adf1be2988c8034546f53d960f2ddd815","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","title_canon_sha256":"8a1f23aa5750e22bfce6c803671624cb58241a2cc23cb39592c1278e496e95e6"},"schema_version":"1.0","source":{"id":"1608.06580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06580","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06580v2","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06580","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"SASJDP25VB5S","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SASJDP25VB5SW3WC","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SASJDP25","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:489d8ebc6224271ba9517f5b8e034f726d411520ad9fe3d127f3ceb2df1cfe27","target":"graph","created_at":"2026-05-18T01:04:42Z","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":"For a constant $\\epsilon$, we prove a poly(N) lower bound on the (randomized) communication complexity of $\\epsilon$-Nash equilibrium in two-player NxN games. For n-player binary-action games we prove an exp(n) lower bound for the (randomized) communication complexity of $(\\epsilon,\\epsilon)$-weak approximate Nash equilibrium, which is a profile of mixed actions such that at least $(1-\\epsilon)$-fraction of the players are $\\epsilon$-best replying.","authors_text":"Aviad Rubinstein, Yakov Babichenko","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","title":"Communication complexity of approximate Nash equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06580","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:a9f37a3e175067e43069828d2ddee1d836b2ee9a443c2665253e1a7fd1043735","target":"record","created_at":"2026-05-18T01:04:42Z","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":"9cde30c309e1146c5f4cc038a4a2e32adf1be2988c8034546f53d960f2ddd815","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","title_canon_sha256":"8a1f23aa5750e22bfce6c803671624cb58241a2cc23cb39592c1278e496e95e6"},"schema_version":"1.0","source":{"id":"1608.06580","kind":"arxiv","version":2}},"canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","first_computed_at":"2026-05-18T01:04:42.914010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:42.914010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OmQHVkUiRQ27wrDbYX9I80liIv6wQEWGJkZDk7G1e8ui+5Z3ZoSJf2T8A9Wx/mRb3FNfy5tlMKqdCbebiwDvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:42.914448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9f37a3e175067e43069828d2ddee1d836b2ee9a443c2665253e1a7fd1043735","sha256:489d8ebc6224271ba9517f5b8e034f726d411520ad9fe3d127f3ceb2df1cfe27"],"state_sha256":"bcd8163a7aae1044fb11b3122646733fadbfb9a612bfe01217595ea833d0299c"}