Triple
T2151785
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bruno Buchberger |
E47796
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Gröbner 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: Gröbner bases | Statement: [Bruno Buchberger, knownFor, Gröbner bases]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gröbner bases Context triple: [Bruno Buchberger, knownFor, Gröbner 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.
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.
-
C.
Knuth–Bendix completion algorithm
The Knuth–Bendix completion algorithm is a procedure in term rewriting and automated theorem proving that transforms a set of equations into a confluent rewriting system, enabling decision of word problems in algebraic structures.
-
D.
Hilbert’s fourteenth problem
Hilbert’s fourteenth problem is one of David Hilbert’s famous list of 23 problems, concerning the finite generation of certain algebras of invariants in algebraic geometry and invariant theory.
-
E.
Hilbert’s syzygy theorem
Hilbert’s syzygy theorem is a fundamental result in commutative algebra that describes the finite length and structure of free resolutions of modules over polynomial rings.
- 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_69a88a1d1fd8819088b34990d69a712f |
completed | March 4, 2026, 7:38 p.m. |
| NER | Named-entity recognition | batch_69abbe48ad148190a7d6cc88fd38a660 |
completed | March 7, 2026, 5:57 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae58dedd3c8190a876819616903392 |
completed | March 9, 2026, 5:21 a.m. |
Created at: March 4, 2026, 7:44 p.m.