{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YVKH6PZNU3QL45LZ74UPRAEMBL","short_pith_number":"pith:YVKH6PZN","canonical_record":{"source":{"id":"1701.07956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-27T06:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"dc007fa94ffc3d477b285fdc02df724014be32a5bd58165610629e58aeb16218","abstract_canon_sha256":"dab97233897a5ffba5df10efeb7892bf30f2fef785d0c8be8ff635317bde830d"},"schema_version":"1.0"},"canonical_sha256":"c5547f3f2da6e0be7579ff28f8808c0af0034660577f484fc5f2bf36cf952ded","source":{"kind":"arxiv","id":"1701.07956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07956","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07956v1","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07956","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"YVKH6PZNU3QL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YVKH6PZNU3QL45LZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YVKH6PZN","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YVKH6PZNU3QL45LZ74UPRAEMBL","target":"record","payload":{"canonical_record":{"source":{"id":"1701.07956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-27T06:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"dc007fa94ffc3d477b285fdc02df724014be32a5bd58165610629e58aeb16218","abstract_canon_sha256":"dab97233897a5ffba5df10efeb7892bf30f2fef785d0c8be8ff635317bde830d"},"schema_version":"1.0"},"canonical_sha256":"c5547f3f2da6e0be7579ff28f8808c0af0034660577f484fc5f2bf36cf952ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:59.303429Z","signature_b64":"Nifr7qWmc+Fga1wcGO+WPVTk9XO9yogAq0m3Mwpy82Q3qXp5NrKn1mFOErYL/AVZgNzLRfBF910LZ9SuwhQMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5547f3f2da6e0be7579ff28f8808c0af0034660577f484fc5f2bf36cf952ded","last_reissued_at":"2026-05-18T00:51:59.302914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:59.302914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.07956","source_version":1,"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-18T00:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7VtyPoaMXw8sSN0FGLlvzAhy1q8fyqwt9zqf0ZqBVfaw3tBkMYZga00yVSfbi/53R9NnG12dciQosPYyUMyUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:59:05.821264Z"},"content_sha256":"0715d3403bfe76f34e81402d395f6f6fd483bf765a0db13f01a44fe64d7fd4eb","schema_version":"1.0","event_id":"sha256:0715d3403bfe76f34e81402d395f6f6fd483bf765a0db13f01a44fe64d7fd4eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YVKH6PZNU3QL45LZ74UPRAEMBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple approximate equilibria in games with many players","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Itai Arieli, Yakov Babichenko","submitted_at":"2017-01-27T06:47:02Z","abstract_excerpt":"We consider $\\epsilon$-equilibria notions for constant value of $\\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that $\\epsilon$-equilibrium is guaranteed to exist over this grid.\n  For Nash equilibrium, we prove that constant grid size (that depends on $\\epsilon$ and $m$, but not on $n$) is sufficient to guarantee existence of weak approximate equilibrium. This result implies a polynomial (in the input) algorithm for weak approximate equilibrium.\n  For approximate Nash equilibri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07956","kind":"arxiv","version":1},"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-18T00:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8G0vG9AU687z7X9afwL7lZiFAFAqR551EBWRx0+23dpbIYIjYfqjpc1iofBr2LGFMrUlkIYI3e5J89qyR1BCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:59:05.821978Z"},"content_sha256":"63252e8085a6b3ea1a85ded65888c2ffa389b42917e1a07d8003c2e1ab38440d","schema_version":"1.0","event_id":"sha256:63252e8085a6b3ea1a85ded65888c2ffa389b42917e1a07d8003c2e1ab38440d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/bundle.json","state_url":"https://pith.science/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/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-09T04:59:05Z","links":{"resolver":"https://pith.science/pith/YVKH6PZNU3QL45LZ74UPRAEMBL","bundle":"https://pith.science/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/bundle.json","state":"https://pith.science/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVKH6PZNU3QL45LZ74UPRAEMBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YVKH6PZNU3QL45LZ74UPRAEMBL","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":"dab97233897a5ffba5df10efeb7892bf30f2fef785d0c8be8ff635317bde830d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-27T06:47:02Z","title_canon_sha256":"dc007fa94ffc3d477b285fdc02df724014be32a5bd58165610629e58aeb16218"},"schema_version":"1.0","source":{"id":"1701.07956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07956","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07956v1","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07956","created_at":"2026-05-18T00:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"YVKH6PZNU3QL","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YVKH6PZNU3QL45LZ","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YVKH6PZN","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:63252e8085a6b3ea1a85ded65888c2ffa389b42917e1a07d8003c2e1ab38440d","target":"graph","created_at":"2026-05-18T00:51:59Z","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 consider $\\epsilon$-equilibria notions for constant value of $\\epsilon$ in $n$-player $m$-actions games where $m$ is a constant. We focus on the following question: What is the largest grid size over the mixed strategies such that $\\epsilon$-equilibrium is guaranteed to exist over this grid.\n  For Nash equilibrium, we prove that constant grid size (that depends on $\\epsilon$ and $m$, but not on $n$) is sufficient to guarantee existence of weak approximate equilibrium. This result implies a polynomial (in the input) algorithm for weak approximate equilibrium.\n  For approximate Nash equilibri","authors_text":"Itai Arieli, Yakov Babichenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-27T06:47:02Z","title":"Simple approximate equilibria in games with many players"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07956","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:0715d3403bfe76f34e81402d395f6f6fd483bf765a0db13f01a44fe64d7fd4eb","target":"record","created_at":"2026-05-18T00:51:59Z","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":"dab97233897a5ffba5df10efeb7892bf30f2fef785d0c8be8ff635317bde830d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-01-27T06:47:02Z","title_canon_sha256":"dc007fa94ffc3d477b285fdc02df724014be32a5bd58165610629e58aeb16218"},"schema_version":"1.0","source":{"id":"1701.07956","kind":"arxiv","version":1}},"canonical_sha256":"c5547f3f2da6e0be7579ff28f8808c0af0034660577f484fc5f2bf36cf952ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5547f3f2da6e0be7579ff28f8808c0af0034660577f484fc5f2bf36cf952ded","first_computed_at":"2026-05-18T00:51:59.302914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:59.302914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nifr7qWmc+Fga1wcGO+WPVTk9XO9yogAq0m3Mwpy82Q3qXp5NrKn1mFOErYL/AVZgNzLRfBF910LZ9SuwhQMDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:59.303429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0715d3403bfe76f34e81402d395f6f6fd483bf765a0db13f01a44fe64d7fd4eb","sha256:63252e8085a6b3ea1a85ded65888c2ffa389b42917e1a07d8003c2e1ab38440d"],"state_sha256":"53364ab2a7c4a50fce31d31ac8644400d30c80954e226474d07a849cda0292a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJk3b6CCT1kQVE8kARGd7fvzGhoOmeXJBa/bThx1uZF43bJg/JXIyYFNtrz5ELI5tsbAiTBiYxRsRhFwd/OkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:59:05.826282Z","bundle_sha256":"e3c828782656c9875f1ce1eae9bceffeda552cf01d983298a8e751f056d14d83"}}