{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3SLHS6ZUQ3DL4QMTOIWGQCXXRO","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":"59ad6291e281ab151ceeb8459f28e252b8baaa4c3afff3f850f4085e9ef1144d","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-25T23:25:57Z","title_canon_sha256":"0c954cf367c38dc7030af2ab0a637d21b0479c42e7755f0c89f4f1f1453e9975"},"schema_version":"1.0","source":{"id":"1608.07336","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07336","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07336v1","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07336","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"3SLHS6ZUQ3DL","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3SLHS6ZUQ3DL4QMT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3SLHS6ZU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:b37308f8d453ba6cc7728295bf9e390367e0d5a49a54c25fc228f518bf35dc05","target":"graph","created_at":"2026-05-18T01:07:53Z","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":"We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any $n$-player anonymous game with a bounded number of strategies and any constant $\\delta>0$, an $O(1/n^{1-\\delta})$-approximate Nash equilibrium can be computed in polynomial time. Complementing this positive result, we show that if there exists any constant $\\delta>0$ such that an $O(1/n^{1+\\delta})$-approximate equilibrium can be computed in polynomial time, then there is a fully polynomial-time approximation scheme for this problem.\n  We also present","authors_text":"Alistair Stewart, Ilias Diakonikolas, Yu Cheng","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-25T23:25:57Z","title":"Playing Anonymous Games using Simple Strategies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07336","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:f475a5001c8563369ac18531aeb6bbcc60b92990743bd00aaa822a36ca051555","target":"record","created_at":"2026-05-18T01:07:53Z","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":"59ad6291e281ab151ceeb8459f28e252b8baaa4c3afff3f850f4085e9ef1144d","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-25T23:25:57Z","title_canon_sha256":"0c954cf367c38dc7030af2ab0a637d21b0479c42e7755f0c89f4f1f1453e9975"},"schema_version":"1.0","source":{"id":"1608.07336","kind":"arxiv","version":1}},"canonical_sha256":"dc96797b3486c6be4193722c680af78bac9841fedebf6a217b1e0d534c163287","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc96797b3486c6be4193722c680af78bac9841fedebf6a217b1e0d534c163287","first_computed_at":"2026-05-18T01:07:53.340220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:53.340220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSMinQnYo6jtYg1Bu5pZ6eqMJCxqykU7ErSb97MJ8SpHHIwET9uhpWbmMFBdHY8XIJVIJ4hQ86qWbmxkKkFMCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:53.340797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07336","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f475a5001c8563369ac18531aeb6bbcc60b92990743bd00aaa822a36ca051555","sha256:b37308f8d453ba6cc7728295bf9e390367e0d5a49a54c25fc228f518bf35dc05"],"state_sha256":"de385c7e56f8b3a8d6b773d7abbe01a86dcac4e5d887fd163e4f44a8c29c0b35"}