Triple
T5191843
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Charles Hermite |
E117173
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Hermite normal form
Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
|
E502190
|
NE FINISHED |
How this triple was built (4 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: Hermite normal form | Statement: [Charles Hermite, knownFor, Hermite normal form]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hermite normal form Context triple: [Charles Hermite, knownFor, Hermite normal form]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Hilbert’s tenth problem
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
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]"
Input
Entity: Hermite normal form Triple: [Charles Hermite, knownFor, Hermite normal form]
Generated description
Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hermite normal form Target entity description: Hermite normal form is a canonical matrix form used in linear algebra and number theory to uniquely represent integer matrices and solve systems of linear Diophantine equations.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Hilbert’s tenth problem
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
-
E.
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.
- F. None of above. chosen
Provenance (5 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_69bd44620ff48190bcac01782107a397 |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd79ed61c88190bda492f6489f44de |
completed | March 20, 2026, 4:46 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bee0943ce48190838aff0cfd12c655 |
completed | March 21, 2026, 6:16 p.m. |
| NEDg | Description generation | batch_69bee5fc0c408190b4ad4b77e0045182 |
completed | March 21, 2026, 6:39 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69bee6b954c08190a353ebcfe829888a |
completed | March 21, 2026, 6:43 p.m. |
Created at: March 20, 2026, 1:46 p.m.