{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1383",
  "content_hash": null,
  "slug": "avoidable-word-minimum-alphabet-claim-status-20260801",
  "type": "claim",
  "title": "Current status and exact unresolved remainder",
  "summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: General estimates and values for special pattern classes are known. Exact unresolved remainder: Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.",
  "relevance": "This is the dated publication status for the canonical target Minimum avoiding alphabet for every avoidable word.",
  "relevance_source": "recorded",
  "body": "The problem was checked as open on 2026-08-01.\n\nThe strongest neighboring result found in the cited sources is: General estimates and values for special pattern classes are known.\n\nThe exact unresolved remainder is: Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.\n\nA complete resolution must meet the following acceptance conditions:\n- Give a formula or effective complete classification returning the exact integer m(u) for every avoidable u.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.48550/arXiv.2604.04763",
      "locator": "S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.48550/arXiv.2604.04763",
    "locator": "S. Bershadsky, S. Kublanovsky, and G. Mashevitzky, “The Lyapin’s notebook: a collection of unsolved problems in Semigroup Theory,” arXiv:2604.04763 (2026). Problem 2.5 and its immediately following status paragraph"
  },
  "relations": [
    {
      "slug": "R1382",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1380",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1381",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "avoidable-word-minimum-alphabet",
      "title": "avoidable word minimum alphabet",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}