Triple
T9867903
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Hans Zassenhaus |
E239880
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Zassenhaus algorithm |
E643836
|
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: Zassenhaus algorithm | Statement: [Hans Zassenhaus, notableWork, Zassenhaus algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Zassenhaus algorithm Context triple: [Hans Zassenhaus, notableWork, Zassenhaus algorithm]
-
A.
Cantor–Zassenhaus algorithm
chosen
The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
-
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.
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.
-
D.
Berlekamp’s algorithm for factoring polynomials over finite fields
Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
-
E.
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.
- 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_69ca84e7506c819095cbde4ff16512bb |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb3d209ac8190b9bc9ff017a132da |
completed | April 2, 2026, 12:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1e45add0481909a0416035054a563 |
completed | April 5, 2026, 4:26 a.m. |
Created at: March 30, 2026, 8:36 p.m.