Triple
T21494184
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat primality test |
E530310
|
entity |
| Predicate | isRelatedTo |
P37
|
FINISHED |
| Object | Fermat pseudoprime |
—
|
NE NERFINISHED |
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: Fermat pseudoprime | Statement: [Fermat primality test, isRelatedTo, Fermat pseudoprime]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fermat pseudoprime Context triple: [Fermat primality test, isRelatedTo, Fermat pseudoprime]
-
A.
Fermat pseudoprime
chosen
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.
-
B.
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.
-
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.
Fermat number
A Fermat number is a special type of integer of the form \(F_n = 2^{2^n} + 1\), studied in number theory for its intriguing properties related to primality and constructible polygons.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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. |
Created at: April 16, 2026, 6:23 p.m.