Triple

T8448945
Position Surface form Disambiguated ID Type / Status
Subject Adleman–Pomerance–Rumely primality test E199750 entity
Predicate relatedTo P37 FINISHED
Object AKS primality test E734843 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: AKS primality test | Statement: [Adleman–Pomerance–Rumely primality test, relatedTo, 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, relatedTo, 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. 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.
  • 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. 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.
  • E. 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.
  • 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_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_69ce4dc984ec8190910e25f36d538928 completed April 2, 2026, 11:06 a.m.
Created at: March 30, 2026, 6:09 p.m.