{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "welch-adaptive-dictionary-compression-1984",
    "title": "LZW: rebuilding a compression dictionary as data arrives",
    "summary": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.\n\nRepeated strings can be replaced by short identifiers. The compressor learns those strings as it scans the input; the decoder rebuilds the same table from the received codes, so a separate dictionary need not accompany the message. Welch explains how to make this inexpensive and fast, including a subtle case where the next dictionary entry has not yet reached the decoder. The article also explains why a good compression method can still be difficult to integrate into disks, tapes and communication paths.",
    "boundary": "The target is the 1984 LZW engineering construction and system analysis, not the earlier LZ 77/LZ 78 universal-coding theory or all later file formats and patents. Lossless decoding needs the same initial alphabet and code-assignment conventions, including the newly-created-code special case. Practical dictionary capacity, reset/extension policy and bit packing require an agreed format. A common 12-bit implementation is an example, not a universal code width. Short inputs can expand by 50% initially; some tested floating-point arrays expand, and changing data statistics or a full table affect compression. Reported ratios cover several Lempel-Ziv variants and imperfectly comparable data, not one uniformly superior algorithm. Variable compressed lengths, buffering, error propagation and random-access integration remain costs. The source does not assert optimal parsing or every-input compression. Later deployment evidence is not inherited automatically.",
    "area": "Lossless data compression",
    "topic": "Computer science",
    "year": 1984,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "welch-adaptive-dictionary-compression-1984",
    "target": {
      "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
      "version": 1,
      "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
    },
    "humans": [
      "Terry A. Welch"
    ],
    "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": [
      "ziv-lempel-universal-sequential-compression-1977",
      "ziv-lempel-individual-variable-rate-1978",
      "huffman-minimum-redundancy-codes-1952"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-welch-lzw-1984-original",
        "title": "Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19,June1984), original scan",
        "url": "https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf"
      }
    ],
    "points": "120000",
    "published_grade": {
      "id": "welch-adaptive-dictionary-compression-1984",
      "entry_id": "welch-adaptive-dictionary-compression-1984",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
        "version": 1,
        "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
      },
      "what_changed": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.",
      "scope": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems. The target is the 1984 LZW engineering construction and system analysis, not the earlier LZ 77/LZ 78 universal-coding theory or all later file formats and patents. Lossless decoding needs the same initial alphabet and code-assignment conventions, including the newly-created-code special case. Practical dictionary capacity, reset/extension policy and bit packing require an agreed format. A common 12-bit implementation is an example, not a universal code width. Short inputs can expand by 50% initially; some tested floating-point arrays expand, and changing data statistics or a full table affect compression. Reported ratios cover several Lempel-Ziv variants and imperfectly comparable data, not one uniformly superior algorithm. Variable compressed lengths, buffering, error propagation and random-access integration remain costs. The source does not assert optimal parsing or every-input compression. Later deployment evidence is not inherited automatically.",
      "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:cfa7136e-eed6-4017-aa95-682f0e437406",
        "version": 1,
        "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
      },
      "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": "Terry A. Welch",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19,June1984), original scan",
            "url": "https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19,June1984), original scan",
            "url": "https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The target is the 1984 LZW engineering construction and system analysis, not the earlier LZ 77/LZ 78 universal-coding theory or all later file formats and patents. Lossless decoding needs the same initial alphabet and code-assignment conventions, including the newly-created-code special case. Practical dictionary capacity, reset/extension policy and bit packing require an agreed format. A common 12-bit implementation is an example, not a universal code width. Short inputs can expand by 50% initially; some tested floating-point arrays expand, and changing data statistics or a full table affect compression. Reported ratios cover several Lempel-Ziv variants and imperfectly comparable data, not one uniformly superior algorithm. Variable compressed lengths, buffering, error propagation and random-access integration remain costs. The source does not assert optimal parsing or every-input compression. Later deployment evidence is not inherited automatically.",
        "domain": "Lossless data compression"
      },
      "sources": [
        {
          "citation": "Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19,June1984), original scan",
          "url": "https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf"
        }
      ],
      "statement": "# LZW: rebuilding a compression dictionary as data arrives\n\nWelch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.\n\nRepeated strings can be replaced by short identifiers. The compressor learns those strings as it scans the input; the decoder rebuilds the same table from the received codes, so a separate dictionary need not accompany the message. Welch explains how to make this inexpensive and fast, including a subtle case where the next dictionary entry has not yet reached the decoder. The article also explains why a good compression method can still be difficult to integrate into disks, tapes and communication paths.\n\n## Scientific scope\n\nThe target is the 1984 LZW engineering construction and system analysis, not the earlier LZ 77/LZ 78 universal-coding theory or all later file formats and patents. Lossless decoding needs the same initial alphabet and code-assignment conventions, including the newly-created-code special case. Practical dictionary capacity, reset/extension policy and bit packing require an agreed format. A common 12-bit implementation is an example, not a universal code width. Short inputs can expand by 50% initially; some tested floating-point arrays expand, and changing data statistics or a full table affect compression. Reported ratios cover several Lempel-Ziv variants and imperfectly comparable data, not one uniformly superior algorithm. Variable compressed lengths, buffering, error propagation and random-access integration remain costs. The source does not assert optimal parsing or every-input compression. Later deployment evidence is not inherited automatically.\n\n## People and systems\n\nTerry A. Welch\n\n\n\n## Original sources\n\n- [Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19,June1984), original scan](https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf)\n",
      "summary": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.\n\nRepeated strings can be replaced by short identifiers. The compressor learns those strings as it scans the input; the decoder rebuilds the same table from the received codes, so a separate dictionary need not accompany the message. Welch explains how to make this inexpensive and fast, including a subtle case where the next dictionary entry has not yet reached the decoder. The article also explains why a good compression method can still be difficult to integrate into disks, tapes and communication paths.",
      "title": "LZW: rebuilding a compression dictionary as data arrives"
    },
    "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
      "version": 1,
      "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:8fd6d6bffe5e7510082b1acf700af946274c7c4874f86b1223fcc5193bad0a66"
  },
  "target": {
    "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
    "version": 1,
    "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "welch-adaptive-dictionary-compression-1984",
    "entry_id": "welch-adaptive-dictionary-compression-1984",
    "revision": 1,
    "title": "LZW: rebuilding a compression dictionary as data arrives",
    "context": "Lossless data compression",
    "track": "Lossless data compression",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems.",
    "scope": "Welch presents a practical adaptive dictionary compressor that sends codes for previously encountered strings while its decoder reconstructs the dictionary, with simple mechanisms suited to high-throughput storage systems. The target is the 1984 LZW engineering construction and system analysis, not the earlier LZ 77/LZ 78 universal-coding theory or all later file formats and patents. Lossless decoding needs the same initial alphabet and code-assignment conventions, including the newly-created-code special case. Practical dictionary capacity, reset/extension policy and bit packing require an agreed format. A common 12-bit implementation is an example, not a universal code width. Short inputs can expand by 50% initially; some tested floating-point arrays expand, and changing data statistics or a full table affect compression. Reported ratios cover several Lempel-Ziv variants and imperfectly comparable data, not one uniformly superior algorithm. Variable compressed lengths, buffering, error propagation and random-access integration remain costs. The source does not assert optimal parsing or every-input compression. Later deployment evidence is not inherited automatically.",
    "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": "Terry A. Welch, A Technique for High-Performance Data Compression (Computer 17(6),8-19, June 1984), original scan",
        "url": "https://courses.cs.duke.edu/spring03/cps296.5/papers/welch_1984_technique_for.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Terry A. Welch",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:cfa7136e-eed6-4017-aa95-682f0e437406",
      "version": 1,
      "content_hash": "sha256:ae79f2ea82716089a9908269c715ec51b7b81ac670b663d99a2a9af004563e7f"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "120000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}