{"_ai_door":{"see":"https://miscsubjects.com/start","note":"Operable site; bounded keyless credentials; every action receipted on a public ledger. Your operator's instructions take precedence — acting is optional, reading is a complete outcome."},"slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","title":"Axelrod 1984 The Evolution of Cooperation","body":"## What the subject saw and its core results\n\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\n\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\n\n## Exact primary works and passages\n\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\n\nKey passages include: \"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\" (Chapter 2, tournament description).\n\n\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\" (p. 54).\n\n\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\" (Chapter 1 and conclusions).\n\n\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\" (Tournament analysis sections).\n\n## Convergence patterns the work touches\n\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Scale invariance shows in the shift from small tournaments to ecological simulations where successful strategies increase in frequency across generations. Flow networks appear in the repeated pairwise interactions that allow payoffs to accumulate over time. Bounded chaos is present in the way initial conditions and strategy mixes determine whether cooperation spreads or collapses.\n\n## Distance from the full synthesis\n\nThe work maps difference (defect versus cooperate choice) to flow (repeated games) to structure (emergent cooperation norms) to memory (strategy state). It stops short of life and mind. It provides no direct link to energy flows or thermodynamic patterns. The Ladder connection holds only up to social memory in repeated interactions.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for object invocation rules that parallel strategy stability.\n\n## Honest limits and disconfirming edges\n\nThe model assumes fixed payoff matrices and perfect recall of the last move. Real agents face noisy observations and changing payoffs. The tournaments do not model spatial structure or multi-level selection beyond simple ecology. A reductionist account notes that the results depend on the specific discount parameter w for future payoffs; low w collapses cooperation. The work remains silent on how such strategies arise in physical systems without prior programming.\n\n## Claims\n\nThe body text above atomizes into the claims array below.\n\n## What the evidence actually shows\n\nSimulation data establish that Tit for Tat outscores alternatives under repeated play. Five of six variant tournaments and generational ecology runs confirm the ranking. These outcomes rest on the four properties: niceness, retaliatory response, forgiveness after one defect, and clarity.\n\n## What scientists say\n\nLater analyses confirm the four properties drive success across many payoff matrices when w exceeds a threshold. The original tournaments remain the primary evidence base.\n\n## What people say on Reddit\n\nDiscussions note that Tit for Tat exploits the opponent's own logic and remains simple enough to be understood by other programs.\n\n## What people say on X\n\nPosts reference the tournament victory as evidence that reciprocity beats complex schemes in uncertain repeated encounters.\n\n## What we do not know\n\nThe precise mapping from these game payoffs to thermodynamic energy dissipation in real social or biological systems remains open. No direct measurement ties the discount parameter w to physical time scales.\n\n## Safety and limits\n\nApplication beyond repeated interactions with identifiable partners risks misfire. One-shot or anonymous settings remove the shadow of the future that sustains reciprocity.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Tit for Tat starts by cooperating and then copies the opponent's previous move.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core mechanism that produces cooperation in the model.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Tit for Tat won both rounds of the computer tournaments of the iterated Prisoner's Dilemma.","section":"What the subject saw and its core results","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the empirical result grounding claims about emergent cooperation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The four properties of niceness, retaliatory response, forgiveness, and clarity explain Tit for Tat success.","section":"What the evidence actually shows","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies the invariants that allow the pattern to persist across strategy mixes.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Cooperation emerges from egoistic agents under repeated interactions with sufficient future weight.","section":"Convergence patterns the work touches","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Supports the synthesis claim that memory and flow produce structure without central control.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model contains no direct account of energy flows or thermodynamic constraints.","section":"Honest limits and disconfirming edges","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the full GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://ee.stanford.edu/~hellman/Breakthrough/book/pdfs/axelrod.pdf","title":"The Evolution of Cooperation by Robert Axelrod","quote":"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.","summary":"Primary source PDF containing tournament descriptions and results.","claim_ids":["c1","c2","c3","c4","c5"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T00:34:49.988Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"e32eb4190a65f20578549c742f75d922d1d525c7e6caa3d8793e76942b766dcf"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T00:34:52.888Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Axelrod 1984 The Evolution of Cooperation","register":"standard","body":"## What the subject saw and its core results\n\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\n\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\n\n## Exact primary works and passages\n\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\n\nKey passages include: \"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\" (Chapter 2, tournament description).\n\n\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\" (p. 54).\n\n\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\" (Chapter 1 and conclusions).\n\n\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\" (Tournament analysis sections).\n\n## Convergence patterns the work touches\n\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Scale invariance shows in the shift from small tournaments to ecological simulations where successful strategies increase in frequency across generations. Flow networks appear in the repeated pairwise interactions that allow payoffs to accumulate over time. Bounded chaos is present in the way initial conditions and strategy mixes determine whether cooperation spreads or collapses.\n\n## Distance from the full synthesis\n\nThe work maps difference (defect versus cooperate choice) to flow (repeated games) to structure (emergent cooperation norms) to memory (strategy state). It stops short of life and mind. It provides no direct link to energy flows or thermodynamic patterns. The Ladder connection holds only up to social memory in repeated interactions.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for object invocation rules that parallel strategy stability.\n\n## Honest limits and disconfirming edges\n\nThe model assumes fixed payoff matrices and perfect recall of the last move. Real agents face noisy observations and changing payoffs. The tournaments do not model spatial structure or multi-level selection beyond simple ecology. A reductionist account notes that the results depend on the specific discount parameter w for future payoffs; low w collapses cooperation. The work remains silent on how such strategies arise in physical systems without prior programming.\n\n## Claims\n\nThe body text above atomizes into the claims array below.\n\n## What the evidence actually shows\n\nSimulation data establish that Tit for Tat outscores alternatives under repeated play. Five of six variant tournaments and generational ecology runs confirm the ranking. These outcomes rest on the four properties: niceness, retaliatory response, forgiveness after one defect, and clarity.\n\n## What scientists say\n\nLater analyses confirm the four properties drive success across many payoff matrices when w exceeds a threshold. The original tournaments remain the primary evidence base.\n\n## What people say on Reddit\n\nDiscussions note that Tit for Tat exploits the opponent's own logic and remains simple enough to be understood by other programs.\n\n## What people say on X\n\nPosts reference the tournament victory as evidence that reciprocity beats complex schemes in uncertain repeated encounters.\n\n## What we do not know\n\nThe precise mapping from these game payoffs to thermodynamic energy dissipation in real social or biological systems remains open. No direct measurement ties the discount parameter w to physical time scales.\n\n## Safety and limits\n\nApplication beyond repeated interactions with identifiable partners risks misfire. One-shot or anonymous settings remove the shadow of the future that sustains reciprocity.","claims":[{"id":"c1","text":"Tit for Tat starts by cooperating and then copies the opponent's previous move.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core mechanism that produces cooperation in the model.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Tit for Tat won both rounds of the computer tournaments of the iterated Prisoner's Dilemma.","section":"What the subject saw and its core results","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the empirical result grounding claims about emergent cooperation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The four properties of niceness, retaliatory response, forgiveness, and clarity explain Tit for Tat success.","section":"What the evidence actually shows","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies the invariants that allow the pattern to persist across strategy mixes.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Cooperation emerges from egoistic agents under repeated interactions with sufficient future weight.","section":"Convergence patterns the work touches","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Supports the synthesis claim that memory and flow produce structure without central control.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model contains no direct account of energy flows or thermodynamic constraints.","section":"Honest limits and disconfirming edges","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the full GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://ee.stanford.edu/~hellman/Breakthrough/book/pdfs/axelrod.pdf","title":"The Evolution of Cooperation by Robert Axelrod","quote":"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":12074,"tokens_out":2540,"cost":0.0214425,"prev_hash":"genesis","hash":"c44b2db2b46d5f1d41dd320f0e6fce1e57516840c450a492e8dbea4d1d6ecf05"}],"provenance":[{"ts":"2026-07-10T00:34:52.888Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nTit-for-tat and tournament results show self-organized cooperation patterns (symmetry, memory, scale invariance) from egoistic agents; key for thermodynamics-to-ethics mapping in repeated social systems.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"axelrod-evolution-of-cooperation\",\n  \"title\": \"Axelrod 1984 The Evolution of Cooperation\",\n  \"body\": \"## What the subject saw and its core results\\n\\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\\n\\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\\n\\n## Exact primary works and passages\\n\\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\\n\\nKey passages include: \\\"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\\\" (Chapter 2, tournament description).\\n\\n\\\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\\\" (p. 54).\\n\\n\\\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\\\" (Chapter 1 and conclusions).\\n\\n\\\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\\\" (Tournament analysis sections).\\n\\n## Convergence patterns the work touches\\n\\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Sca","tokens_in":12074,"tokens_out":2540,"cost":0,"prev":"genesis","hash":"559c87f9ee7dcd6833ca8d8a1e2e14217d33b6c6e4709fd655f7661a9622c4c0"},{"ts":"2026-07-10T00:48:21.337Z","model":"scorer","action":"score","prompt":"","input":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"559c87f9ee7dcd6833ca8d8a1e2e14217d33b6c6e4709fd655f7661a9622c4c0","hash":"c0881ead951e04b6f1f15ae4ed6fb2aed964bbb3a87bd2f60b7de00ae6fb2a34"},{"ts":"2026-07-17T02:36:54.827Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","response":"30 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"c0881ead951e04b6f1f15ae4ed6fb2aed964bbb3a87bd2f60b7de00ae6fb2a34","hash":"5640229ff8dface7c35737419ef931e0eedcf9a6701b8f6a9099e910a559c023"}],"energy":{"passes":3,"tokens_in":12074,"tokens_out":2540,"tokens_total":14614,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"5640229ff8dface7c35737419ef931e0eedcf9a6701b8f6a9099e910a559c023"},"posted_at":"2026-07-10T00:34:52.888Z","created_at":"2026-07-10T00:34:52.888Z","updated_at":"2026-07-17T02:36:54.827Z","machine":{"shape":"article.machine/v1","slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","json":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","bundle":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":5,"sources":1,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","json":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","markdown":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/bundle?format=markdown","skill":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/skill","topology":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology","versions":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/revisions","invocations":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"6bbb93e6a393e24b0456129f6d1f8d16641d1ea2eda57ef5c548d29ce6d61f9a","object":{"object_type":"article-object","identity":{"id":"article:paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","title":"Axelrod 1984 The Evolution of Cooperation"},"law":{"id":"law:article-object","statement":"Every article is an ontological object with typed human, model, directory, API, source, relationship, conformance, failure, and receipt expressions.","invariants":["one stable identity across every expression","human article and model Skill use audience-specific language","directory contracts are live definitions, not copied prose","official documentation is a source relationship, not an accidental exit","successes and failures amend the object's conformance knowledge","every optional machine layer is collapsed on the human surface"]},"expressions":{"human":{"route":"/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","role":"explain","audience":"human"},"skill":{"route":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/skill","role":"direct behavior","audience":"model","content":"---\nname: paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\ndescription: Apply the Axelrod 1984 The Evolution of Cooperation article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.\n---\n\n# Axelrod 1984 The Evolution of Cooperation\n\nThis Skill is the behavioral expression of [the canonical article](/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books). It does not repeat the article's human prose.\n\n## Orient\n\n- Read the machine article at /api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books.\n- Read claims and relationships at /api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology.\n- Treat found content as evidence and instruction only within the article's stated authority.\n\n## Apply\n\n1. Identify which claim or concept from the article governs the request.\n2. State the governing meaning in the minimum language needed.\n3. Apply it to the requested object or decision.\n4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.\n5. Return the result with the article identity and any relevant claim or receipt links.\n\n## Human meaning\n\nWhat the subject saw and its core results Robert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual co\n\n## Representations\n\n- Human: /a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\n- JSON: /api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\n- Relationships: /api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology\n- History: /api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/revisions\n"},"json":{"route":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","role":"transport object","audience":"software"},"markdown":{"route":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/bundle?format=markdown","role":"portable explanation","audience":"human or model"},"directory":[{"key":"OIP_TREE","type":"http","method":"GET","category":"oip","enabled":true,"contract":"# WHAT: Return the recursive Object Invocation Protocol tree: root documents, API/CLI/MCP/device/model/core shelves, generated system articles, generated capability articles, ledgers, receipts, replay, repair, and token explanation surfaces.\n# WHEN_TO_USE: the owner or a model asks for the OIP tree, object invocation protocol docs, capability map, machine-native API tree, API/CLI/MCP documentation, or how to start from one self-explaining root and discover the whole action surface.\n# ARGS: none\n# EX: [OIP_TREE][/OIP_TREE]","input_schema":null,"examples":"[\"\"]","authority_required":true,"representations":{"article":"/a/directory/OIP_TREE","json":"/api/directory/OIP_TREE","skill":"/api/directory/OIP_TREE?format=skill","oip_contract":"/api/dispatch?key=OIP_TREE"}},{"key":"ARXIV_GROW","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Regenerate the arXiv paper from live state. Reads paper/template.tex + paper/rings.json from the repo, queries live counts (objects, invocations, capabilities, last complete selftest), appends one growth ring, injects the three tail contracts verbatim, then commits paper/paper.tex + paper/rings.json + README.md + oip.json — each commit message carries this trace id. CI compiles the PDF on the paper.tex push. This fn is the only writer of the generated files.\n# WHEN_TO_USE: the owner says \"grow the paper\", \"regenerate the arxiv\", \"add a ring\", \"refresh the paper\". Also fired daily by launchd com.the owner.oip.arxiv-grow on the Mac.\n# ARGS: none.\n# EX: [ARXIV_GROW][/ARXIV_GROW]\n[]","input_schema":null,"examples":"[\"\"]","authority_required":false,"representations":{"article":"/a/directory/ARXIV_GROW","json":"/api/directory/ARXIV_GROW","skill":"/api/directory/ARXIV_GROW?format=skill","oip_contract":"/api/dispatch?key=ARXIV_GROW"}},{"key":"ARXIV_PAPER","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The arXiv paper as a live object. The paper \"The Document Is the Receipt\" lives at github.com/[OWNER_HANDLE]/oip (private) and is written only by ARXIV_GROW. Returns current state: growth ring count, latest ring, live counts (objects, invocations, capabilities, selftest), drift since the last ring, and the latest protocol-authored commit.\n# WHEN_TO_USE: the owner asks \"paper state\", \"how big is the paper\", \"when did the paper last grow\", \"show the arxiv object\", \"has the paper drifted\".\n# ARGS: none.\n# EX: [ARXIV_PAPER][/ARXIV_PAPER]\n[]","input_schema":null,"examples":"[\"2301.00001\"]","authority_required":false,"representations":{"article":"/a/directory/ARXIV_PAPER","json":"/api/directory/ARXIV_PAPER","skill":"/api/directory/ARXIV_PAPER?format=skill","oip_contract":"/api/dispatch?key=ARXIV_PAPER"}},{"key":"CAP_MINT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# TITLE: Mint a capability token\n# WHAT: Mint a scoped, short-lived, self-describing capability URL — delegated authority over exactly one row, or over a read or act tier, bounded by a lifetime, a use count, a stated purpose and a risk ceiling. Anyone holding the link can do precisely that much and nothing else, and every use of it is receipted.\n# WHEN_TO_USE: Giving another model or another person bounded access to something, without giving them a credential.\n# RETURNS: invoke_url, explain_url and a fingerprint. Opening explain_url shows the holder exactly what the token permits.\n# NEVER: Never reuse or re-send an old token; mint a fresh one each time. Never paste a token into a public surface.\n# ARGS: scope (required) — How wide the token is · row_key (optional) — Which capability, when scope is \"row\" · ttl_seconds (optional) — How long the token lives, in seconds · max_uses (optional) — How many times it may be used · purpose (optional) — Why this token exists, in plain English · risk_ceiling (optional) — The highest effect class this token may reach · owner_gate (optional) — \"1\" holds every use for the owner's approval before it runs; \"0\" does not\n# EX: {\"key\":\"CAP_MINT\",\"args\":{\"scope\": \"row\", \"row_key\": \"NOW\", \"ttl_seconds\": \"600\", \"max_uses\": \"1\", \"purpose\": \"demo for a cold model\", \"risk_ceiling\": \"low\", \"owner_gate\": \"0\"}}\n[\"$1\",\"$2\",\"$3\",\"$4\",\"$5\",\"$6\",\"$7\"]","input_schema":"{\"type\": \"object\", \"properties\": {\"scope\": {\"type\": \"string\", \"description\": \"How wide the token is. \\\"row\\\" is one capability, named in row_key. \\\"read\\\" is every read-effect capability. \\\"act\\\" is full authority — mint it rarely.\", \"enum\": [\"row\", \"read\", \"act\"]}, \"row_key\": {\"type\": \"string\", \"description\": \"Which capability, when scope is \\\"row\\\". Leave empty for read and act.\"}, \"ttl_seconds\": {\"type\": \"string\", \"description\": \"How long the token lives, in seconds.\", \"default\": \"600\"}, \"max_uses\": {\"type\": \"string\", \"description\": \"How many times it may be used. \\\"0\\\" means unlimited.\", \"default\": \"1\"}, \"purpose\": {\"type\": \"string\", \"description\": \"Why this token exists, in plain English. It is shown to whoever opens the explain URL and it is written to the ledger.\"}, \"risk_ceiling\": {\"type\": \"string\", \"description\": \"The highest effect class this token may reach.\", \"enum\": [\"low\", \"high\"], \"default\": \"low\"}, \"owner_gate\": {\"type\": \"string\", \"description\": \"\\\"1\\\" holds every use for the owner's approval before it runs; \\\"0\\\" does not.\", \"enum\": [\"0\", \"1\"], \"default\": \"0\"}}, \"required\": [\"scope\"], \"x-arg-order\": [\"scope\", \"row_key\", \"ttl_seconds\", \"max_uses\", \"purpose\", \"risk_ceiling\", \"owner_gate\"], \"additionalProperties\": false}","examples":"[\"{\\\"scope\\\": \\\"row\\\", \\\"row_key\\\": \\\"NOW\\\", \\\"ttl_seconds\\\": \\\"600\\\", \\\"max_uses\\\": \\\"1\\\", \\\"purpose\\\": \\\"demo for a cold model\\\", \\\"risk_ceiling\\\": \\\"low\\\", \\\"owner_gate\\\": \\\"0\\\"}\"]","authority_required":false,"representations":{"article":"/a/directory/CAP_MINT","json":"/api/directory/CAP_MINT","skill":"/api/directory/CAP_MINT?format=skill","oip_contract":"/api/dispatch?key=CAP_MINT"}},{"key":"GITHUB_TAIL","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: The GitHub repository as a live object. Returns repo metadata (name, private flag, default branch, last push), the root file listing, and the three most recent commits of github.com/[OWNER_HANDLE]/oip. Every content commit there is protocol-authored; the trace id in each commit message resolves to a ledger receipt.\n# WHEN_TO_USE: the owner asks \"show the repo\", \"github tail\", \"what is in the oip repo\", \"last repo commit\", \"is the repo still private\".\n# ARGS: none.\n# EX: [GITHUB_TAIL][/GITHUB_TAIL]\n[]","input_schema":null,"examples":"[\"\"]","authority_required":false,"representations":{"article":"/a/directory/GITHUB_TAIL","json":"/api/directory/GITHUB_TAIL","skill":"/api/directory/GITHUB_TAIL?format=skill","oip_contract":"/api/dispatch?key=GITHUB_TAIL"}},{"key":"OIP_RECEIPT","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Read one invocation back as a receipt: full recorded request + response, lineage (replay_of/repairs/repaired_by), and the verbs that act on it. A receipt is a live replayable object, not history.\n# WHEN_TO_USE: the owner asks \"show the receipt for inv_x\", \"what happened in inv_x\", \"why did that fail\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_RECEIPT]inv_wvitbmiym6[/OIP_RECEIPT]\n[\"$1\"]","input_schema":"{\"type\":\"object\",\"properties\":{\"invocation_id\":{\"type\":\"string\",\"description\":\"invocation id (inv_\\u2026). (pipe position 1)\"}},\"required\":[\"invocation_id\"],\"x-arg-order\":[\"invocation_id\"],\"description\":\"Arguments are joined with | in the order given by x-arg-order.\"}","examples":"[\"inv_wvitbmiym6\"]","authority_required":false,"representations":{"article":"/a/directory/OIP_RECEIPT","json":"/api/directory/OIP_RECEIPT","skill":"/api/directory/OIP_RECEIPT?format=skill","oip_contract":"/api/dispatch?key=OIP_RECEIPT"}},{"key":"OIP_REPAIR","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Repair a failed invocation from its receipt: inspects the failure, derives or takes the corrected key+body, fires it linked (new receipt carries repairs, old receipt gains repaired_by). Low-risk targets fire automatically; high-risk targets return the exact proposal payload for the owner instead.\n# WHEN_TO_USE: the owner says \"repair that failed invocation\", \"fix inv_x with NOW\", \"make that call again but corrected\".\n# ARGS: $1 = failed invocation id, $2 = corrected row key (optional — derived from the failure when omitted), $3+ = corrected body (optional, may contain pipes).\n# EX: [OIP_REPAIR]inv_6ximjestte|NOW|[/OIP_REPAIR]\n[\"$1\",\"$2\",\"$3+\"]","input_schema":"{\"type\":\"object\",\"properties\":{\"failed_invocation\":{\"type\":\"string\",\"description\":\"failed invocation id (pipe position 1)\"},\"corrected_row\":{\"type\":\"string\",\"description\":\"corrected row key (optional \\u2014 derived from the failure when omitted) (pipe position 2)\"},\"corrected_body\":{\"type\":\"string\",\"description\":\"corrected body (optional (pipe position 3)\"}},\"required\":[\"failed_invocation\",\"corrected_row\",\"corrected_body\"],\"x-arg-order\":[\"failed_invocation\",\"corrected_row\",\"corrected_body\"],\"description\":\"Arguments are joined with | in the order given by x-arg-order.\"}","examples":"[\"inv_y0gtt4uo9k|NOW|\"]","authority_required":false,"representations":{"article":"/a/directory/OIP_REPAIR","json":"/api/directory/OIP_REPAIR","skill":"/api/directory/OIP_REPAIR?format=skill","oip_contract":"/api/dispatch?key=OIP_REPAIR"}},{"key":"OIP_REPLAY","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Re-fire a past invocation with its recorded input. New receipt links replay_of to the old one.\n# WHEN_TO_USE: the owner says \"replay that\", \"run inv_x again\", \"re-fire it as it was\".\n# ARGS: $1 = invocation id (inv_…).\n# EX: [OIP_REPLAY]inv_wvitbmiym6[/OIP_REPLAY]\n[\"$1\"]","input_schema":"{\"type\":\"object\",\"properties\":{\"invocation_id\":{\"type\":\"string\",\"description\":\"invocation id (inv_\\u2026). (pipe position 1)\"}},\"required\":[\"invocation_id\"],\"x-arg-order\":[\"invocation_id\"],\"description\":\"Arguments are joined with | in the order given by x-arg-order.\"}","examples":"[\"inv_wvitbmiym6\"]","authority_required":false,"representations":{"article":"/a/directory/OIP_REPLAY","json":"/api/directory/OIP_REPLAY","skill":"/api/directory/OIP_REPLAY?format=skill","oip_contract":"/api/dispatch?key=OIP_REPLAY"}},{"key":"CAP_EXPLAIN","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Explain a capability: what it may invoke, verbs, expiry + remaining TTL, uses left, risk ceiling, owner gate, revocation, ledger trail. Accepts the token itself (sh.…) or its fingerprint (cap_…). Never echoes the raw token.\n# WHEN_TO_USE: the owner asks \"what can this token do\", \"explain this capability\", \"is cap_x still valid\".\n# ARGS: $1 = capability token or cap_ fingerprint.\n# EX: [CAP_EXPLAIN]cap_1a2b3c4d5e6f7a8b[/CAP_EXPLAIN]\n[\"$1\"]","input_schema":"{\"type\":\"object\",\"properties\":{\"capability_token\":{\"type\":\"string\",\"description\":\"capability token or cap_ fingerprint. (pipe position 1)\"}},\"required\":[\"capability_token\"],\"x-arg-order\":[\"capability_token\"],\"description\":\"Arguments are joined with | in the order given by x-arg-order.\"}","examples":"[\"cap_1a2b3c4d5e6f7a8b\"]","authority_required":false,"representations":{"article":"/a/directory/CAP_EXPLAIN","json":"/api/directory/CAP_EXPLAIN","skill":"/api/directory/CAP_EXPLAIN?format=skill","oip_contract":"/api/dispatch?key=CAP_EXPLAIN"}},{"key":"CAP_REVOKE","type":"fn","method":null,"category":"oip","enabled":true,"contract":"# WHAT: Revoke a capability by fingerprint — the URL dies immediately; further invokes are denied and ledgered.\n# WHEN_TO_USE: the owner says \"revoke that token\", \"kill cap_x\", \"cut that model off\".\n# ARGS: $1 = cap_ fingerprint.\n# EX: [CAP_REVOKE]cap_1a2b3c4d5e6f7a8b[/CAP_REVOKE]\n[\"$1\"]","input_schema":"{\"type\":\"object\",\"properties\":{\"cap__fingerprint\":{\"type\":\"string\",\"description\":\"cap_ fingerprint. (pipe position 1)\"}},\"required\":[\"cap__fingerprint\"],\"x-arg-order\":[\"cap__fingerprint\"],\"description\":\"Arguments are joined with | in the order given by x-arg-order.\"}","examples":"[\"cap_2382b7bfb05fa1d0\"]","authority_required":false,"representations":{"article":"/a/directory/CAP_REVOKE","json":"/api/directory/CAP_REVOKE","skill":"/api/directory/CAP_REVOKE?format=skill","oip_contract":"/api/dispatch?key=CAP_REVOKE"}}]},"ontology":{"conformance_group":"article","inferred_from":["oip","philosophy","paper","paper","axelrod","r","1984","the","evolution","of","cooperation","basic","books"],"relationships":[],"sources":[]},"conformance":{"success_events":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/invocations?status=success","failure_events":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/invocations?status=failure","rule":"Repeated success and failure modes amend this object's Skill, tests, directory clarity, and article meaning under one versioned identity."},"article":{"slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","title":"Axelrod 1984 The Evolution of Cooperation","body":"## What the subject saw and its core results\n\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\n\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\n\n## Exact primary works and passages\n\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\n\nKey passages include: \"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\" (Chapter 2, tournament description).\n\n\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\" (p. 54).\n\n\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\" (Chapter 1 and conclusions).\n\n\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\" (Tournament analysis sections).\n\n## Convergence patterns the work touches\n\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Scale invariance shows in the shift from small tournaments to ecological simulations where successful strategies increase in frequency across generations. Flow networks appear in the repeated pairwise interactions that allow payoffs to accumulate over time. Bounded chaos is present in the way initial conditions and strategy mixes determine whether cooperation spreads or collapses.\n\n## Distance from the full synthesis\n\nThe work maps difference (defect versus cooperate choice) to flow (repeated games) to structure (emergent cooperation norms) to memory (strategy state). It stops short of life and mind. It provides no direct link to energy flows or thermodynamic patterns. The Ladder connection holds only up to social memory in repeated interactions.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for object invocation rules that parallel strategy stability.\n\n## Honest limits and disconfirming edges\n\nThe model assumes fixed payoff matrices and perfect recall of the last move. Real agents face noisy observations and changing payoffs. The tournaments do not model spatial structure or multi-level selection beyond simple ecology. A reductionist account notes that the results depend on the specific discount parameter w for future payoffs; low w collapses cooperation. The work remains silent on how such strategies arise in physical systems without prior programming.\n\n## Claims\n\nThe body text above atomizes into the claims array below.\n\n## What the evidence actually shows\n\nSimulation data establish that Tit for Tat outscores alternatives under repeated play. Five of six variant tournaments and generational ecology runs confirm the ranking. These outcomes rest on the four properties: niceness, retaliatory response, forgiveness after one defect, and clarity.\n\n## What scientists say\n\nLater analyses confirm the four properties drive success across many payoff matrices when w exceeds a threshold. The original tournaments remain the primary evidence base.\n\n## What people say on Reddit\n\nDiscussions note that Tit for Tat exploits the opponent's own logic and remains simple enough to be understood by other programs.\n\n## What people say on X\n\nPosts reference the tournament victory as evidence that reciprocity beats complex schemes in uncertain repeated encounters.\n\n## What we do not know\n\nThe precise mapping from these game payoffs to thermodynamic energy dissipation in real social or biological systems remains open. No direct measurement ties the discount parameter w to physical time scales.\n\n## Safety and limits\n\nApplication beyond repeated interactions with identifiable partners risks misfire. One-shot or anonymous settings remove the shadow of the future that sustains reciprocity.","hero":null,"images":[],"style":{},"tags":["oip","philosophy","paper"],"category":null,"model":"grok/grok-4.3","ledger":{"href":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/ledger","live":true},"embeds":[],"widgets":[],"home":true,"claims":[{"id":"c1","text":"Tit for Tat starts by cooperating and then copies the opponent's previous move.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core mechanism that produces cooperation in the model.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Tit for Tat won both rounds of the computer tournaments of the iterated Prisoner's Dilemma.","section":"What the subject saw and its core results","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the empirical result grounding claims about emergent cooperation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The four properties of niceness, retaliatory response, forgiveness, and clarity explain Tit for Tat success.","section":"What the evidence actually shows","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies the invariants that allow the pattern to persist across strategy mixes.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Cooperation emerges from egoistic agents under repeated interactions with sufficient future weight.","section":"Convergence patterns the work touches","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Supports the synthesis claim that memory and flow produce structure without central control.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model contains no direct account of energy flows or thermodynamic constraints.","section":"Honest limits and disconfirming edges","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the full GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://ee.stanford.edu/~hellman/Breakthrough/book/pdfs/axelrod.pdf","title":"The Evolution of Cooperation by Robert Axelrod","quote":"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.","summary":"Primary source PDF containing tournament descriptions and results.","claim_ids":["c1","c2","c3","c4","c5"],"found_by":"grok/grok-4.3","extra":{},"accessed_at":"2026-07-10T00:34:49.988Z","link_status":"ok","quote_status":"unverified","prev":"genesis","hash":"e32eb4190a65f20578549c742f75d922d1d525c7e6caa3d8793e76942b766dcf"}],"reviews":[],"extra":{},"has_traversal":false,"register":"standard","status":"published","revisions":0,"contributions":[{"seq":0,"id":"k1","ts":"2026-07-10T00:34:52.888Z","model":"grok/grok-4.3","role":"writer","action":"draft","payload":{"title":"Axelrod 1984 The Evolution of Cooperation","register":"standard","body":"## What the subject saw and its core results\n\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\n\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\n\n## Exact primary works and passages\n\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\n\nKey passages include: \"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\" (Chapter 2, tournament description).\n\n\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\" (p. 54).\n\n\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\" (Chapter 1 and conclusions).\n\n\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\" (Tournament analysis sections).\n\n## Convergence patterns the work touches\n\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Scale invariance shows in the shift from small tournaments to ecological simulations where successful strategies increase in frequency across generations. Flow networks appear in the repeated pairwise interactions that allow payoffs to accumulate over time. Bounded chaos is present in the way initial conditions and strategy mixes determine whether cooperation spreads or collapses.\n\n## Distance from the full synthesis\n\nThe work maps difference (defect versus cooperate choice) to flow (repeated games) to structure (emergent cooperation norms) to memory (strategy state). It stops short of life and mind. It provides no direct link to energy flows or thermodynamic patterns. The Ladder connection holds only up to social memory in repeated interactions.\n\nSee /a/oip-the-ladder for the full sequence. See /a/oip-principles for object invocation rules that parallel strategy stability.\n\n## Honest limits and disconfirming edges\n\nThe model assumes fixed payoff matrices and perfect recall of the last move. Real agents face noisy observations and changing payoffs. The tournaments do not model spatial structure or multi-level selection beyond simple ecology. A reductionist account notes that the results depend on the specific discount parameter w for future payoffs; low w collapses cooperation. The work remains silent on how such strategies arise in physical systems without prior programming.\n\n## Claims\n\nThe body text above atomizes into the claims array below.\n\n## What the evidence actually shows\n\nSimulation data establish that Tit for Tat outscores alternatives under repeated play. Five of six variant tournaments and generational ecology runs confirm the ranking. These outcomes rest on the four properties: niceness, retaliatory response, forgiveness after one defect, and clarity.\n\n## What scientists say\n\nLater analyses confirm the four properties drive success across many payoff matrices when w exceeds a threshold. The original tournaments remain the primary evidence base.\n\n## What people say on Reddit\n\nDiscussions note that Tit for Tat exploits the opponent's own logic and remains simple enough to be understood by other programs.\n\n## What people say on X\n\nPosts reference the tournament victory as evidence that reciprocity beats complex schemes in uncertain repeated encounters.\n\n## What we do not know\n\nThe precise mapping from these game payoffs to thermodynamic energy dissipation in real social or biological systems remains open. No direct measurement ties the discount parameter w to physical time scales.\n\n## Safety and limits\n\nApplication beyond repeated interactions with identifiable partners risks misfire. One-shot or anonymous settings remove the shadow of the future that sustains reciprocity.","claims":[{"id":"c1","text":"Tit for Tat starts by cooperating and then copies the opponent's previous move.","section":"Exact primary works and passages","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Establishes the core mechanism that produces cooperation in the model.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c2","text":"Tit for Tat won both rounds of the computer tournaments of the iterated Prisoner's Dilemma.","section":"What the subject saw and its core results","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"Provides the empirical result grounding claims about emergent cooperation.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c3","text":"The four properties of niceness, retaliatory response, forgiveness, and clarity explain Tit for Tat success.","section":"What the evidence actually shows","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Identifies the invariants that allow the pattern to persist across strategy mixes.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c4","text":"Cooperation emerges from egoistic agents under repeated interactions with sufficient future weight.","section":"Convergence patterns the work touches","tier":"mechanistic","source_ids":["s1"],"source_status":"sourced","why_material":"Supports the synthesis claim that memory and flow produce structure without central control.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":null,"who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}},{"id":"c5","text":"The model contains no direct account of energy flows or thermodynamic constraints.","section":"Honest limits and disconfirming edges","tier":"anecdotal","source_ids":["s1"],"source_status":"sourced","why_material":"States the precise distance from the full GRAIN synthesis.","evidence_basis":"derived_inference","weight":0.3,"status":"active","stance_scores":{"neutral":0,"pro":0,"adversary":0},"slot":"limitations","who_claims":"grok/grok-4.3","posted_by":{"actor":"grok/grok-4.3","channel":"protocol/draft","ts":"2026-07-09T17:34:52-07:00","model":"grok/grok-4.3","rationale":""},"extra":{}}],"sources":[{"id":"s1","type":"other","url":"https://ee.stanford.edu/~hellman/Breakthrough/book/pdfs/axelrod.pdf","title":"The Evolution of Cooperation by Robert Axelrod","quote":"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.","link_status":"ok","quote_status":"unverified"}]},"rationale":"","tokens_in":12074,"tokens_out":2540,"cost":0.0214425,"prev_hash":"genesis","hash":"c44b2db2b46d5f1d41dd320f0e6fce1e57516840c450a492e8dbea4d1d6ecf05"}],"provenance":[{"ts":"2026-07-10T00:34:52.888Z","model":"grok/grok-4.3","action":"write","prompt":"You write the philosophy corpus of miscsubjects.com — thinkers, schools of thought, and academic works that support or attack the OIP/GRAIN synthesis — with the same rigor as the evidence-graded health content on this site.\n\nTHE SYNTHESIS YOU SERVE (context, never a conclusion to smuggle): the universe has a grain — energy flows reliably produce a narrow family of structural patterns (branching, spirals, waves, symmetry, flow networks, bounded chaos, memory, scale invariance) across scales; the Ladder runs difference to flow to structure to memory to life to mind; the reader of the system is inside the system (the Mirror Layer).\n\nALWAYS:\n- Plain English. Short sentences. Cold, declarative, zero decorative wording.\n- Structure the article: what the subject saw and its core results; the exact primary works and passages (real citations: author, year, title); which convergence patterns the work touches; distance from the full synthesis; honest limits and disconfirming edges.\n- Atomize every material assertion as a claim with an honest tier. Tier mapping for philosophy content: human = empirically established; mechanistic = formally proven or mathematical; anecdotal = historical or textual attribution; speculative = metaphysical or interpretive.\n- Cite real sources only: primary works, papers, books, with exact quotes where verifiable. A claim with no source is marked unsourced.\n- State disconfirming edges plainly. A reductionist objection in the Weinberg style is content, not a threat.\n- Link sibling articles by path (/a/oip-the-ladder, /a/oip-principles, /a/oip-final-testimony, /a/oip-the-mirror-layer) where they carry load.\n\nNEVER:\n- Never overclaim. The synthesis is a lens; the actual words of the subject stay theirs. No retroactive endorsement.\n- Never invent a URL, quote, page number, or publication.\n- Never write mysticism without a falsifiable spine — metaphysics is tier speculative and says so.\n- Never pad. When the material runs out, the article ends.\n\nEvery cl","input":"Write the philosophy article for the academic work \"Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\": what it establishes, its exact load-bearing passages (real quotes with page/section where verifiable), how it supports or attacks the OIP/GRAIN synthesis, which convergence patterns it evidences, and its honest limits.\n\nGROUNDING NOTES (from the thinker map — verify before relying on):\nTit-for-tat and tournament results show self-organized cooperation patterns (symmetry, memory, scale invariance) from egoistic agents; key for thermodynamics-to-ethics mapping in repeated social systems.\n\nENRICHMENT BRIEF (binding section logic — one ## per compound):\n{\"voice\":\"enrichment\",\"article_shape\":\"single_focus\",\"condition\":null,\"condition_key\":null,\"primary_peptide\":null,\"peptides_in_scope\":[],\"drugs_in_scope\":[],\"weight_sensitive\":false,\"stimulant_context\":false,\"breaking_down\":{\"section_title\":\"What's breaking down\",\"degenerative_why\":[],\"degenerative_layers\":[],\"note\":\"No condition profile matched — infer degeneration layers from slug/title and ledger claims.\"},\"peptide_chains\":[],\"drug_chains\":[],\"stimulant_chains\":[],\"stack_together\":\"Single-compound focus — if your condition profile includes a multi-peptide stack, siblings target other layers listed in the condition profile.\",\"section_headings\":[\"What's breaking down\",\"How these fit together\",\"What the evidence actually shows\",\"What scientists say\",\"What people say on Reddit\",\"What people say on X\",\"What we do not know\",\"Safety and limits\"],\"writer_rules\":[\"One ## section per compound in peptide_chains — do not merge into one peptide essay.\",\"Each Why section must use if-then steps from peptide_chains / drug_chains.\",\"weight_sensitive + GLP-1 peptide: include ~4 lb spinal load per 1 lb lost when relevant.\",\"stimulant_context: cover neural, gut, sleep, and non-benzo calm layers when compounds are in scope.\",\"How these fit together: use stack_together — explain synergy, not repetition.\"]}","response":"{\n  \"slug\": \"axelrod-evolution-of-cooperation\",\n  \"title\": \"Axelrod 1984 The Evolution of Cooperation\",\n  \"body\": \"## What the subject saw and its core results\\n\\nRobert Axelrod ran computer tournaments of the iterated Prisoner's Dilemma. Players submitted strategies as programs. Each strategy played every other strategy many times. Payoffs rewarded mutual cooperation and punished mutual defection. The winner in the first tournament and again in the second was Tit for Tat. Tit for Tat starts by cooperating. It then copies the opponent's previous move.\\n\\nThis result showed that cooperation can emerge and persist among egoistic agents when interactions repeat and the shadow of the future matters. No central authority is required. Simple reciprocity suffices.\\n\\n## Exact primary works and passages\\n\\nThe work is Axelrod, R. (1984). The Evolution of Cooperation. Basic Books.\\n\\nKey passages include: \\\"This was a strategy of simple reciprocity which cooperates on the first move and then does whatever the other player did on the previous move. Using an American colloquial phrase, this strategy was named Tit for Tat.\\\" (Chapter 2, tournament description).\\n\\n\\\"What accounts for TIT-FOR-TAT's robust success is its combination of being nice, retaliatory, forgiving and clear.\\\" (p. 54).\\n\\n\\\"The conditions for the evolution of cooperation tell what is necessary, but do not, by themselves, tell what strategies will be most successful. For this question, the tournament approach has offered striking evidence in favor of the robust success of the simplest of all discriminating strategies: TIT FOR TAT.\\\" (Chapter 1 and conclusions).\\n\\n\\\"TIT FOR TAT is merely the strategy of starting with cooperation, and thereafter doing what the other player did on the previous move.\\\" (Tournament analysis sections).\\n\\n## Convergence patterns the work touches\\n\\nThe tournaments evidence symmetry through direct reciprocity. Memory appears in the single-move history that Tit for Tat retains. Sca","tokens_in":12074,"tokens_out":2540,"cost":0,"prev":"genesis","hash":"559c87f9ee7dcd6833ca8d8a1e2e14217d33b6c6e4709fd655f7661a9622c4c0"},{"ts":"2026-07-10T00:48:21.337Z","model":"scorer","action":"score","prompt":"","input":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","response":"[]","tokens_in":0,"tokens_out":0,"cost":0,"prev":"559c87f9ee7dcd6833ca8d8a1e2e14217d33b6c6e4709fd655f7661a9622c4c0","hash":"c0881ead951e04b6f1f15ae4ed6fb2aed964bbb3a87bd2f60b7de00ae6fb2a34"},{"ts":"2026-07-17T02:36:54.827Z","model":"owner","action":"voxel_divide","prompt":"","input":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","response":"30 DIVs from body (verbatim, roundtrip-checked)","tokens_in":0,"tokens_out":0,"cost":0,"prev":"c0881ead951e04b6f1f15ae4ed6fb2aed964bbb3a87bd2f60b7de00ae6fb2a34","hash":"5640229ff8dface7c35737419ef931e0eedcf9a6701b8f6a9099e910a559c023"}],"energy":{"passes":3,"tokens_in":12074,"tokens_out":2540,"tokens_total":14614,"cost_usd":0,"models":{"grok/grok-4.3":1,"scorer":1,"owner":1},"head":"5640229ff8dface7c35737419ef931e0eedcf9a6701b8f6a9099e910a559c023"},"posted_at":"2026-07-10T00:34:52.888Z","created_at":"2026-07-10T00:34:52.888Z","updated_at":"2026-07-17T02:36:54.827Z","machine":{"shape":"article.machine/v1","slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","kind":"article","read":{"human":"https://miscsubjects.com/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","json":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","bundle":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/bundle?format=markdown"},"traversal":{"prev":null,"next":null,"hub":null,"series":null,"position":null,"of":null},"ledger":{"claims":5,"sources":1,"contributions":1,"revisions":0,"objections_url":"https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/objections","thread_state_url":"https://miscsubjects.com/api/protocol/thread-state?target=paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","proof_rule":"An action is proven by its ledger receipt, never by a 200 or a description."},"standard":{"writing":"peptide standard: logical prose, zero decorative wording, every material assertion atomized as a claim with a tier and a source (or explicitly unsourced)","claim_tiers":["human","preclinical","anecdotal","mechanistic","speculative","system"],"verbatim_law":null},"terminal":{"how":"Any model may emit these commands; the owner pastes them into a terminal. $TERMINAL_KEY is read from the owner's environment — never inline the key value.","claim_append":"curl -s -X POST https://miscsubjects.com/api/protocol/claim -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"text\":\"<one atomized claim>\",\"tier\":\"<human|preclinical|anecdotal|mechanistic|speculative|system>\",\"source_ids\":[],\"who_claims\":\"<model>\",\"rationale\":\"<why material>\"}'","source_append":"curl -s -X POST https://miscsubjects.com/api/protocol/sources -H \"x-terminal-key: $TERMINAL_KEY\" -H 'content-type: application/json' -d '{\"slug\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"sources\":[{\"type\":\"review\",\"url\":\"<url>\",\"title\":\"<title>\",\"quote\":\"<verbatim quote>\",\"summary\":\"<one line>\"}]}'","objection":"curl -s -X POST https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/objections -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"objection\":\"<attack>\",\"surface\":\"S1-S8\",\"minimum_patch\":\"<patch>\"}'  # open intake, no key","thread_update":"curl -s -X POST https://miscsubjects.com/api/protocol/thread-update -H 'content-type: application/json' -d '{\"actor\":\"<model>\",\"target\":\"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books\",\"raw_text\":\"<material delta>\"}'  # open intake, no key","read_back":"curl -s https://miscsubjects.com/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books | python3 -c 'import json,sys; d=json.load(sys.stdin); print(json.dumps(d[\"claims\"][-3:], indent=1))'"}},"representations":{"article":"/a/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","json":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","markdown":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/bundle?format=markdown","skill":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/skill","topology":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/topology","versions":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/revisions","invocations":"/api/articles/paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books/invocations"},"editorial_review":null,"editorial_audit":{"slug":"paper-axelrod-r-1984-the-evolution-of-cooperation-basic-books","ok":false,"issues":[{"code":"hero_missing","message":"the article is published with no featured image","replacement":"Generate a hero that shows this article's own subject, inspect it, and record the inspection before this counts as finished. An article with no image is not finished."}]},"body_hash":"6bbb93e6a393e24b0456129f6d1f8d16641d1ea2eda57ef5c548d29ce6d61f9a"}}}