{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:25PPGXDG4G247N35NOC2JN7NGP","short_pith_number":"pith:25PPGXDG","schema_version":"1.0","canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","source":{"kind":"arxiv","id":"1312.1017","version":3},"attestation_state":"computed","paper":{"title":"The Truth Behind the Myth of the Folk Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern, Lior Seeman, Rafael Pass","submitted_at":"2013-12-04T03:52:24Z","abstract_excerpt":"We study the problem of computing an $\\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players as polynomial-time Turing machines that maintain state ---and make some standard cryptographic hardness assumptions (the existence of public-key encryption), the problem can actually be solved in polynomial time. Our algorithm works not only for games with a finite number of players, but also for constant-degree graphical games.\n  As Nash equilibrium is a w"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.1017","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-04T03:52:24Z","cross_cats_sorted":[],"title_canon_sha256":"df5ab04fc353af275fbe444b2333c4f91fcc4c3bf0333ac33f47e35280bc1ed4","abstract_canon_sha256":"8891a98085f886a91a36ad6371ded9419eb4c2aa908fb1e9290c5d9d50843d39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:47.637222Z","signature_b64":"xbg4TQUGDelyBrJurHs/3TfekRQDO4/io0K4sIQWGGiy7zEejqOEFi6+/Hf+HxE8gEpLSL/zB7GV2QXsoa5ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","last_reissued_at":"2026-05-18T02:20:47.636454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:47.636454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Truth Behind the Myth of the Folk Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Joseph Y. Halpern, Lior Seeman, Rafael Pass","submitted_at":"2013-12-04T03:52:24Z","abstract_excerpt":"We study the problem of computing an $\\epsilon$-Nash equilibrium in repeated games. Earlier work by Borgs et al. [2010] suggests that this problem is intractable. We show that if we make a slight change to their model---modeling the players as polynomial-time Turing machines that maintain state ---and make some standard cryptographic hardness assumptions (the existence of public-key encryption), the problem can actually be solved in polynomial time. Our algorithm works not only for games with a finite number of players, but also for constant-degree graphical games.\n  As Nash equilibrium is a w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1017","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.1017","created_at":"2026-05-18T02:20:47.636564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1017v3","created_at":"2026-05-18T02:20:47.636564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1017","created_at":"2026-05-18T02:20:47.636564+00:00"},{"alias_kind":"pith_short_12","alias_value":"25PPGXDG4G24","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"25PPGXDG4G247N35","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"25PPGXDG","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP","json":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP.json","graph_json":"https://pith.science/api/pith-number/25PPGXDG4G247N35NOC2JN7NGP/graph.json","events_json":"https://pith.science/api/pith-number/25PPGXDG4G247N35NOC2JN7NGP/events.json","paper":"https://pith.science/paper/25PPGXDG"},"agent_actions":{"view_html":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP","download_json":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP.json","view_paper":"https://pith.science/paper/25PPGXDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1017&json=true","fetch_graph":"https://pith.science/api/pith-number/25PPGXDG4G247N35NOC2JN7NGP/graph.json","fetch_events":"https://pith.science/api/pith-number/25PPGXDG4G247N35NOC2JN7NGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/action/storage_attestation","attest_author":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/action/author_attestation","sign_citation":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/action/citation_signature","submit_replication":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/action/replication_record"}},"created_at":"2026-05-18T02:20:47.636564+00:00","updated_at":"2026-05-18T02:20:47.636564+00:00"}