Triple

T7115664
Position Surface form Disambiguated ID Type / Status
Subject Berlekamp’s algorithm for factoring polynomials over finite fields E165811 entity
Predicate relatedTo P37 FINISHED
Object Cantor–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: Cantor–Zassenhaus algorithm | Statement: [Berlekamp’s algorithm for factoring polynomials over finite fields, relatedTo, Cantor–Zassenhaus algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Cantor–Zassenhaus algorithm
Context triple: [Berlekamp’s algorithm for factoring polynomials over finite fields, relatedTo, Cantor–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. 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.
  • C. Adleman–Pomerance–Rumely primality test
    The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
  • D. Berlekamp–Massey algorithm
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • E. Selfridge–Conway primality test
    The Selfridge–Conway primality test is a probabilistic algorithm in number theory used to determine whether a given integer is prime.
  • 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_69c6888227bc8190a1394679e3116f90 completed March 27, 2026, 1:39 p.m.
NER Named-entity recognition batch_69c6e5f401b881909ef4c2ab1e0750db completed March 27, 2026, 8:17 p.m.
NED1 Entity disambiguation (via context triple) batch_69c7ad86ac688190af97b42d0cb36b84 completed March 28, 2026, 10:29 a.m.
Created at: March 27, 2026, 2:43 p.m.