{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "slepian-wolf-correlated-source-coding-1973",
    "title": "Slepian and Wolf: compressing correlated data separately",
    "summary": "For two finite-alphabet iid sources, separate encoders and a joint decoder can approach the correlated-source entropy rate region, even though neither encoder sees the other input.\n\nImagine two instruments producing related streams. If each compresses in isolation using only its own stream statistics, it can miss the redundancy shared between them. Slepian and Wolf show that separate encoders can still exploit that redundancy when the decoder has both messages. The proof assigns blocks to randomly chosen code collections; the decoder uses the other stream to distinguish possibilities. Their result determines an asymptotic rate region and shows why independent access at the encoders need not require two independent compression budgets. It establishes existence under a precise model, leaving efficient finite-length code design and more general sources for further work.",
    "boundary": "Two finite-alphabet sources formed by iid draws of a fixed joint distribution; each encoder sees only its own block and a joint decoder receives both noiseless messages. The region is the closure of achievable rate pairs: Rx>=H(X|Y), Ry>=H(Y|X), Rx+Ry>=H(X, Y), in a consistent log base. Achievability means block error probability can be made arbitrarily small with increasing block length/rate slack; closure does not promise finite-block zero error at every boundary. Random-supercode existence and time sharing do not provide an efficient implementable code or finite resource guarantee. General ergodic sources, continuous alphabets, rate-distortion, many-source variants and variable-length design are expressly left open in this paper. The target is the paper on pages 471-480. This account does not supply a machine-checked proof or independently certified numerical and formula transcription. Neighboring article fragments are excluded. No practical compression benchmark, real communication reliability or later noisy-channel results absorbed.",
    "area": "Information theory",
    "topic": "Computing",
    "year": 1973,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "slepian-wolf-correlated-source-coding-1973",
    "target": {
      "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
      "version": 1,
      "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
    },
    "humans": [
      "David Slepian",
      "Jack K. Wolf"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "shannon"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-slepian-wolf-1973-original",
        "title": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480",
        "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf"
      }
    ],
    "points": "280000",
    "published_grade": {
      "id": "slepian-wolf-correlated-source-coding-1973",
      "entry_id": "slepian-wolf-correlated-source-coding-1973",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
        "version": 1,
        "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
      },
      "what_changed": "An iid correlated pair can be compressed separately down to conditional-entropy individual limits and joint-entropy total limit when decoded jointly.",
      "scope": "An iid correlated pair can be compressed separately down to conditional-entropy individual limits and joint-entropy total limit when decoded jointly. Two finite-alphabet sources formed by iid draws of a fixed joint distribution; each encoder sees only its own block and a joint decoder receives both noiseless messages. The region is the closure of achievable rate pairs: Rx>=H(X|Y), Ry>=H(Y|X), Rx+Ry>=H(X, Y), in a consistent log base. Achievability means block error probability can be made arbitrarily small with increasing block length/rate slack; closure does not promise finite-block zero error at every boundary. Random-supercode existence and time sharing do not provide an efficient implementable code or finite resource guarantee. General ergodic sources, continuous alphabets, rate-distortion, many-source variants and variable-length design are expressly left open in this paper. The target is the paper on pages 471-480. This account does not supply a machine-checked proof or independently certified numerical and formula transcription. Neighboring article fragments are excluded. No practical compression benchmark, real communication reliability or later noisy-channel results absorbed.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
        "version": 1,
        "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "David Slepian",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480",
            "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Jack K. Wolf",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480",
            "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480",
            "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Two finite-alphabet sources formed by iid draws of a fixed joint distribution; each encoder sees only its own block and a joint decoder receives both noiseless messages. The region is the closure of achievable rate pairs: Rx>=H(X|Y), Ry>=H(Y|X), Rx+Ry>=H(X, Y), in a consistent log base. Achievability means block error probability can be made arbitrarily small with increasing block length/rate slack; closure does not promise finite-block zero error at every boundary. Random-supercode existence and time sharing do not provide an efficient implementable code or finite resource guarantee. General ergodic sources, continuous alphabets, rate-distortion, many-source variants and variable-length design are expressly left open in this paper. The target is the paper on pages 471-480. This account does not supply a machine-checked proof or independently certified numerical and formula transcription. Neighboring article fragments are excluded. No practical compression benchmark, real communication reliability or later noisy-channel results absorbed.",
        "domain": "Information theory"
      },
      "sources": [
        {
          "citation": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480",
          "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf"
        }
      ],
      "statement": "# Slepian and Wolf: compressing correlated data separately\n\nFor two finite-alphabet iid sources, separate encoders and a joint decoder can approach the correlated-source entropy rate region, even though neither encoder sees the other input.\n\nImagine two instruments producing related streams. If each compresses in isolation using only its own stream statistics, it can miss the redundancy shared between them. Slepian and Wolf show that separate encoders can still exploit that redundancy when the decoder has both messages. The proof assigns blocks to randomly chosen code collections; the decoder uses the other stream to distinguish possibilities. Their result determines an asymptotic rate region and shows why independent access at the encoders need not require two independent compression budgets. It establishes existence under a precise model, leaving efficient finite-length code design and more general sources for further work.\n\n## Scientific scope\n\nTwo finite-alphabet sources formed by iid draws of a fixed joint distribution; each encoder sees only its own block and a joint decoder receives both noiseless messages. The region is the closure of achievable rate pairs: Rx>=H(X|Y), Ry>=H(Y|X), Rx+Ry>=H(X, Y), in a consistent log base. Achievability means block error probability can be made arbitrarily small with increasing block length/rate slack; closure does not promise finite-block zero error at every boundary. Random-supercode existence and time sharing do not provide an efficient implementable code or finite resource guarantee. General ergodic sources, continuous alphabets, rate-distortion, many-source variants and variable-length design are expressly left open in this paper. The target is the paper on pages 471-480. This account does not supply a machine-checked proof or independently certified numerical and formula transcription. Neighboring article fragments are excluded. No practical compression benchmark, real communication reliability or later noisy-channel results absorbed.\n\n## People and systems\n\nDavid Slepian; Jack K. Wolf\n\n\n\n## Original sources\n\n- [Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original471–480](https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf)\n",
      "summary": "For two finite-alphabet iid sources, separate encoders and a joint decoder can approach the correlated-source entropy rate region, even though neither encoder sees the other input.\n\nImagine two instruments producing related streams. If each compresses in isolation using only its own stream statistics, it can miss the redundancy shared between them. Slepian and Wolf show that separate encoders can still exploit that redundancy when the decoder has both messages. The proof assigns blocks to randomly chosen code collections; the decoder uses the other stream to distinguish possibilities. Their result determines an asymptotic rate region and shows why independent access at the encoders need not require two independent compression budgets. It establishes existence under a precise model, leaving efficient finite-length code design and more general sources for further work.",
      "title": "Slepian and Wolf: compressing correlated data separately"
    },
    "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
      "version": 1,
      "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:77ecce46dc83b77a75aa9954e71aceefa7748ac57e0285e7869ea33d4cb7127f"
  },
  "target": {
    "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
    "version": 1,
    "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "slepian-wolf-correlated-source-coding-1973",
    "entry_id": "slepian-wolf-correlated-source-coding-1973",
    "revision": 1,
    "title": "Slepian and Wolf: compressing correlated data separately",
    "context": "Information theory",
    "track": "Information theory",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "An iid correlated pair can be compressed separately down to conditional-entropy individual limits and joint-entropy total limit when decoded jointly.",
    "scope": "An iid correlated pair can be compressed separately down to conditional-entropy individual limits and joint-entropy total limit when decoded jointly. Two finite-alphabet sources formed by iid draws of a fixed joint distribution; each encoder sees only its own block and a joint decoder receives both noiseless messages. The region is the closure of achievable rate pairs: Rx>=H(X|Y), Ry>=H(Y|X), Rx+Ry>=H(X, Y), in a consistent log base. Achievability means block error probability can be made arbitrarily small with increasing block length/rate slack; closure does not promise finite-block zero error at every boundary. Random-supercode existence and time sharing do not provide an efficient implementable code or finite resource guarantee. General ergodic sources, continuous alphabets, rate-distortion, many-source variants and variable-length design are expressly left open in this paper. The target is the paper on pages 471-480. This account does not supply a machine-checked proof or independently certified numerical and formula transcription. Neighboring article fragments are excluded. No practical compression benchmark, real communication reliability or later noisy-channel results absorbed.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Slepian and Wolf, Noiseless Coding of Correlated Information Sources (1973), original 471–480",
        "url": "https://web.mit.edu/6.454/www/www_fall_2001/kusuma/slepwolf.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "David Slepian",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      },
      {
        "who": "Jack K. Wolf",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:552a695e-6fd5-4850-af3f-b57e0a5a34df",
      "version": 1,
      "content_hash": "sha256:c8bdfa04cc5add1803c44f4c738aa84eed47b40e8c8b21dec5f3d1f09ed512b5"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "280000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}