Triple
T20456221
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Charles Hermite |
E501792
|
entity |
| Predicate | notableFor |
P22
|
FINISHED |
| Object | Hermite normal form |
—
|
NE NERFINISHED |
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: Hermite normal form | Statement: [Charles Hermite, notableFor, Hermite normal form]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hermite normal form Context triple: [Charles Hermite, notableFor, Hermite normal form]
-
A.
Hermite normal form
chosen
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.
-
B.
Smith normal form
Smith normal form is a canonical diagonal matrix form over the integers that classifies finitely generated abelian groups and simplifies solving systems of linear Diophantine equations.
-
C.
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.
-
D.
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.
-
E.
Sylvester matrix
The Sylvester matrix is a structured matrix constructed from the coefficients of two polynomials, commonly used to compute their resultant and study common roots in algebra.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e0b4ad4940819098cf2ff6413574e5 |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e696a1b03c8190984d9db6d3251308 |
completed | April 20, 2026, 9:12 p.m. |
Created at: April 16, 2026, 11:32 a.m.