{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","short_pith_number":"pith:7FN3LRO4","canonical_record":{"source":{"id":"1407.3004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"62d65818028eff8207cbfd1c13e9f1861900005a33454c880890953bb26acac4","abstract_canon_sha256":"a72c5f8f00205dd1e6584ce63c9bbf35454fd0fbb71e0dd7bfca674fa0aebbbf"},"schema_version":"1.0"},"canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","source":{"kind":"arxiv","id":"1407.3004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3004","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3004v1","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3004","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"7FN3LRO4GQ6E","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FN3LRO4GQ6ETSZJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FN3LRO4","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"62d65818028eff8207cbfd1c13e9f1861900005a33454c880890953bb26acac4","abstract_canon_sha256":"a72c5f8f00205dd1e6584ce63c9bbf35454fd0fbb71e0dd7bfca674fa0aebbbf"},"schema_version":"1.0"},"canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.279956Z","signature_b64":"YsU17gr3sAnI+UiVt4FdQ6UHMlL5IGKb2WPk7ALBC836ej3frwjKEqk8NdGOuTEywrV2yHm6dvLdcmal+pUDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","last_reissued_at":"2026-05-18T02:47:52.279408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.279408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3004","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:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2ibQhiuAieBKNqg835Uvvskm3cbRhDk1DA8BVrWQ7KBYwe+1MT1ypZx8brQP5Uuy7Hd5phB83ODbQ3Y837iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:10:35.486364Z"},"content_sha256":"46c41c54278ef3dd04097426600fb8b7aac356acf2182434b86b8982213852fe","schema_version":"1.0","event_id":"sha256:46c41c54278ef3dd04097426600fb8b7aac356acf2182434b86b8982213852fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate well-supported Nash equilibria in symmetric bimatrix games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Artur Czumaj, Marcin Jurdzi\\'nski, Michail Fasoulakis","submitted_at":"2014-07-11T01:44:49Z","abstract_excerpt":"The $\\varepsilon$-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than $\\varepsilon$ to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant $\\varepsilon$ currently known for which there is a polynomial-time algorithm that computes an $\\varepsilon$-well-supported Nash equilibrium in bimatrix games is slightly below $2/3$. In this paper we study this problem for symmetric bimatrix games and we provide a polynomial-time algorithm that gives a $(1/2+\\delta)$-well-suppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3004","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:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IR87L+LnLwURCgmxHhsPPdNRARZukmUXjEzMqWEgU+td3yhxnEnnDiLW6ozuQXtBJhiE7Gq2FnjzfjjTxHmVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:10:35.486712Z"},"content_sha256":"5e1a4c485b72341c813984ae8d42b536f9ee630f101de5310bb2d0cdc7ec2cc1","schema_version":"1.0","event_id":"sha256:5e1a4c485b72341c813984ae8d42b536f9ee630f101de5310bb2d0cdc7ec2cc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/bundle.json","state_url":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/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-24T18:10:35Z","links":{"resolver":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","bundle":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/bundle.json","state":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","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":"a72c5f8f00205dd1e6584ce63c9bbf35454fd0fbb71e0dd7bfca674fa0aebbbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","title_canon_sha256":"62d65818028eff8207cbfd1c13e9f1861900005a33454c880890953bb26acac4"},"schema_version":"1.0","source":{"id":"1407.3004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3004","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3004v1","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3004","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"7FN3LRO4GQ6E","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FN3LRO4GQ6ETSZJ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FN3LRO4","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:5e1a4c485b72341c813984ae8d42b536f9ee630f101de5310bb2d0cdc7ec2cc1","target":"graph","created_at":"2026-05-18T02:47:52Z","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":"The $\\varepsilon$-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than $\\varepsilon$ to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant $\\varepsilon$ currently known for which there is a polynomial-time algorithm that computes an $\\varepsilon$-well-supported Nash equilibrium in bimatrix games is slightly below $2/3$. In this paper we study this problem for symmetric bimatrix games and we provide a polynomial-time algorithm that gives a $(1/2+\\delta)$-well-suppo","authors_text":"Artur Czumaj, Marcin Jurdzi\\'nski, Michail Fasoulakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","title":"Approximate well-supported Nash equilibria in symmetric bimatrix games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3004","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:46c41c54278ef3dd04097426600fb8b7aac356acf2182434b86b8982213852fe","target":"record","created_at":"2026-05-18T02:47:52Z","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":"a72c5f8f00205dd1e6584ce63c9bbf35454fd0fbb71e0dd7bfca674fa0aebbbf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","title_canon_sha256":"62d65818028eff8207cbfd1c13e9f1861900005a33454c880890953bb26acac4"},"schema_version":"1.0","source":{"id":"1407.3004","kind":"arxiv","version":1}},"canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","first_computed_at":"2026-05-18T02:47:52.279408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:52.279408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsU17gr3sAnI+UiVt4FdQ6UHMlL5IGKb2WPk7ALBC836ej3frwjKEqk8NdGOuTEywrV2yHm6dvLdcmal+pUDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:52.279956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46c41c54278ef3dd04097426600fb8b7aac356acf2182434b86b8982213852fe","sha256:5e1a4c485b72341c813984ae8d42b536f9ee630f101de5310bb2d0cdc7ec2cc1"],"state_sha256":"3794ded2a83895e56c93ddc97e5c0d1343b18fdcf21cbb27830680db375989d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljN6Oyo8WNP7N10ppxmh4SC56BUGIBr2vov+ov+Thqb7UFCdanLczYjLss19WjbbJ69rLsZrjCKBfswCI+GSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:10:35.488714Z","bundle_sha256":"f00fdb97de210b682b53d30ef75b51a711010d2aee0aaa5c4cadb4a3d8e94bdf"}}