Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: union–find data structure | Statement: [Robert Tarjan, notableWork, union–find data structure]

Target entity: union–find data structure
Context triple: [Robert Tarjan, notableWork, union–find data structure]

• A. Huet unification algorithm
  The Huet unification algorithm is a higher-order unification procedure introduced by Gérard Huet that generalizes first-order unification to handle lambda calculus terms and plays a key role in type theory and automated theorem proving.
• B. DSU
  DSU is the World Trade Organization’s legal framework that sets out the rules and procedures for resolving trade disputes between member countries.
• C. UnionFS
  UnionFS is a union file system that allows multiple directories or file systems to be transparently overlaid into a single coherent filesystem view, commonly used for layered container images.
• D. LCA
  LCA is the three-letter ISO 3166-1 alpha-3 country code assigned to Saint Lucia.
• E. LCA
  LCA is the common abbreviation for the Lutheran Church in America, a major Lutheran denomination that existed in the United States from 1962 until its merger into the Evangelical Lutheran Church in America in 1988.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: union–find data structure
Triple: [Robert Tarjan, notableWork, union–find data structure]

The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.

Target entity: union–find data structure
Target entity description: The union–find data structure is an efficient algorithmic structure that maintains disjoint sets and supports fast union and find operations, widely used in graph algorithms such as Kruskal’s minimum spanning tree.

• A. Huet unification algorithm
  The Huet unification algorithm is a higher-order unification procedure introduced by Gérard Huet that generalizes first-order unification to handle lambda calculus terms and plays a key role in type theory and automated theorem proving.
• B. DSU
  DSU is the World Trade Organization’s legal framework that sets out the rules and procedures for resolving trade disputes between member countries.
• C. UnionFS
  UnionFS is a union file system that allows multiple directories or file systems to be transparently overlaid into a single coherent filesystem view, commonly used for layered container images.
• D. LCA
  LCA is the three-letter ISO 3166-1 alpha-3 country code assigned to Saint Lucia.
• E. LCA
  LCA is the common abbreviation for the Lutheran Church in America, a major Lutheran denomination that existed in the United States from 1962 until its merger into the Evangelical Lutheran Church in America in 1988.
• F. None of above. chosen