Triple

T21494175
Position Surface form Disambiguated ID Type / Status
Subject Fermat primality test E530310 entity
Predicate isSimplerThan P100404 FINISHED
Object Miller–Rabin primality test NE NERFINISHED

How this triple was built (3 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: Miller–Rabin primality test | Statement: [Fermat primality test, isSimplerThan, Miller–Rabin primality test]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Miller–Rabin primality test
Context triple: [Fermat primality test, isSimplerThan, Miller–Rabin primality test]
  • A. 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.
  • B. AKS primality test
    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.
  • C. Miller primality test chosen
    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.
  • 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. 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.
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: isSimplerThan
Context triple: [Fermat primality test, isSimplerThan, Miller–Rabin primality test]
  • A. isEasierThan chosen
    Indicates that one entity requires less effort, difficulty, or complexity to accomplish, understand, or deal with than another entity.
  • B. isSimple
    Indicates that something has a straightforward, uncomplicated nature or structure, lacking complexity or elaboration.
  • C. isDeeperThan
    Indicates that one entity has a greater depth or is positioned further down than another entity.
  • D. isMoreSpecificThan
    Indicates that one concept represents a narrower, more detailed, or more constrained case of another concept.
  • E. isCoarserThan
    Indicates that one entity has a lower level of detail or granularity than another, representing a broader or less refined characterization or partition.
  • F. None of above.

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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
PD Predicate disambiguation batch_69e631f6e68081908f5ee4ce7413803e completed April 20, 2026, 2:02 p.m.
Created at: April 16, 2026, 6:23 p.m.