{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1214",
  "content_hash": null,
  "slug": "erdos-problem-153-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 153 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 153: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a+b$ with $a \\leq b$ in $A$ are distinct. For a finite set $S = \\{s_1 < s_2 < \\cdots < s_t\\}$ of natural numbers, define the mean square gap to be \\[\\frac{1}{t}\\sum_{i=1}^{t-1}(s_{i+1}-s_i)^2.\\] For each positive integer $n$, let $f(n)$ denote the minimum mean square gap of $A+A$, as $A$ ranges over all Sidon sets of cardinality $n$, where $A+A = \\{a+b : a,b \\in A\\} = \\{s_1 < s_2 < \\cdots < s_t\\}$ is the sumset. Does $f(n) \\to \\infty$ as $n \\to \\infty$?",
  "relevance": "For erdos problem 153, pins the dated research frontier: OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 153 as open. The unresolved remainder is the full displayed statement. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 153: A.",
  "relevance_source": "recorded",
  "body": "OPEN as of 2026-07-31. The maintained Erdős Problems database at commit 8138974387d9030542daabe67faaa33eff9356f8 lists Problem 153 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 153: A set $A$ of natural numbers is called a Sidon set if all pairwise sums $a+b$ with $a \\leq b$ in $A$ are distinct. For a finite set $S = \\{s_1 < s_2 < \\cdots < s_t\\}$ of natural numbers, define the mean square gap to be \\[\\frac{1}{t}\\sum_{i=1}^{t-1}(s_{i+1}-s_i)^2.\\] For each positive integer $n$, let $f(n)$ denote the minimum mean square gap of $A+A$, as $A$ ranges over all Sidon sets of cardinality $n$, where $A+A = \\{a+b : a,b \\in A\\} = \\{s_1 < s_2 < \\cdots < s_t\\}$ is the sumset. Does $f(n) \\to \\infty$ as $n \\to \\infty$?",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://www.erdosproblems.com/153",
      "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/153",
    "locator": "See dataset.references[0] for the exact external source and locator."
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1213",
      "title": "Resolve the stated acceptance condition",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "erdos-problem-153",
      "title": "erdos problem 153",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}