Triple

T10018636
Position Surface form Disambiguated ID Type / Status
Subject Michael O. Rabin E199558 entity
Predicate knownFor P22 FINISHED
Object Rabin–Miller primality test E735950 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: Rabin–Miller primality test | Statement: [Michael O. Rabin, knownFor, Rabin–Miller primality test]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Rabin–Miller primality test
Context triple: [Michael O. Rabin, knownFor, Rabin–Miller primality test]
  • A. 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.
  • B. 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.
  • C. 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.
  • D. Fermat primality test
    The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
  • 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_69ca8315a1a08190ab310f25620f362b completed March 30, 2026, 2:05 p.m.
NER Named-entity recognition batch_69cdcd4de1588190a89ed575cff0b8c9 completed April 2, 2026, 1:58 a.m.
NED1 Entity disambiguation (via context triple) batch_69d26aaa38188190aed8c18eccd8a79d completed April 5, 2026, 1:59 p.m.
Created at: March 30, 2026, 8:53 p.m.