{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VVZVTZXJGNYECLAXIYA5ACAE27","short_pith_number":"pith:VVZVTZXJ","canonical_record":{"source":{"id":"1307.4934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-18T13:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"b546660ec47202b9d725e02f17876c149fab1e4b5559fb97ae24a28069416f94","abstract_canon_sha256":"5e67da7ce525d9dcd603db7d51a2fc112a0f03c1db83404d9a813015853b0bed"},"schema_version":"1.0"},"canonical_sha256":"ad7359e6e93370412c174601d00804d7c25c3001df5bc320dba21fd0aa484bf0","source":{"kind":"arxiv","id":"1307.4934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4934","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4934v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4934","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"VVZVTZXJGNYE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VVZVTZXJGNYECLAX","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VVZVTZXJ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VVZVTZXJGNYECLAXIYA5ACAE27","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-18T13:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"b546660ec47202b9d725e02f17876c149fab1e4b5559fb97ae24a28069416f94","abstract_canon_sha256":"5e67da7ce525d9dcd603db7d51a2fc112a0f03c1db83404d9a813015853b0bed"},"schema_version":"1.0"},"canonical_sha256":"ad7359e6e93370412c174601d00804d7c25c3001df5bc320dba21fd0aa484bf0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.155743Z","signature_b64":"wxjbBJGjCQsB1IrEKmnxoSi62PZzktz9oHKyfNlZiZblDN0PpSzOxal7VXbGTjALBGYt2Z5P/xIgpLAfeGv3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad7359e6e93370412c174601d00804d7c25c3001df5bc320dba21fd0aa484bf0","last_reissued_at":"2026-05-18T03:18:07.154944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.154944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4934","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IoDBGxlBSoHxVsNXy50uZlr/cTAg6GWQOvi0ZVm3aeWfff0cpQgmJRxdVkfNS6OiBwBOPJOECoP2sP4q1w5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:40.285151Z"},"content_sha256":"b6ab8054efe1f466488b577520f291f54fbf5dd0de761d496d2d6ca7e0d85346","schema_version":"1.0","event_id":"sha256:b6ab8054efe1f466488b577520f291f54fbf5dd0de761d496d2d6ca7e0d85346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VVZVTZXJGNYECLAXIYA5ACAE27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate Nash Equilibria via Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ron Peretz, Yakov Babichenko","submitted_at":"2013-07-18T13:23:47Z","abstract_excerpt":"We prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(log(m) + log(n)) pure strategies. This result induces an $N^{\\log \\log N}$ algorithm for computing an approximate Nash equilibrium in games where the number of actions is polynomial in the number of players (m=poly(n)), where $N=nm^n$ is the size of the game (the input size).\n  In addition, we establish an inverse connection between the entropy of Nash equilibria in the game, and the time it takes to find such an appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4934","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+cRxDUgsC6u3qa8nDEL79PlJO8q8mx0MJfixSCujcmQl0GhlP6vL8i4Ume7X4gr4/5ZS8vJwTYGZHDk6vEOHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:23:40.285752Z"},"content_sha256":"133d8937fdbc972e86d3537d9ee1363d2245386ca758d2c06d40a190a8b661fa","schema_version":"1.0","event_id":"sha256:133d8937fdbc972e86d3537d9ee1363d2245386ca758d2c06d40a190a8b661fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VVZVTZXJGNYECLAXIYA5ACAE27/bundle.json","state_url":"https://pith.science/pith/VVZVTZXJGNYECLAXIYA5ACAE27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VVZVTZXJGNYECLAXIYA5ACAE27/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-09T00:23:40Z","links":{"resolver":"https://pith.science/pith/VVZVTZXJGNYECLAXIYA5ACAE27","bundle":"https://pith.science/pith/VVZVTZXJGNYECLAXIYA5ACAE27/bundle.json","state":"https://pith.science/pith/VVZVTZXJGNYECLAXIYA5ACAE27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VVZVTZXJGNYECLAXIYA5ACAE27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VVZVTZXJGNYECLAXIYA5ACAE27","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":"5e67da7ce525d9dcd603db7d51a2fc112a0f03c1db83404d9a813015853b0bed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-18T13:23:47Z","title_canon_sha256":"b546660ec47202b9d725e02f17876c149fab1e4b5559fb97ae24a28069416f94"},"schema_version":"1.0","source":{"id":"1307.4934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4934","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4934v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4934","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"VVZVTZXJGNYE","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VVZVTZXJGNYECLAX","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VVZVTZXJ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:133d8937fdbc972e86d3537d9ee1363d2245386ca758d2c06d40a190a8b661fa","target":"graph","created_at":"2026-05-18T03:18:07Z","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 prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(log(m) + log(n)) pure strategies. This result induces an $N^{\\log \\log N}$ algorithm for computing an approximate Nash equilibrium in games where the number of actions is polynomial in the number of players (m=poly(n)), where $N=nm^n$ is the size of the game (the input size).\n  In addition, we establish an inverse connection between the entropy of Nash equilibria in the game, and the time it takes to find such an appro","authors_text":"Ron Peretz, Yakov Babichenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-18T13:23:47Z","title":"Approximate Nash Equilibria via Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4934","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:b6ab8054efe1f466488b577520f291f54fbf5dd0de761d496d2d6ca7e0d85346","target":"record","created_at":"2026-05-18T03:18:07Z","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":"5e67da7ce525d9dcd603db7d51a2fc112a0f03c1db83404d9a813015853b0bed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-07-18T13:23:47Z","title_canon_sha256":"b546660ec47202b9d725e02f17876c149fab1e4b5559fb97ae24a28069416f94"},"schema_version":"1.0","source":{"id":"1307.4934","kind":"arxiv","version":1}},"canonical_sha256":"ad7359e6e93370412c174601d00804d7c25c3001df5bc320dba21fd0aa484bf0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad7359e6e93370412c174601d00804d7c25c3001df5bc320dba21fd0aa484bf0","first_computed_at":"2026-05-18T03:18:07.154944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.154944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wxjbBJGjCQsB1IrEKmnxoSi62PZzktz9oHKyfNlZiZblDN0PpSzOxal7VXbGTjALBGYt2Z5P/xIgpLAfeGv3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.155743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6ab8054efe1f466488b577520f291f54fbf5dd0de761d496d2d6ca7e0d85346","sha256:133d8937fdbc972e86d3537d9ee1363d2245386ca758d2c06d40a190a8b661fa"],"state_sha256":"f11d2b04291ac11b49a9dfecc9ea9d3bc649fc702301e96472798a25c8e4c011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfJBfNhuIKzCAbts/gippWSKilJKTG48gri7O1t27lWyZtG6EfZ2Cr5KkTB21l0kb2o1zDWingE/L+1CpyHDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:23:40.288018Z","bundle_sha256":"160e728d43561fb878986d6b6d5eb8cd201c7ffe0d4cae55a04a93e2134046c6"}}