{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RO2V26AVRTEA6B3XOANEQL6QYV","short_pith_number":"pith:RO2V26AV","canonical_record":{"source":{"id":"1104.3760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a6cf835e18cb0aa7aa6382323bf8cccee3f2d27e5c0b47c9d0e22f55b5230880","abstract_canon_sha256":"f265026641f34dcd826364d4f54758382a2aa0a3332d9a4389d723d7f941c947"},"schema_version":"1.0"},"canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","source":{"kind":"arxiv","id":"1104.3760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3760","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3760v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3760","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"RO2V26AVRTEA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RO2V26AVRTEA6B3X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RO2V26AV","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RO2V26AVRTEA6B3XOANEQL6QYV","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a6cf835e18cb0aa7aa6382323bf8cccee3f2d27e5c0b47c9d0e22f55b5230880","abstract_canon_sha256":"f265026641f34dcd826364d4f54758382a2aa0a3332d9a4389d723d7f941c947"},"schema_version":"1.0"},"canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.735967Z","signature_b64":"Z7rGGG7eKjEzqMEOdM0+Kn513j9bJl/CO8gvObqSylQcZri/bdmemLqRFnAN7sIZlhbFmb5tqyzQGCeG+oxWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","last_reissued_at":"2026-05-18T04:23:55.735573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.735573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3760","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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lt90XGmuKtDrC4KXJkynG/nIFp6OqVKfzK8qZ7mNGPn1ObVgLdV7JqKfa0S4ieMG3Sq7DC26xR4ogC5WfvnDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:15:13.623774Z"},"content_sha256":"356f07c23a89e577fda87ac82a85c8f2d39905762ec5dfa8bfbd9c5cc34aa247","schema_version":"1.0","event_id":"sha256:356f07c23a89e577fda87ac82a85c8f2d39905762ec5dfa8bfbd9c5cc34aa247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RO2V26AVRTEA6B3XOANEQL6QYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inapproximability of NP-Complete Variants of Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Eden Chlamtac, Mark Braverman, Per Austrin","submitted_at":"2011-04-19T14:26:03Z","abstract_excerpt":"In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an $\\eps$-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size $O(\\log n)$ in the random graph $G(n,1/2)$. This raises the question of whether a similar intractability holds for approximate Nash equilibrium without such constraints. We give evidence that the constraint of near-optimal value makes the problem distinctly harder: a simple algorithm finds an optimal 1/2-approximate equilibrium, while finding strictly better than 1/2-approximate equilib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3760","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-18T04:23:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ybLPsQdkJDb3bhgP1QJh1+UkaFflnkyooNcerqhkP9n2maCPqBNXtgC+vmGXHSTLuwuTXbiXI/FMCtkYF6/bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:15:13.624115Z"},"content_sha256":"67b252d3cd9c338e8bdfeeab7c7e75268dc42cd5d599a7a8a2be986a986683d0","schema_version":"1.0","event_id":"sha256:67b252d3cd9c338e8bdfeeab7c7e75268dc42cd5d599a7a8a2be986a986683d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/bundle.json","state_url":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RO2V26AVRTEA6B3XOANEQL6QYV/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-23T23:15:13Z","links":{"resolver":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV","bundle":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/bundle.json","state":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RO2V26AVRTEA6B3XOANEQL6QYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RO2V26AVRTEA6B3XOANEQL6QYV","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":"f265026641f34dcd826364d4f54758382a2aa0a3332d9a4389d723d7f941c947","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","title_canon_sha256":"a6cf835e18cb0aa7aa6382323bf8cccee3f2d27e5c0b47c9d0e22f55b5230880"},"schema_version":"1.0","source":{"id":"1104.3760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3760","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3760v1","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3760","created_at":"2026-05-18T04:23:55Z"},{"alias_kind":"pith_short_12","alias_value":"RO2V26AVRTEA","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RO2V26AVRTEA6B3X","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RO2V26AV","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:67b252d3cd9c338e8bdfeeab7c7e75268dc42cd5d599a7a8a2be986a986683d0","target":"graph","created_at":"2026-05-18T04:23:55Z","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":"In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an $\\eps$-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size $O(\\log n)$ in the random graph $G(n,1/2)$. This raises the question of whether a similar intractability holds for approximate Nash equilibrium without such constraints. We give evidence that the constraint of near-optimal value makes the problem distinctly harder: a simple algorithm finds an optimal 1/2-approximate equilibrium, while finding strictly better than 1/2-approximate equilib","authors_text":"Eden Chlamtac, Mark Braverman, Per Austrin","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","title":"Inapproximability of NP-Complete Variants of Nash Equilibrium"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3760","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:356f07c23a89e577fda87ac82a85c8f2d39905762ec5dfa8bfbd9c5cc34aa247","target":"record","created_at":"2026-05-18T04:23:55Z","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":"f265026641f34dcd826364d4f54758382a2aa0a3332d9a4389d723d7f941c947","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","title_canon_sha256":"a6cf835e18cb0aa7aa6382323bf8cccee3f2d27e5c0b47c9d0e22f55b5230880"},"schema_version":"1.0","source":{"id":"1104.3760","kind":"arxiv","version":1}},"canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","first_computed_at":"2026-05-18T04:23:55.735573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:55.735573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z7rGGG7eKjEzqMEOdM0+Kn513j9bJl/CO8gvObqSylQcZri/bdmemLqRFnAN7sIZlhbFmb5tqyzQGCeG+oxWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:55.735967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:356f07c23a89e577fda87ac82a85c8f2d39905762ec5dfa8bfbd9c5cc34aa247","sha256:67b252d3cd9c338e8bdfeeab7c7e75268dc42cd5d599a7a8a2be986a986683d0"],"state_sha256":"104d83ca5d6ce923157b48e9b7162e866ff18060554af8ee684ebe4c7e951d5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3m6eeHjxXGzO+m3TXGSwQazKqAkkrkEZVv1jqgPslbxF1BhMN2ppNKKl+Gu5iG1qqfS8X8dU/4gt/O3V8j7bCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:15:13.626039Z","bundle_sha256":"20480847c87e9de4f824d2d8cc681508c13281f5977f8cefde82e6c83b2e76f8"}}