Triple
T14334552
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramanujan–Nagell equation |
E355435
|
entity |
| Predicate | classification |
P87
|
FINISHED |
| Object | Thue-type equation |
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: Thue-type equation | Statement: [Ramanujan–Nagell equation, classification, Thue-type equation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Thue-type equation Context triple: [Ramanujan–Nagell equation, classification, Thue-type equation]
-
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.
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.
Hilbert’s tenth problem
Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
-
D.
Mordell curve
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.
-
E.
Baker theorem on linear forms in logarithms
The Baker theorem on linear forms in logarithms is a fundamental result in transcendental number theory that provides explicit lower bounds for nonzero linear combinations of logarithms of algebraic numbers, with powerful applications to Diophantine equations and Diophantine approximation.
- 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.