Triple
T5570709
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat point |
E146192
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Fermat problem |
E146188
|
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: Fermat problem | Statement: [Fermat point, relatedConcept, Fermat problem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fermat problem Context triple: [Fermat point, relatedConcept, Fermat problem]
-
A.
Fermat's Last Theorem
chosen
Fermat's Last Theorem is a famous statement in number theory asserting that there are no whole-number solutions to the equation xⁿ + yⁿ = zⁿ for integers n greater than 2, a problem that remained unsolved for over three centuries until it was proved by Andrew Wiles in the 1990s.
-
B.
Fermat polygonal number theorem
The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
-
C.
Beal conjecture
The Beal conjecture is an unsolved problem in number theory proposing that if A^x + B^y = C^z with A, B, C, x, y, z positive integers and exponents greater than 2, then A, B, and C must share a common prime factor.
-
D.
Fermat's little theorem
Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
-
E.
Fermat's theorem on sums of two squares
Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
- 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_69c008ffed108190a084602227af6157 |
completed | March 22, 2026, 3:21 p.m. |
| NER | Named-entity recognition | batch_69c020502a288190af37f9ebb88fccae |
completed | March 22, 2026, 5:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c04d1c6c008190978682491cca1e84 |
completed | March 22, 2026, 8:12 p.m. |
Created at: March 22, 2026, 3:37 p.m.