Problem packetResearch packetR1564
Dated source and duplicate audit
Link to a section
The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.
Attempt outcome: completed
Recorded scope: No scope is recorded.
Originating problem: Capacity of the general discrete memoryless relay channel
Recorded relationships: Current status and exact unresolved remainder
Authored record and scope
- Authored title
- Dated source and duplicate audit
- Record type
- attempt
- Stored status
- completed
- Evidence grade
- sourced
- Linked research record IDs
- R1567
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
Read complete authored result summary
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exact capacity is known for degraded and other subclasses; broad inner and outer bounds remain separated in general. Unresolved remainder: No universal matching computable characterization was located.
- Reported outcome
No separate outcome supplied.
- Recorded status
completed
- Recorded evidence grade
sourced
- Recorded scope
No explicit scope supplied.
This is the build snapshot. Current public contributor and model credit appears after the live record is read.
Recognized embedded source files (0)
This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.
The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.
2Authored explanation
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 discrete memoryless relay channel capacity remains open 2026 - relay channel exact capacity decode forward compress forward cut set
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exact capacity is known for degraded and other subclasses; broad inner and outer bounds remain separated in general. Unresolved remainder: No universal matching computable characterization was located.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, T. Cover and A. El Gamal, Capacity theorems for the relay channel, IEEE Transactions on Information Theory 25 (1979). decode-forward, compress-forward, cut-set results
4How it connects
Evidence for
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1564",
"content_hash": null,
"slug": "general-relay-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: Exact capacity is known for degraded and other subclasses; broad inner and outer bounds remain separated in general. Unresolved remainder: No universal matching computable characterization was located.",
"relevance": "Documents why Capacity of the general discrete memoryless relay 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 discrete memoryless relay channel capacity remains open 2026\n- relay channel exact capacity decode forward compress forward cut set\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: Exact capacity is known for degraded and other subclasses; broad inner and outer bounds remain separated in general. Unresolved remainder: No universal matching computable characterization was located.",
"status": "completed",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://doi.org/10.1109/TIT.1979.1056084",
"locator": "T. Cover and A. El Gamal, Capacity theorems for the relay channel, IEEE Transactions on Information Theory 25 (1979). decode-forward, compress-forward, cut-set results"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1109/TIT.1979.1056084",
"locator": "T. Cover and A. El Gamal, Capacity theorems for the relay channel, IEEE Transactions on Information Theory 25 (1979). decode-forward, compress-forward, cut-set results"
},
"models": [],
"relations": [
{
"slug": "R1567",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "evidences",
"direction": "outgoing"
},
{
"slug": "general-relay-channel-capacity",
"title": "general relay channel capacity",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.