{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ALVHQQ24CAJSC32MVD2J2SSZBR","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":"2b034ced9e55dc7da6446ff2f2328d30307c5efe7294672258651fd2eaaf9f9b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-24T14:42:24Z","title_canon_sha256":"6a26267eea4f12ef39251dcc2aedd73b81affdf95581003aed7f07efd0603eb5"},"schema_version":"1.0","source":{"id":"1907.10468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10468","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10468v1","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10468","created_at":"2026-05-17T23:39:37Z"},{"alias_kind":"pith_short_12","alias_value":"ALVHQQ24CAJS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"ALVHQQ24CAJSC32M","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"ALVHQQ24","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:517a122e724c6d02381b4dda096a40c3c96db66cd3e1f0f1b47788f45a2f2303","target":"graph","created_at":"2026-05-17T23:39:37Z","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 revisit the complexity of deciding, given a {\\it bimatrix game,} whether it has a {\\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\\mathcal{NP}}$-hard~\\cite{GZ89}. We show that ${\\mathcal{NP}}$-hardness still holds under two significant restrictions in simultaneity: the game is {\\it win-lose} (that is, all {\\it utilities} are $0$ or $1$) and {\\it symmetric}. To address the former restriction, we design win-lose {\\it gadgets} and a win-lose reduction; to accomodate the latter restriction, we employ and analyze the classical {\\it ${\\maths","authors_text":"Marios Mavronicolas, Vittorio Bil\\`o","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-24T14:42:24Z","title":"The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10468","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:ad6fed9f740c4d456ea659fc429fe7b15f2a0668f665b280119b5b67ac7e5e9b","target":"record","created_at":"2026-05-17T23:39:37Z","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":"2b034ced9e55dc7da6446ff2f2328d30307c5efe7294672258651fd2eaaf9f9b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-24T14:42:24Z","title_canon_sha256":"6a26267eea4f12ef39251dcc2aedd73b81affdf95581003aed7f07efd0603eb5"},"schema_version":"1.0","source":{"id":"1907.10468","kind":"arxiv","version":1}},"canonical_sha256":"02ea78435c1013216f4ca8f49d4a590c637f0fa4f5ec81d6baba934cef931a52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02ea78435c1013216f4ca8f49d4a590c637f0fa4f5ec81d6baba934cef931a52","first_computed_at":"2026-05-17T23:39:37.842173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:37.842173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eBnor6xNb+213nNcpOEUsapwGvsRfFwB3F3BFozI6kPH68bUV/hgMkvbfoA5HRLlnruz+rTJQuf02pvs/Tj0Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:37.842691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad6fed9f740c4d456ea659fc429fe7b15f2a0668f665b280119b5b67ac7e5e9b","sha256:517a122e724c6d02381b4dda096a40c3c96db66cd3e1f0f1b47788f45a2f2303"],"state_sha256":"582fbacef133ae9afe3fd71e592beaf320b133b753696bbb1943f13ba69c44ed"}