[#R1560] Dated source and duplicate audit
1Summary
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.
The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.
Queries included: - general two user Gaussian interference channel exact capacity remains open 2026 - Gaussian interference channel capacity within one bit exact region
Supported evidence. Replay readiness: source only.
2Outcome
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
3Overview
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.
4How it connects
Evidence for
- claim
Recorded for
- problem
5Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1560",
"content_hash": null,
"slug": "gaussian-interference-channel-capacity-attempt-dated-source-audit",
"type": "attempt",
"title": "Dated source and duplicate audit",
"summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.",
"relevance": "Documents why Exact capacity region of the two-user Gaussian interference channel was treated as a distinct open target on 2026-08-01.",
"relevance_source": "recorded",
"body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- general two user Gaussian interference channel exact capacity remains open 2026\n- Gaussian interference channel capacity within one bit exact region\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: The Han-Kobayashi scheme with modern analysis achieves rates within one bit of capacity universally; several parameter regimes are exact. Unresolved remainder: A matching exact capacity region for arbitrary gains and powers remains unknown.",
"status": "completed",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"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": "evidences",
"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
- Source
- arxiv.org ↗
- Public record
- R1560
- Stable alias
- gaussian-interference-channel-capacity-attempt-dated-source-audit
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.