Triple
T6642032
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Marin Mersenne |
E150608
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Mersenne primes |
E609409
|
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: Mersenne primes | Statement: [Marin Mersenne, knownFor, Mersenne primes]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mersenne primes Context triple: [Marin Mersenne, knownFor, Mersenne primes]
-
A.
Mersenne
chosen
Mersenne is a French surname most famously associated with Marin Mersenne, a 17th-century mathematician and theologian known for his work on prime numbers and acoustics.
-
B.
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.
-
C.
Ramanujan prime
A Ramanujan prime is a type of prime number that provides a bound guaranteeing the existence of a certain number of primes in intervals of the form (x/2, x], named after the mathematician Srinivasa Ramanujan.
-
D.
Prime
Prime is one of the traditional canonical hours in the Christian liturgy of the hours, historically recited in the early morning.
-
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_69c687f1a3048190828b7342f7125d5c |
completed | March 27, 2026, 1:36 p.m. |
| NER | Named-entity recognition | batch_69c6aff5da8881909a512c1c82eb882a |
completed | March 27, 2026, 4:27 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6f7918c208190924c1906c7886a2c |
completed | March 27, 2026, 9:33 p.m. |
Created at: March 27, 2026, 2 p.m.