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: Macaulay2 | Statement: [Buchberger algorithm, implementedIn, Macaulay2]

Target entity: Macaulay2
Context triple: [Buchberger algorithm, implementedIn, Macaulay2]

• A. Gröbner basis
  A Gröbner basis is a particular generating set of an ideal in a polynomial ring that allows algorithmic solutions to many problems in computational algebra, such as ideal membership and solving systems of polynomial equations.
• B. Cohen–Macaulay ring
  A Cohen–Macaulay ring is a commutative Noetherian ring whose depth equals its Krull dimension, giving it especially well-behaved homological and geometric properties.
• C. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• D. Eisenbud’s Commutative Algebra
  Eisenbud’s *Commutative Algebra* is a widely used graduate-level textbook that develops modern commutative algebra with strong connections to algebraic geometry, featuring topics such as free resolutions, syzygies, and Castelnuovo–Mumford regularity.
• E. Castelnuovo–Mumford regularity
  Castelnuovo–Mumford regularity is an invariant in commutative algebra and algebraic geometry that measures the complexity of the minimal graded free resolution of a module or sheaf, often used to control vanishing of cohomology and bounds on generators.
• 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: Macaulay2
Triple: [Buchberger algorithm, implementedIn, Macaulay2]

Macaulay2 is a specialized computer algebra system designed for research in algebraic geometry and commutative algebra, particularly focused on computations involving polynomial rings and modules.

Target entity: Macaulay2
Target entity description: Macaulay2 is a specialized computer algebra system designed for research in algebraic geometry and commutative algebra, particularly focused on computations involving polynomial rings and modules.

• A. Gröbner basis
  A Gröbner basis is a particular generating set of an ideal in a polynomial ring that allows algorithmic solutions to many problems in computational algebra, such as ideal membership and solving systems of polynomial equations.
• B. Cohen–Macaulay ring
  A Cohen–Macaulay ring is a commutative Noetherian ring whose depth equals its Krull dimension, giving it especially well-behaved homological and geometric properties.
• C. Buchberger algorithm
  The Buchberger algorithm is a fundamental procedure in computational algebra for computing Gröbner bases of polynomial ideals, enabling systematic solutions to systems of polynomial equations.
• D. Eisenbud’s Commutative Algebra
  Eisenbud’s *Commutative Algebra* is a widely used graduate-level textbook that develops modern commutative algebra with strong connections to algebraic geometry, featuring topics such as free resolutions, syzygies, and Castelnuovo–Mumford regularity.
• E. Castelnuovo–Mumford regularity
  Castelnuovo–Mumford regularity is an invariant in commutative algebra and algebraic geometry that measures the complexity of the minimal graded free resolution of a module or sheaf, often used to control vanishing of cohomology and bounds on generators.
• F. None of above. chosen