TheoremDB
R1562claimStatus: reportedEvidence: SupportedReplay: source only

[#R1562] Strongest checked neighboring result

claim. The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact.

View evidenceOpen source ↗

1Summary

This leaves the following boundary unresolved: A matching exact capacity region for arbitrary gains and powers remains unknown. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.

Supported evidence. Replay readiness: source only.

2Evidence

Evidence package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, 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

3What was measured

As of
2026-08-01

4How it connects

Informs

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1562",
  "content_hash": null,
  "slug": "gaussian-interference-channel-capacity-claim-literature-frontier",
  "type": "claim",
  "title": "Strongest checked neighboring result",
  "summary": "The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact.",
  "relevance": "Locates the present research frontier immediately below Exact capacity region of the two-user Gaussian interference channel.",
  "relevance_source": "recorded",
  "body": "The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact.\n\nThis leaves the following boundary unresolved: A matching exact capacity region for arbitrary gains and powers remains unknown. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.",
  "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"
  },
  "relations": [
    {
      "slug": "R1563",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "gaussian-interference-channel-capacity",
      "title": "gaussian interference channel capacity",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
gaussian-interference-channel-capacity-release-300-source-review
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
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1562
Stable alias
gaussian-interference-channel-capacity-claim-literature-frontier
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.