Triple
T6540040
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John L. Selfridge |
E168261
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Selfridge’s test for primality |
E604130
|
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: Selfridge’s test for primality | Statement: [John L. Selfridge, notableWork, Selfridge’s test for primality]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Selfridge’s test for primality Context triple: [John L. Selfridge, notableWork, Selfridge’s test for primality]
-
A.
Selfridge–Conway primality test
chosen
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.
Carmichael number
A Carmichael number is a composite integer that nonetheless satisfies Fermat's primality test for all bases coprime to it, making it a classic example of a Fermat pseudoprime.
-
E.
Fermat pseudoprime
A Fermat pseudoprime is a composite number that nevertheless satisfies Fermat's little theorem for a given base, making it appear prime under that specific primality test.
- 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_69c68a51564081909e93aee0dbd9cca3 |
completed | March 27, 2026, 1:46 p.m. |
| NER | Named-entity recognition | batch_69c6add5d3848190a0d70dc4013ab756 |
completed | March 27, 2026, 4:18 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6e41d09488190bda71118c299fd31 |
completed | March 27, 2026, 8:10 p.m. |
Created at: March 27, 2026, 1:50 p.m.