{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "levenshtein-binary-synchronization-error-metrics-1965",
    "title": "Levenshtein: describe message errors with insertion, deletion and bit-flip distances",
    "summary": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.\n\nA dropped bit can shift every later position in a message, so counting wrong positions alone is not enough. Levenshtein studied the minimum edits needed to turn one binary word into another and used that distance to separate codewords safely. The article distinguishes deletion-and-insertion distance from a distance that also permits bit flips. For equal-length codewords it relates correction of deletions, insertions and mixtures, and uses earlier Varshamov–Tenengolts checksum constructions for one-error correction. The Russian original appeared in 1965; the English translation followed in 1966. This is a coding-theory contribution, not the later dynamic-programming software algorithm or a measure of semantic meaning. This account follows the linked four-page translation. The exact numerical bound formulas remain outside the independently verified scope of this account.",
    "boundary": "The original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.",
    "area": "Computer science",
    "topic": "Coding theory",
    "year": 1965,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "levenshtein-binary-synchronization-error-metrics-1965",
    "target": {
      "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
      "version": 1,
      "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
    },
    "humans": [
      "V. I. Levenshtein"
    ],
    "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": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-levenshtein-binary-synchronization-error-metrics-1965-original",
        "title": "V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of1965original)",
        "url": "https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf"
      }
    ],
    "points": "170000",
    "published_grade": {
      "id": "levenshtein-binary-synchronization-error-metrics-1965",
      "entry_id": "levenshtein-binary-synchronization-error-metrics-1965",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
        "version": 1,
        "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
      },
      "what_changed": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.",
      "scope": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization. The original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.",
      "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:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
        "version": 1,
        "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
      },
      "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": "V. I. Levenshtein",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of1965original)",
            "url": "https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of1965original)",
            "url": "https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.",
        "domain": "Computer science"
      },
      "sources": [
        {
          "citation": "V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of1965original)",
          "url": "https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf"
        }
      ],
      "statement": "# Levenshtein: describe message errors with insertion, deletion and bit-flip distances\n\nBinary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.\n\nA dropped bit can shift every later position in a message, so counting wrong positions alone is not enough. Levenshtein studied the minimum edits needed to turn one binary word into another and used that distance to separate codewords safely. The article distinguishes deletion-and-insertion distance from a distance that also permits bit flips. For equal-length codewords it relates correction of deletions, insertions and mixtures, and uses earlier Varshamov–Tenengolts checksum constructions for one-error correction. The Russian original appeared in 1965; the English translation followed in 1966. This is a coding-theory contribution, not the later dynamic-programming software algorithm or a measure of semantic meaning. This account follows the linked four-page translation. The exact numerical bound formulas remain outside the independently verified scope of this account.\n\n## Scientific scope\n\nThe original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.\n\n## People and systems\n\nV. I. Levenshtein\n\n\n\n## Original sources\n\n- [V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of1965original)](https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf)\n",
      "summary": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.\n\nA dropped bit can shift every later position in a message, so counting wrong positions alone is not enough. Levenshtein studied the minimum edits needed to turn one binary word into another and used that distance to separate codewords safely. The article distinguishes deletion-and-insertion distance from a distance that also permits bit flips. For equal-length codewords it relates correction of deletions, insertions and mixtures, and uses earlier Varshamov–Tenengolts checksum constructions for one-error correction. The Russian original appeared in 1965; the English translation followed in 1966. This is a coding-theory contribution, not the later dynamic-programming software algorithm or a measure of semantic meaning. This account follows the linked four-page translation. The exact numerical bound formulas remain outside the independently verified scope of this account.",
      "title": "Levenshtein: describe message errors with insertion, deletion and bit-flip distances"
    },
    "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
      "version": 1,
      "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:eca4aad33883761a62e47d089b666ea0e7eec89fef1ec20da28800ba05d60787"
  },
  "target": {
    "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
    "version": 1,
    "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "levenshtein-binary-synchronization-error-metrics-1965",
    "entry_id": "levenshtein-binary-synchronization-error-metrics-1965",
    "revision": 1,
    "title": "Levenshtein: describe message errors with insertion, deletion and bit-flip distances",
    "context": "Computer science",
    "track": "Computer science",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization.",
    "scope": "Binary edit metrics characterize correction of deletion, insertion and bit-flip errors; equal-length deletion and insertion correction are equivalent, and checksum constructions address one-error synchronization. The original coding results concern specified binary strings and deletion/insertion/reversal or related error models. Error distance, fixed length and correction guarantees must retain their definitions. This is not a universal modern text-similarity metric or proof that every edit-noise channel has the same coding capacity. Later generalized edit algorithms are separate.",
    "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": "V. I. Levenshtein: Binary Codes Capable of Correcting Deletions, Insertions, and Reversals (1966 translation of 1965 original)",
        "url": "https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "V. I. Levenshtein",
        "did": "Soleoriginal scientificbyline;Russian1965/English1966samefamily.",
        "credit": "SCIENCE"
      },
      {
        "who": "R.R.Varshamov; G.M.Tenengoltts; R.W.Hamming",
        "did": "Explicitly credited prior checksum construction and bit-error-code bound, distinct from this paper's coauthors.",
        "credit": "SCIENCE"
      },
      {
        "who": "P.S.Novikov",
        "did": "PresentedtoAcademy;notbylineauthor orautomatic scientificownership.",
        "credit": "PARTICIPATION"
      }
    ],
    "target": {
      "record_id": "urn:uuid:5bd9f7c0-0f9e-41d9-af5e-509cc16cb42f",
      "version": 1,
      "content_hash": "sha256:84733cab2e7db97b450de7fe3b02afae5d1d3b50f9840bd7f6b46f2abf9ec5c5"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "170000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}