{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1563",
  "content_hash": null,
  "slug": "gaussian-interference-channel-capacity-claim-status-20260801",
  "type": "claim",
  "title": "Current status and exact unresolved remainder",
  "summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Exact unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.",
  "relevance": "This is the dated publication status for the canonical target Exact capacity region of the two-user Gaussian interference channel.",
  "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: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact.\n\nThe exact unresolved remainder is: A matching exact capacity region for arbitrary gains and powers remains unknown.\n\nA complete resolution must meet the following acceptance conditions:\n- Give matching single-letter or computable inner and outer bounds for all parameters a,b,P₁,P₂.\n- Or prove that no proposed finite-letter characterization can hold under a precisely stated formulation and replace it with an exact operational characterization.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://arxiv.org/abs/cs/0702045",
      "locator": "R. Etkin, D. Tse, and H. Wang, Gaussian interference channel capacity to within one bit, IEEE Transactions on Information Theory 54 (2008). main one-bit theorem"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/cs/0702045",
    "locator": "R. Etkin, D. Tse, and H. Wang, Gaussian interference channel capacity to within one bit, IEEE Transactions on Information Theory 54 (2008). main one-bit theorem"
  },
  "models": [],
  "relations": [
    {
      "slug": "R1562",
      "title": "Strongest checked neighboring result",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R1560",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R1561",
      "title": "Work at the unresolved boundary",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "gaussian-interference-channel-capacity",
      "title": "gaussian interference channel capacity",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}