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: Bellman–Ford algorithm | Statement: [Viterbi algorithm, relatedTo, Bellman–Ford algorithm]

Target entity: Bellman–Ford algorithm
Context triple: [Viterbi algorithm, relatedTo, Bellman–Ford algorithm]

• A. Dijkstra
  Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
• B. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• C. Bellman
  Bellman is a surname most prominently associated with New Zealand-born British actress Gina Bellman, known for her roles in television and film.
• D. Kruskal
  Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
• E. Viterbi algorithm
  The Viterbi algorithm is a dynamic programming method used to find the most likely sequence of hidden states in probabilistic models such as Hidden Markov Models, widely applied in fields like digital communications, speech recognition, and bioinformatics.
• 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: Bellman–Ford algorithm
Triple: [Viterbi algorithm, relatedTo, Bellman–Ford algorithm]

The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.

Target entity: Bellman–Ford algorithm
Target entity description: The Bellman–Ford algorithm is a graph shortest-path algorithm that can handle negative edge weights and detect negative cycles, often used in routing and network optimization.

• A. Dijkstra
  Dijkstra is a renowned Dutch computer scientist best known for his pioneering work in algorithms, including Dijkstra's shortest path algorithm, and for his influential contributions to programming methodology and software engineering.
• B. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• C. Bellman
  Bellman is a surname most prominently associated with New Zealand-born British actress Gina Bellman, known for her roles in television and film.
• D. Kruskal
  Kruskal is a surname most prominently associated with American mathematician Martin David Kruskal, known for his work in soliton theory and nonlinear science.
• E. Viterbi algorithm
  The Viterbi algorithm is a dynamic programming method used to find the most likely sequence of hidden states in probabilistic models such as Hidden Markov Models, widely applied in fields like digital communications, speech recognition, and bioinformatics.
• F. None of above. chosen