{
  "version": "1.0.0",
  "date": "2026-10-23",
  "owner": "wordlesolver.dev",
  "thesis": "Repeated-letter feedback is a constrained allocation problem: reserve exact-position matches before assigning each remaining target letter at most once, left to right.",
  "method": "Generate every restricted-growth string of length ten (Bell number B10), split it into ordered five-position guess and target, compare a remaining-count implementation with positional matching, and check per-letter conservation.",
  "scope": "The disclosed five-position ASCII feedback rule, independent of dictionaries, daily answers, scoring strategy, and NYT production internals.",
  "reproduce": "python3 reproduce-v1.py",
  "networkRequired": false,
  "sourceInputs": "Generated restricted-growth strings, no external corpus",
  "dataInterpretation": "Computed reference outputs; no real-world frequency or accuracy estimate."
}