{
  "vercy": "1.0-draft",
  "publication": {
    "status": "research-draft",
    "adjudicationStatus": "unreviewed",
    "publishableCanonical": false,
    "generatedAt": "2026-09-12T20:49:57Z",
    "providers": [
      "Claude"
    ],
    "breadth": "written by Claude from model knowledge without web access - no source was read, every claim is a lead to verify",
    "pass": 2,
    "wave": 3,
    "engine": "claude",
    "enrichment": {
      "pass": 3,
      "engine": "claude",
      "producedAt": "2026-10-06T10:00:00Z",
      "ingestedAt": "2026-10-06T07:01:33+00:00",
      "fields": [
        "agent_conduct",
        "ethics",
        "owners"
      ]
    },
    "gate": {
      "passed": true,
      "version": "1.0",
      "at": "2026-10-06T19:52:01+00:00",
      "evidence": [
        "completeness 1.00",
        "sense: Wikidata description",
        "2 live sources",
        "review by codex: pass"
      ]
    }
  },
  "metaModel": {
    "id": "THING-Q7233029",
    "registryId": "vr.tr.poset-game",
    "name": "poset game",
    "version": "0.2.0-wave.3",
    "entryKind": "thing",
    "family": "Thing Registry",
    "domain": [
      "XCT.REL"
    ],
    "status": "research-draft"
  },
  "canonicalUrl": "https://ver.cy/models/thing/q7233029/",
  "model": {
    "registry_id": "vr.tr.poset-game",
    "name": "poset game",
    "purpose": "Let an agent explain poset games and their rules, identify classic examples, relay known results on winning strategies and complexity with attribution, and separate poset games from other combinatorial games.",
    "definition": "A two-player impartial game played on a partially ordered set in which players alternately choose an element and remove it together with every element greater than it, the player unable to move losing under normal play; poset games include Nim, Chomp and Hackendot, and deciding the winner is hard in general although special cases are solved.",
    "what_it_is_for": "Not for anything; a family of games studied in combinatorial game theory.",
    "affordances": [
      "explain the rules and examples",
      "relay known results and strategy-stealing arguments",
      "relay complexity results",
      "distinguish from other game families"
    ],
    "distinguishing_features": [
      "Played on a partial order",
      "Upward removal rule",
      "Impartial and finite",
      "Includes Nim and Chomp"
    ],
    "appearance": "Not visible; a game on a diagram of an ordered set.",
    "visual_identification": [
      "Remove an element and everything above it",
      "Normal play convention",
      "Games with other removal rules are outside the family"
    ],
    "physical_properties": [],
    "families_and_kinds": [
      "Nim as a poset game on disjoint chains",
      "Chomp on a grid",
      "Hackendot on trees",
      "divisor games and subset games",
      "poset games on general orders"
    ],
    "related_models": [
      {
        "relation": "is a kind of",
        "target": "finite two-player zero-sum game",
        "why": "game classification"
      },
      {
        "relation": "includes",
        "target": "Chomp",
        "why": "a classic example"
      },
      {
        "relation": "includes",
        "target": "Nim",
        "why": "a special case"
      },
      {
        "relation": "is studied by",
        "target": "combinatorial game theory",
        "why": "the field"
      }
    ],
    "identifiers": [],
    "standards_and_regulation": [
      "No regulation; definitions follow the research literature"
    ],
    "failure_modes_and_hazards": [
      "Assuming a known strategy where only existence is proven",
      "Confusing misere and normal play",
      "Overstating solved cases"
    ],
    "in_scope": [],
    "out_of_scope": [],
    "characteristics": [],
    "agent_conduct": {
      "may": [
        "Explain the rules of poset games and examples such as Chomp and Nim.",
        "Compute winning positions for small games and show the reasoning."
      ],
      "must_not": [
        "Claim an explicit winning strategy where only its existence is proven.",
        "Confuse normal play with misere play.",
        "Overstate what is known about the complexity of general poset games.",
        "Present a computed result for small cases as a general theorem."
      ],
      "requires_human": [
        "Publishing a claimed new result as proven."
      ]
    },
    "ethics": {
      "considerations": [
        "Honest statements about what is proven protect students and the research record."
      ],
      "affected_parties": [
        "Students of combinatorics",
        "Researchers"
      ]
    },
    "owners": {
      "steward": "Nobody owns the concept; it belongs to the shared body of mathematics.",
      "master_systems": []
    }
  },
  "sources": [
    {
      "id": "wikidata",
      "title": "Wikidata item Q7233029: poset game",
      "url": "https://www.wikidata.org/wiki/Q7233029",
      "url_status": "live",
      "what_it_supports": "identity and sense of the item",
      "checked_by": "wikidata-api"
    },
    {
      "id": "wikipedia-en",
      "title": "Wikipedia: Poset game",
      "url": "https://en.wikipedia.org/wiki/Poset_game",
      "url_status": "live",
      "what_it_supports": "general description of the item",
      "checked_by": "wikidata-api sitelink"
    }
  ],
  "structure": {
    "bundles": [
      {
        "id": "rules",
        "name": "Rules",
        "description": "How poset games work.",
        "rationale": "Definition.",
        "layers": [
          {
            "id": "play",
            "name": "Play",
            "description": "Rules.",
            "findings": [
              {
                "id": "play-finding",
                "name": "Play",
                "description": "Play.",
                "questions": [
                  {
                    "text": "What are the rules of a poset game, and who wins?",
                    "kind": "definition"
                  },
                  {
                    "text": "Is the game a poset game or another impartial game?",
                    "kind": "boundary"
                  }
                ]
              }
            ]
          },
          {
            "id": "examples",
            "name": "Examples",
            "description": "Classic examples.",
            "findings": [
              {
                "id": "examples-finding",
                "name": "Examples",
                "description": "Examples.",
                "questions": [
                  {
                    "text": "How are Nim, Chomp and Hackendot poset games?",
                    "kind": "definition"
                  },
                  {
                    "text": "Which entry fits Chomp?",
                    "kind": "action"
                  }
                ]
              }
            ]
          }
        ]
      },
      {
        "id": "results",
        "name": "Results",
        "description": "Known results.",
        "rationale": "Theory.",
        "layers": [
          {
            "id": "strategy",
            "name": "Strategy",
            "description": "Strategy stealing.",
            "findings": [
              {
                "id": "strategy-finding",
                "name": "Strategy",
                "description": "Strategy.",
                "questions": [
                  {
                    "text": "Why does the first player win on posets with a greatest element, and what does strategy stealing show?",
                    "kind": "provenance"
                  },
                  {
                    "text": "What is proven versus constructive?",
                    "kind": "boundary"
                  }
                ]
              }
            ]
          },
          {
            "id": "solved",
            "name": "Solved",
            "description": "Solved cases.",
            "findings": [
              {
                "id": "solved-finding",
                "name": "Solved",
                "description": "Solved.",
                "questions": [
                  {
                    "text": "Which poset games are fully solved, and how?",
                    "kind": "provenance"
                  },
                  {
                    "text": "Which references are standard?",
                    "kind": "provenance"
                  }
                ]
              }
            ]
          }
        ]
      },
      {
        "id": "complexity",
        "name": "Complexity",
        "description": "Computational complexity.",
        "rationale": "Computation.",
        "layers": [
          {
            "id": "hardness",
            "name": "Hardness",
            "description": "Hardness results.",
            "findings": [
              {
                "id": "hardness-finding",
                "name": "Hardness",
                "description": "Hardness.",
                "questions": [
                  {
                    "text": "What is known about the complexity of deciding poset games?",
                    "kind": "provenance"
                  },
                  {
                    "text": "Which entry fits computational complexity?",
                    "kind": "action"
                  }
                ]
              }
            ]
          },
          {
            "id": "algorithms",
            "name": "Algorithms",
            "description": "Computing outcomes.",
            "findings": [
              {
                "id": "algorithms-finding",
                "name": "Algorithms",
                "description": "Algorithms.",
                "questions": [
                  {
                    "text": "How are outcomes computed for small posets?",
                    "kind": "action"
                  },
                  {
                    "text": "What are the limits?",
                    "kind": "measurement"
                  }
                ]
              }
            ]
          }
        ]
      },
      {
        "id": "context",
        "name": "Context",
        "description": "History and teaching.",
        "rationale": "Context.",
        "layers": [
          {
            "id": "history",
            "name": "History",
            "description": "Origins.",
            "findings": [
              {
                "id": "history-finding",
                "name": "History",
                "description": "History.",
                "questions": [
                  {
                    "text": "How did poset games develop from Nim and Chomp to the general theory?",
                    "kind": "provenance"
                  },
                  {
                    "text": "Which entry fits combinatorial game theory?",
                    "kind": "action"
                  }
                ]
              }
            ]
          },
          {
            "id": "teach",
            "name": "Teach",
            "description": "Teaching.",
            "findings": [
              {
                "id": "teach-finding",
                "name": "Teach",
                "description": "Teaching.",
                "questions": [
                  {
                    "text": "How are poset games used in teaching?",
                    "kind": "action"
                  },
                  {
                    "text": "Which misconceptions arise?",
                    "kind": "provenance"
                  }
                ]
              }
            ]
          }
        ]
      }
    ]
  },
  "openQuestions": [
    "Should Chomp and Nim be separate entries?",
    "How should complexity results be linked?",
    "Which open problems, such as explicit Chomp strategies, should be recorded?"
  ],
  "statistics": {
    "bundles": 4,
    "layers": 8,
    "findings": 8,
    "questions": 16
  }
}