{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:25PPGXDG4G247N35NOC2JN7NGP","short_pith_number":"pith:25PPGXDG","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"},"canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","source":{"kind":"arxiv","id":"1312.1017","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1017","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1017v3","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1017","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"25PPGXDG4G24","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"25PPGXDG4G247N35","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"25PPGXDG","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:25PPGXDG4G247N35NOC2JN7NGP","target":"record","payload":{"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"},"canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","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"},"source_kind":"arxiv","source_id":"1312.1017","source_version":3,"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pWsEkhDjDTUns9xZxvR2keIAznNtDRrRYMrmmHtnpBGfIF98MIWVvmMsfkDuoQDwR11jt+bmLQ9Ef2TICg1uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:33:12.031289Z"},"content_sha256":"db8675b3639e08ec1a22feb322b010e63775087103a90297b142f2518e7cc96b","schema_version":"1.0","event_id":"sha256:db8675b3639e08ec1a22feb322b010e63775087103a90297b142f2518e7cc96b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:25PPGXDG4G247N35NOC2JN7NGP","target":"graph","payload":{"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"},"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wwMfDbAfXqQMqAv7gA/tMiecfXqohQOcpAt5dqCQyxNfTn2hNrqJaXhCNW+knCcqtzmC4eKEEOu8aNOBZGBUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:33:12.031641Z"},"content_sha256":"d7d0d88ef6d3d0dd2fd47cddb6912150bc891159a2fed4dcbef85d0b8f5548b8","schema_version":"1.0","event_id":"sha256:d7d0d88ef6d3d0dd2fd47cddb6912150bc891159a2fed4dcbef85d0b8f5548b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/bundle.json","state_url":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25PPGXDG4G247N35NOC2JN7NGP/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-29T21:33:12Z","links":{"resolver":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP","bundle":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/bundle.json","state":"https://pith.science/pith/25PPGXDG4G247N35NOC2JN7NGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25PPGXDG4G247N35NOC2JN7NGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:25PPGXDG4G247N35NOC2JN7NGP","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":"8891a98085f886a91a36ad6371ded9419eb4c2aa908fb1e9290c5d9d50843d39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-04T03:52:24Z","title_canon_sha256":"df5ab04fc353af275fbe444b2333c4f91fcc4c3bf0333ac33f47e35280bc1ed4"},"schema_version":"1.0","source":{"id":"1312.1017","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1017","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1017v3","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1017","created_at":"2026-05-18T02:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"25PPGXDG4G24","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"25PPGXDG4G247N35","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"25PPGXDG","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:d7d0d88ef6d3d0dd2fd47cddb6912150bc891159a2fed4dcbef85d0b8f5548b8","target":"graph","created_at":"2026-05-18T02:20:47Z","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 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","authors_text":"Joseph Y. Halpern, Lior Seeman, Rafael Pass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-04T03:52:24Z","title":"The Truth Behind the Myth of the Folk Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1017","kind":"arxiv","version":3},"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:db8675b3639e08ec1a22feb322b010e63775087103a90297b142f2518e7cc96b","target":"record","created_at":"2026-05-18T02:20:47Z","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":"8891a98085f886a91a36ad6371ded9419eb4c2aa908fb1e9290c5d9d50843d39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-12-04T03:52:24Z","title_canon_sha256":"df5ab04fc353af275fbe444b2333c4f91fcc4c3bf0333ac33f47e35280bc1ed4"},"schema_version":"1.0","source":{"id":"1312.1017","kind":"arxiv","version":3}},"canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d75ef35c66e1b5cfb77d6b85a4b7ed33d69ab900611edd776714290058d35352","first_computed_at":"2026-05-18T02:20:47.636454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:47.636454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbg4TQUGDelyBrJurHs/3TfekRQDO4/io0K4sIQWGGiy7zEejqOEFi6+/Hf+HxE8gEpLSL/zB7GV2QXsoa5ACw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:47.637222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1017","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db8675b3639e08ec1a22feb322b010e63775087103a90297b142f2518e7cc96b","sha256:d7d0d88ef6d3d0dd2fd47cddb6912150bc891159a2fed4dcbef85d0b8f5548b8"],"state_sha256":"dbed017836b920021ad4ab73027db551ae65ff4cb46efa6537d18c895b47fc1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"in1TCv6VjswdNbWLWUJhsbeowYkbUb+2OTN7RC9/gpKroG54uspUmUA1mgEr+yTxW/ZccDjedtHE9iZ6ADA7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:33:12.033472Z","bundle_sha256":"4504b95ff72698314ec6ec4737533d40741c44a67bab06032e9abde3793ce36a"}}