Triple

T8448934
Position Surface form Disambiguated ID Type / Status
Subject Adleman–Pomerance–Rumely primality test E199750 entity
Predicate isPrecursorOf P3444 FINISHED
Object 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.
 E734843 NE FINISHED

How this triple was built (4 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: [Adleman–Pomerance–Rumely primality test, isPrecursorOf, AKS primality test]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: AKS primality test
Context triple: [Adleman–Pomerance–Rumely primality test, isPrecursorOf, AKS primality test]
  • A. 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.
  • 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. 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.
  • D. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • E. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: AKS primality test
Triple: [Adleman–Pomerance–Rumely primality test, isPrecursorOf, AKS primality test]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: AKS primality test
Target entity description: 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.
  • A. 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.
  • 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. 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.
  • D. Cantor–Zassenhaus algorithm
    The Cantor–Zassenhaus algorithm is a probabilistic method used to factor polynomials over finite fields efficiently, widely employed in computational algebra and cryptography.
  • E. Blum–Blum–Shub pseudorandom number generator
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • F. None of above. chosen

Provenance (5 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_69ca83170f9081909cd98f55614c6476 completed March 30, 2026, 2:05 p.m.
NER Named-entity recognition batch_69cbe445b7988190b53ae45070c70d1d completed March 31, 2026, 3:12 p.m.
NED1 Entity disambiguation (via context triple) batch_69ce1dbf2e2c8190b20e842438acb4d5 completed April 2, 2026, 7:41 a.m.
NEDg Description generation batch_69ce1eddb9988190a77ab59f2867ad5d completed April 2, 2026, 7:46 a.m.
NED2 Entity disambiguation (via description) batch_69ce1fb9b03c819089976283e1c53ca5 completed April 2, 2026, 7:50 a.m.
Created at: March 30, 2026, 6:09 p.m.