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: Generalized Search Tree | Statement: [GiST, fullName, Generalized Search Tree]

Target entity: Generalized Search Tree
Context triple: [GiST, fullName, Generalized Search Tree]

• A. Monte Carlo tree search
  Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
• B. Davis–Putnam algorithm
  The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
• C. Boyer–Moore string-search algorithm
  The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
• D. Tree That Owns Itself
  The Tree That Owns Itself is a famous white oak in Athens, Georgia, reputedly granted legal ownership of itself and the land immediately surrounding it.
• E. General Problem Solver
  The General Problem Solver is an early artificial intelligence program designed to model and automate human-like problem-solving across a wide range of domains using general search and reasoning strategies.
• 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: Generalized Search Tree
Triple: [GiST, fullName, Generalized Search Tree]

Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.

Target entity: Generalized Search Tree
Target entity description: Generalized Search Tree is a flexible, balanced tree data structure framework that supports building custom index types for complex data and queries, often used in database systems.

• A. Monte Carlo tree search
  Monte Carlo tree search is a heuristic search algorithm that uses random sampling of game states to build and explore a search tree, enabling strong decision-making in complex domains like Go and other board games.
• B. Davis–Putnam algorithm
  The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
• C. Boyer–Moore string-search algorithm
  The Boyer–Moore string-search algorithm is a highly efficient pattern-matching algorithm that scans text from right to left and uses precomputed shift rules to skip sections of the text, making it one of the fastest practical algorithms for substring search.
• D. Tree That Owns Itself
  The Tree That Owns Itself is a famous white oak in Athens, Georgia, reputedly granted legal ownership of itself and the land immediately surrounding it.
• E. General Problem Solver
  The General Problem Solver is an early artificial intelligence program designed to model and automate human-like problem-solving across a wide range of domains using general search and reasoning strategies.
• F. None of above. chosen