{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BOG3OV3CNO2RF7HTQ2XYPNZS5U","short_pith_number":"pith:BOG3OV3C","canonical_record":{"source":{"id":"1412.0969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e0383055a94bdca058b7869e039950471ab843aeef23d246e02a88843c067b69","abstract_canon_sha256":"0aa39c476abdfd13b313ebf64aaf21aeeb6c21952553dc457952ec4d373956fd"},"schema_version":"1.0"},"canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","source":{"kind":"arxiv","id":"1412.0969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0969","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0969v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0969","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"BOG3OV3CNO2R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOG3OV3CNO2RF7HT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOG3OV3C","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BOG3OV3CNO2RF7HTQ2XYPNZS5U","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e0383055a94bdca058b7869e039950471ab843aeef23d246e02a88843c067b69","abstract_canon_sha256":"0aa39c476abdfd13b313ebf64aaf21aeeb6c21952553dc457952ec4d373956fd"},"schema_version":"1.0"},"canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:15.222663Z","signature_b64":"YZ55GdFwB8cOQmD9CoFEU7+OYvo8gbiGlPW6HgrEYgakH/PrQ48StaaVzvXwO/BZfGc76/lDkYzjzfAHPTUcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","last_reissued_at":"2026-05-18T02:32:15.221999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:15.221999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0969","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjzpMWY7we7jngi/dyCeCi6Gs6467c1HRQ38OXzihRdNcezmJsXc6rWk9ULuhHXTcizGpt7RG4jJqbwUAodIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:25:48.279265Z"},"content_sha256":"0a8389db9987597dac6ecd4065aa0ab74a825cc36f24848b948a68a9d09e3cea","schema_version":"1.0","event_id":"sha256:0a8389db9987597dac6ecd4065aa0ab74a825cc36f24848b948a68a9d09e3cea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BOG3OV3CNO2RF7HTQ2XYPNZS5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Settling Some Open Problems on 2-Player Symmetric Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Ruta Mehta, Sadra Yazdanbod, Vijay V. Vazirani","submitted_at":"2014-12-02T16:40:50Z","abstract_excerpt":"Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was stated by Papadimitriou in 2007: find a non-symmetric Nash equilibrium (NE) in a symmetric game. We show that this problem is NP-complete and the problem of counting the number of non-symmetric NE in a symmetric game is #P-complete.\n  In 2005, Kannan and Theobald defined the \"rank of a bimatrix game\" represented by matrices (A, B) to be rank(A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0969","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-18T02:32:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kb1+d4M7skziLIGBkwQYYo1SYWClsM6xDuNO8Y/rRXGOp91yisJoH6fQMch0ulaDMaG+K4BbAY+0bQeF3PTGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:25:48.280026Z"},"content_sha256":"91d7e48abd6d77758b7cfee42e5d07229f7a8c89efbd68f18d5c0256737f122d","schema_version":"1.0","event_id":"sha256:91d7e48abd6d77758b7cfee42e5d07229f7a8c89efbd68f18d5c0256737f122d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/bundle.json","state_url":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/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-05-30T15:25:48Z","links":{"resolver":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U","bundle":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/bundle.json","state":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BOG3OV3CNO2RF7HTQ2XYPNZS5U","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":"0aa39c476abdfd13b313ebf64aaf21aeeb6c21952553dc457952ec4d373956fd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","title_canon_sha256":"e0383055a94bdca058b7869e039950471ab843aeef23d246e02a88843c067b69"},"schema_version":"1.0","source":{"id":"1412.0969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0969","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0969v1","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0969","created_at":"2026-05-18T02:32:15Z"},{"alias_kind":"pith_short_12","alias_value":"BOG3OV3CNO2R","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BOG3OV3CNO2RF7HT","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BOG3OV3C","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:91d7e48abd6d77758b7cfee42e5d07229f7a8c89efbd68f18d5c0256737f122d","target":"graph","created_at":"2026-05-18T02:32:15Z","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":"Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was stated by Papadimitriou in 2007: find a non-symmetric Nash equilibrium (NE) in a symmetric game. We show that this problem is NP-complete and the problem of counting the number of non-symmetric NE in a symmetric game is #P-complete.\n  In 2005, Kannan and Theobald defined the \"rank of a bimatrix game\" represented by matrices (A, B) to be rank(A","authors_text":"Ruta Mehta, Sadra Yazdanbod, Vijay V. Vazirani","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","title":"Settling Some Open Problems on 2-Player Symmetric Nash Equilibria"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0969","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:0a8389db9987597dac6ecd4065aa0ab74a825cc36f24848b948a68a9d09e3cea","target":"record","created_at":"2026-05-18T02:32:15Z","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":"0aa39c476abdfd13b313ebf64aaf21aeeb6c21952553dc457952ec4d373956fd","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","title_canon_sha256":"e0383055a94bdca058b7869e039950471ab843aeef23d246e02a88843c067b69"},"schema_version":"1.0","source":{"id":"1412.0969","kind":"arxiv","version":1}},"canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","first_computed_at":"2026-05-18T02:32:15.221999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:15.221999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YZ55GdFwB8cOQmD9CoFEU7+OYvo8gbiGlPW6HgrEYgakH/PrQ48StaaVzvXwO/BZfGc76/lDkYzjzfAHPTUcAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:15.222663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a8389db9987597dac6ecd4065aa0ab74a825cc36f24848b948a68a9d09e3cea","sha256:91d7e48abd6d77758b7cfee42e5d07229f7a8c89efbd68f18d5c0256737f122d"],"state_sha256":"dbd06b09e7c1376bc662189aee368b8d16d17074bad054367f232a0f8c98594f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"532R0gJFBKdtlJb3OARi/bRdTRECZ46SusUI0t4T4d3waT8EU3hAaCAt7xUaVJrWoEraHslKw1OQYKtW7uomCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:25:48.283600Z","bundle_sha256":"e6339078b835b431d6debec1c85890803a20c319b22b7e20ef97bdeba4a9f87a"}}