Triple

T21494176
Position Surface form Disambiguated ID Type / Status
Subject Fermat primality test E530310 entity
Predicate isSimplerThan P100404 FINISHED
Object AKS primality test — 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: AKS primality test | Statement: [Fermat primality test, isSimplerThan, AKS primality test]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: AKS primality test
Context triple: [Fermat primality test, isSimplerThan, AKS primality test]
  • A. AKS primality test chosen
    The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
  • B. Solovay–Strassen primality test
    The Solovay–Strassen primality test is a randomized algorithm in number theory that uses Euler–Jacobi pseudoprimes to more reliably distinguish prime numbers from composites than simpler tests like Fermat’s.
  • C. 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.
  • D. 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.
  • E. Miller primality test
    The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
  • 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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
Created at: April 16, 2026, 6:23 p.m.