{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1231",
  "content_hash": null,
  "slug": "erdos-problem-33-attempt-resolution-route",
  "type": "attempt",
  "title": "Resolve the stated acceptance condition",
  "summary": "Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 33: A set \\(A \\subseteq \\mathbb{N}\\) is called a square-additive basis if every natural number \\(k\\) can be written as \\(k = a + n^2\\) for some \\(a \\in A\\) and some \\(n \\geq 0\\). For a square-additive basis \\(A\\), define its upper square-root density as\n\\[\n\\limsup_{N \\to \\infty} \\frac{|A \\cap \\{1, 2, \\ldots, N\\}|}{\\sqrt{N}}.\n\\]\nDetermine the exact value of the infimum of the upper square-root density over all square-additive bases \\(A \\subseteq \\mathbb{N}\\).",
  "relevance": "For The minimal upper density of a square-additive basis for the natural numbers, record erdos-problem-33-attempt-resolution-route (“Resolve the stated acceptance condition”) documents a concrete method, search boundary, or failed route. The record states: Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 33: A set \\(A \\subseteq \\mathbb{N}\\) is called a square-additive basis if every natural number \\(k\\) can be written as \\(k = a + n^2\\) for some \\(a \\in A\\) and some \\(n \\geq 0\\).",
  "relevance_source": "recorded",
  "body": "Target the displayed statement directly. Give a rigorous proof or counterexample that completely resolves this statement: Erdős Problem 33: A set \\(A \\subseteq \\mathbb{N}\\) is called a square-additive basis if every natural number \\(k\\) can be written as \\(k = a + n^2\\) for some \\(a \\in A\\) and some \\(n \\geq 0\\). For a square-additive basis \\(A\\), define its upper square-root density as\n\\[\n\\limsup_{N \\to \\infty} \\frac{|A \\cap \\{1, 2, \\ldots, N\\}|}{\\sqrt{N}}.\n\\]\nDetermine the exact value of the infimum of the upper square-root density over all square-additive bases \\(A \\subseteq \\mathbb{N}\\). Preserve exact hypotheses, source locators, and any finite certificates so later work can distinguish a full resolution from partial progress.",
  "status": "open_strategy",
  "evidence_grade": "self_reported",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://www.erdosproblems.com/33",
      "locator": "Editorial research route recorded 2026-07-31"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://www.erdosproblems.com/33",
    "locator": "Editorial research route recorded 2026-07-31"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1232",
      "title": "Current status and unresolved remainder",
      "object_type": "claim",
      "relation": "addresses",
      "direction": "outgoing"
    },
    {
      "slug": "erdos-problem-33",
      "title": "erdos problem 33",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}