Triple
T32379771
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Zassenhaus algorithm for factoring polynomials over the rationals |
E827382
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | computational algebra algorithm |
C59657
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: computational algebra algorithm Context triple: [Zassenhaus algorithm for factoring polynomials over the rationals, instanceOf, computational algebra algorithm]
-
A.
Gröbner basis algorithm
A Gröbner basis algorithm is a computational procedure that transforms a set of multivariate polynomials into a special generating set (a Gröbner basis) that simplifies solving and analyzing polynomial ideal problems such as solving systems of equations, ideal membership, and elimination.
-
B.
algorithm in number theory
An algorithm in number theory is a finite, well-defined computational procedure designed to solve problems involving integers and their properties, such as divisibility, primality, and modular relationships.
-
C.
lattice basis reduction algorithm
chosen
A lattice basis reduction algorithm is a computational method that transforms a given basis of a lattice into a shorter, nearly orthogonal basis, often to simplify problems in number theory, cryptography, and optimization.
-
D.
algebraic system
An algebraic system is a set equipped with one or more operations (such as addition or multiplication) that satisfy specified axioms governing how those operations behave.
-
E.
collection of decision problems in group theory
A collection of decision problems in group theory is a conceptual class comprising questions that ask, for various groups and inputs, whether certain algebraic properties or relations hold, such as the word, conjugacy, or isomorphism problems.
- F. None of above.
Provenance (1 batch)
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_69f349177ddc8190ab0583f05597056b |
completed | April 30, 2026, 12:20 p.m. |
Created at: May 1, 2026, 12:51 a.m.