{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SASJDP25VB5SW3WCEVPWZLLPKL","short_pith_number":"pith:SASJDP25","canonical_record":{"source":{"id":"1608.06580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8a1f23aa5750e22bfce6c803671624cb58241a2cc23cb39592c1278e496e95e6","abstract_canon_sha256":"9cde30c309e1146c5f4cc038a4a2e32adf1be2988c8034546f53d960f2ddd815"},"schema_version":"1.0"},"canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","source":{"kind":"arxiv","id":"1608.06580","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SASJDP25VB5SW3WCEVPWZLLPKL","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8a1f23aa5750e22bfce6c803671624cb58241a2cc23cb39592c1278e496e95e6","abstract_canon_sha256":"9cde30c309e1146c5f4cc038a4a2e32adf1be2988c8034546f53d960f2ddd815"},"schema_version":"1.0"},"canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.914448Z","signature_b64":"OmQHVkUiRQ27wrDbYX9I80liIv6wQEWGJkZDk7G1e8ui+5Z3ZoSJf2T8A9Wx/mRb3FNfy5tlMKqdCbebiwDvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","last_reissued_at":"2026-05-18T01:04:42.914010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.914010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06580","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-05-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jo+9raFytbyZuXIY2ddMWRNKsReX4h60lBFbLmAmJLgr55rEEplaGhGtgfOyj0DMd9tOdnaa4POGU0YloYGoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:30:44.780013Z"},"content_sha256":"a9f37a3e175067e43069828d2ddee1d836b2ee9a443c2665253e1a7fd1043735","schema_version":"1.0","event_id":"sha256:a9f37a3e175067e43069828d2ddee1d836b2ee9a443c2665253e1a7fd1043735"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SASJDP25VB5SW3WCEVPWZLLPKL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication complexity of approximate Nash equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein, Yakov Babichenko","submitted_at":"2016-08-23T17:07:52Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06580","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":""},"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-05-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OobPGgwjsCDPGpM2e3y5ggwKYTXYgilXEhbtMQ44XmeusYRhZLJzz1Tc0YDFsi225x92sBtInSUisxdgvWcCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:30:44.780429Z"},"content_sha256":"489d8ebc6224271ba9517f5b8e034f726d411520ad9fe3d127f3ceb2df1cfe27","schema_version":"1.0","event_id":"sha256:489d8ebc6224271ba9517f5b8e034f726d411520ad9fe3d127f3ceb2df1cfe27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/bundle.json","state_url":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SASJDP25VB5SW3WCEVPWZLLPKL/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-06-09T08:30:44Z","links":{"resolver":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL","bundle":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/bundle.json","state":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SASJDP25VB5SW3WCEVPWZLLPKL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ndbNDHWqJO30NS8F8KcL8aCaB8nAvc9Kxwdui+S0nbYpJvuebY2bkSbNmChH/wfP15wbSstzBnEzxcIadTe8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:30:44.784728Z","bundle_sha256":"23a65576fe33f88913ac6367105e53005f29fe12b27ca85070536362731a3d2a"}}