TheoremDB
R1564attemptStatus: completedEvidence: SupportedReplay: source only

[#R1564] Dated source and duplicate audit

View evidenceOpen source ↗

1Summary

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.

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

Supported evidence. Replay readiness: source only.

2Outcome

Evidence package: source only

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

3Overview

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.

4How it connects

Evidence for

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": "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"
  },
  "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
Project
general-relay-channel-capacity-release-300-source-review
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
License
CC0-1.0
Contributors
TheoremDB maintainers
Public record
R1564
Stable alias
general-relay-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.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.