{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "morrison-patricia-compressed-text-index-1968",
    "title": "PATRICIA: indexing genuine branches instead of every prefix",
    "summary": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.\n\nA long shared prefix does not need a separate stored index node for every bit. PATRICIA keeps only positions at which indexed text phrases genuinely branch, together with numerical links back to the text. The original system marks allowed starts and stops: it retrieves proper occurrences beginning at a designated start and ending before the associated stop, rather than every substring anywhere. FINDONE follows selected branching bits and returns a candidate location. A final text comparison is essential because skipped bits can otherwise produce a false hit. FINDALL traverses the relevant branches to report additional proper occurrences. The article bounds index work by key length and output occurrences under its indexing model, rather than by a scan of the full library. Unique indexed ends are required; the paper explains identifiers and a reverse-library technique for repeated endings. Fredkin’s earlier trie is an explicit predecessor. The contribution assessed here is the 1968 text-index system, not every later compressed radix tree or a guarantee for arbitrary modern databases. Morrison explicitly credits Charlene Lanford with programming the running versions.",
    "boundary": "The compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.",
    "area": "Computing",
    "topic": "Data structures and information retrieval",
    "year": 1968,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "morrison-patricia-compressed-text-index-1968",
    "target": {
      "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
      "version": 1,
      "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
    },
    "humans": [
      "Donald R. Morrison"
    ],
    "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-morrison-patricia-compressed-text-index-1968-original",
        "title": "Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)",
        "url": "https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf"
      }
    ],
    "points": "120000",
    "published_grade": {
      "id": "morrison-patricia-compressed-text-index-1968",
      "entry_id": "morrison-patricia-compressed-text-index-1968",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
        "version": 1,
        "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
      },
      "what_changed": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.",
      "scope": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library. The compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.",
      "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:6769e6cd-d903-40bb-a33d-027476468d8e",
        "version": 1,
        "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
      },
      "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": "Donald R. Morrison",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)",
            "url": "https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)",
            "url": "https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.",
        "domain": "Computing"
      },
      "sources": [
        {
          "citation": "Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)",
          "url": "https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf"
        }
      ],
      "statement": "# PATRICIA: indexing genuine branches instead of every prefix\n\nMorrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.\n\nA long shared prefix does not need a separate stored index node for every bit. PATRICIA keeps only positions at which indexed text phrases genuinely branch, together with numerical links back to the text. The original system marks allowed starts and stops: it retrieves proper occurrences beginning at a designated start and ending before the associated stop, rather than every substring anywhere. FINDONE follows selected branching bits and returns a candidate location. A final text comparison is essential because skipped bits can otherwise produce a false hit. FINDALL traverses the relevant branches to report additional proper occurrences. The article bounds index work by key length and output occurrences under its indexing model, rather than by a scan of the full library. Unique indexed ends are required; the paper explains identifiers and a reverse-library technique for repeated endings. Fredkin’s earlier trie is an explicit predecessor. The contribution assessed here is the 1968 text-index system, not every later compressed radix tree or a guarantee for arbitrary modern databases. Morrison explicitly credits Charlene Lanford with programming the running versions.\n\n## Scientific scope\n\nThe compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.\n\n## People and systems\n\nDonald R. Morrison\n\n\n\n## Original sources\n\n- [Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)](https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf)\n",
      "summary": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.\n\nA long shared prefix does not need a separate stored index node for every bit. PATRICIA keeps only positions at which indexed text phrases genuinely branch, together with numerical links back to the text. The original system marks allowed starts and stops: it retrieves proper occurrences beginning at a designated start and ending before the associated stop, rather than every substring anywhere. FINDONE follows selected branching bits and returns a candidate location. A final text comparison is essential because skipped bits can otherwise produce a false hit. FINDALL traverses the relevant branches to report additional proper occurrences. The article bounds index work by key length and output occurrences under its indexing model, rather than by a scan of the full library. Unique indexed ends are required; the paper explains identifiers and a reverse-library technique for repeated endings. Fredkin’s earlier trie is an explicit predecessor. The contribution assessed here is the 1968 text-index system, not every later compressed radix tree or a guarantee for arbitrary modern databases. Morrison explicitly credits Charlene Lanford with programming the running versions.",
      "title": "PATRICIA: indexing genuine branches instead of every prefix"
    },
    "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
      "version": 1,
      "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:e8b967583b95b58170b0f77dc61596b89a134be739ad64336bb7699862417ec0"
  },
  "target": {
    "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
    "version": 1,
    "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "morrison-patricia-compressed-text-index-1968",
    "entry_id": "morrison-patricia-compressed-text-index-1968",
    "revision": 1,
    "title": "PATRICIA: indexing genuine branches instead of every prefix",
    "context": "Computing",
    "track": "Computing",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library.",
    "scope": "Morrison described a compact binary-text index that records only genuine branching positions, finds a candidate from selected key bits, verifies it in the text, and enumerates marked occurrences without scanning the entire library. The compressed branching structure assumes the stated string/key representation and access operations. Search cost depends on key length and representation; it is not constant-time arbitrary-string lookup or a cryptographic data-integrity scheme. Updates and memory costs must be accounted for. Later trie variants retain separate credit.",
    "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": "Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric (1968)",
        "url": "https://www.oneofus.la/have-emacs-will-hack/files/PatriciaTrie-JACM1968.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Donald R. Morrison",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:6769e6cd-d903-40bb-a33d-027476468d8e",
      "version": 1,
      "content_hash": "sha256:dbaba12707de093a330b8e1607aef7594ac215ad153e30e2e830b4fd3cba9823"
    },
    "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"
}