Triple
T14334543
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramanujan–Nagell equation |
E355435
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Mordell equation |
E640411
|
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: Mordell equation | Statement: [Ramanujan–Nagell equation, relatedTo, Mordell equation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mordell equation Context triple: [Ramanujan–Nagell equation, relatedTo, Mordell equation]
-
A.
Mordell curve
chosen
A Mordell curve is an elliptic curve of the form \(y^2 = x^3 + k\) over a field, central to number theory and Diophantine geometry.
-
B.
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.
-
C.
Mordell–Weil theorem
The Mordell–Weil theorem is a fundamental result in number theory stating that the group of rational points on an abelian variety (in particular, an elliptic curve) over a number field is finitely generated.
-
D.
Diophantine equations
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.
-
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_69d8278fa2108190bc0d0e7939c1eb03 |
completed | April 9, 2026, 10:26 p.m. |
| NER | Named-entity recognition | batch_69de8c20d2148190bb534bef338e871d |
completed | April 14, 2026, 6:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fd469634688190980df59ee482b792 |
completed | May 8, 2026, 2:12 a.m. |
Created at: April 10, 2026, 1:13 a.m.