Triple
T7078813
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Louis Mordell |
E164890
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Diophantine Equations |
E629500
|
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: Diophantine Equations | Statement: [Louis Mordell, notableWork, Diophantine Equations]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Diophantine Equations Context triple: [Louis Mordell, notableWork, Diophantine Equations]
-
A.
Diophantine equations
chosen
Diophantine equations are polynomial equations for which only integer or rational solutions are sought, forming a central and often notoriously difficult area of number theory.
-
B.
Diophantine geometry
Diophantine geometry is the branch of number theory that studies solutions to polynomial equations with integer or rational coefficients using geometric methods, particularly those from algebraic geometry.
-
C.
Ramanujan–Nagell equation
The Ramanujan–Nagell equation is a famous Diophantine equation in number theory that has only finitely many integer solutions and is closely associated with the work of Srinivasa Ramanujan.
-
D.
Diophantine approximation
Diophantine approximation is a branch of number theory that studies how closely real numbers can be approximated by rational numbers, often with quantitative bounds on the quality of approximation.
-
E.
Erdős–Moser equation
The Erdős–Moser equation is a famous unsolved Diophantine equation in number theory that asks whether 1^k + 2^k + ... + (m−1)^k = m^k has any integer solutions beyond the trivial case (k, m) = (1, 2).
- 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_69c6887cbc6c8190bdfac42d940f4d8a |
completed | March 27, 2026, 1:39 p.m. |
| NER | Named-entity recognition | batch_69c6e4ef47d48190b31125d1b57f7bec |
completed | March 27, 2026, 8:13 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c7947294d4819094d7cfb34efde915 |
completed | March 28, 2026, 8:42 a.m. |
Created at: March 27, 2026, 2:40 p.m.