Triple
T14334541
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramanujan–Nagell equation |
E355435
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Pillai’s conjecture
Pillai’s conjecture is an unproven statement in number theory asserting that the difference between perfect powers takes each positive integer value only finitely many times.
|
E1094039
|
NE FINISHED |
How this triple was built (4 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: Pillai’s conjecture | Statement: [Ramanujan–Nagell equation, relatedTo, Pillai’s conjecture]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Pillai’s conjecture Context triple: [Ramanujan–Nagell equation, relatedTo, Pillai’s conjecture]
-
A.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
-
B.
Pólya’s conjecture
Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
-
C.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
-
D.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
-
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. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Pillai’s conjecture Triple: [Ramanujan–Nagell equation, relatedTo, Pillai’s conjecture]
Generated description
Pillai’s conjecture is an unproven statement in number theory asserting that the difference between perfect powers takes each positive integer value only finitely many times.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Pillai’s conjecture Target entity description: Pillai’s conjecture is an unproven statement in number theory asserting that the difference between perfect powers takes each positive integer value only finitely many times.
-
A.
Bateman–Horn conjecture
The Bateman–Horn conjecture is a far-reaching unproven statement in number theory that predicts how often sets of polynomial expressions simultaneously take prime values, generalizing several earlier conjectures about the distribution of prime numbers.
-
B.
Pólya’s conjecture
Pólya’s conjecture is a disproven hypothesis in number theory that proposed a specific long-term sign pattern for the summatory Möbius function, suggesting it would eventually remain nonpositive.
-
C.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
-
D.
Hardy–Littlewood conjectures
The Hardy–Littlewood conjectures are a collection of influential unproven hypotheses in analytic number theory that generalize the prime number theorem to describe the distribution of prime numbers and prime constellations.
-
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. chosen
Provenance (5 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. |
| NEDg | Description generation | batch_69fd47e2b8d481909ed8274a96615b36 |
completed | May 8, 2026, 2:18 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69fd4879b2688190ac208545ae226c93 |
completed | May 8, 2026, 2:20 a.m. |
Created at: April 10, 2026, 1:13 a.m.