{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1270",
  "content_hash": null,
  "slug": "erdos-problem-91-claim-status-20260731",
  "type": "claim",
  "title": "Current status and unresolved remainder",
  "summary": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 91 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 91: For a finite set $A\\subset\\mathbb{R}^2$, let $d(A)$ denote the number of distinct Euclidean distances between pairs of distinct points of $A$. For each positive integer $n$, define $m(n)$ to be the minimum value of $d(A)$ over all sets $A\\subset\\mathbb{R}^2$ with $|A|=n$. A set $A$ with $|A|=n$ and $d(A)=m(n)$ is called optimal (for $n$). Two finite sets $A,B\\subset\\mathbb{R}^2$ are called similar if there exists a dilation of the plane mapping $A$ onto $B$ (where a dilation is a composition of a scaling and an isometry). For each $n$, we say that $n$ has a unique minimizer if all optimal sets for $n$ are similar to one another. Determine whether, for all sufficiently large integers $n$, the number $n$ does not have a unique minimizer.",
  "relevance": "For erdos problem 91, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 91 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 91: For.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 91 as open. The unresolved remainder is the full displayed statement.\n\nA complete resolution must satisfy this condition: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 91: For a finite set $A\\subset\\mathbb{R}^2$, let $d(A)$ denote the number of distinct Euclidean distances between pairs of distinct points of $A$. For each positive integer $n$, define $m(n)$ to be the minimum value of $d(A)$ over all sets $A\\subset\\mathbb{R}^2$ with $|A|=n$. A set $A$ with $|A|=n$ and $d(A)=m(n)$ is called optimal (for $n$). Two finite sets $A,B\\subset\\mathbb{R}^2$ are called similar if there exists a dilation of the plane mapping $A$ onto $B$ (where a dilation is a composition of a scaling and an isometry). For each $n$, we say that $n$ has a unique minimizer if all optimal sets for $n$ are similar to one another. Determine whether, for all sufficiently large integers $n$, the number $n$ does not have a unique minimizer.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/91",
      "locator": "See dataset.references[0] for the exact external source and locator."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/91",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1269",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "erdos-problem-91",
      "title": "erdos problem 91",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}