Triple
T10990980
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Maple |
E259752
|
entity |
| Predicate | supports |
P516
|
FINISHED |
| Object | Groebner bases |
E208856
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
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).
Input
Phrase: Groebner bases | Statement: [Maple, supports, Groebner bases]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Groebner bases Context triple: [Maple, supports, Groebner bases]
-
A.
Gröbner basis
chosen
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.
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.
-
C.
Gröbner fan
A Gröbner fan is a polyhedral fan that encodes all initial ideals (and thus all Gröbner bases) of an ideal with respect to different term orders.
-
D.
Hilbert’s Nullstellensatz
Hilbert’s Nullstellensatz is a foundational theorem in algebraic geometry that establishes a deep correspondence between ideals in polynomial rings and algebraic sets, linking algebra and geometry.
-
E.
Zassenhaus algorithm for factoring polynomials over the rationals
The Zassenhaus algorithm for factoring polynomials over the rationals is a classical computational method that reduces rational polynomial factorization to modular factorization and then recombines the results using lifting techniques.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69d6aa8a6a548190a750f944ccdc8064 |
completed | April 8, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69d787b8d7088190b7d6b63c3bac4ad1 |
completed | April 9, 2026, 11:04 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e34504ebec8190a78e4795765b0c24 |
completed | April 18, 2026, 8:47 a.m. |
Created at: April 8, 2026, 9:24 p.m.