Triple

T21494068
Position Surface form Disambiguated ID Type / Status
Subject Beal conjecture E530308 entity
Predicate relatedTo P37 FINISHED
Object Catalan’s conjecture
Catalan’s conjecture is a number theory statement, now proven as Mihăilescu’s theorem, asserting that 8 and 9 are the only consecutive perfect powers among the positive integers.
E1487640 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: Catalan’s conjecture | Statement: [Beal conjecture, relatedTo, Catalan’s conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Catalan’s conjecture
Context triple: [Beal conjecture, relatedTo, Catalan’s conjecture]
  • A. 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.
  • B. 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).
  • C. 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.
  • D. 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.
  • E. Lebesgue–Nagell equation
    The Lebesgue–Nagell equation is a Diophantine equation of the form \(x^2 + D = y^n\) (with fixed integers \(D\) and \(n \ge 3\)) studied in number theory for its finite and often explicitly determinable set of integer solutions.
  • 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: Catalan’s conjecture
Triple: [Beal conjecture, relatedTo, Catalan’s conjecture]
Generated description
Catalan’s conjecture is a number theory statement, now proven as Mihăilescu’s theorem, asserting that 8 and 9 are the only consecutive perfect powers among the positive integers.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Catalan’s conjecture
Target entity description: Catalan’s conjecture is a number theory statement, now proven as Mihăilescu’s theorem, asserting that 8 and 9 are the only consecutive perfect powers among the positive integers.
  • A. 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.
  • B. 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).
  • C. 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.
  • D. 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.
  • E. Lebesgue–Nagell equation
    The Lebesgue–Nagell equation is a Diophantine equation of the form \(x^2 + D = y^n\) (with fixed integers \(D\) and \(n \ge 3\)) studied in number theory for its finite and often explicitly determinable set of integer solutions.
  • 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_69e0c45bd15481909fba5910765cdda2 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69e9ea567244819091863350fedae3ae completed April 23, 2026, 9:45 a.m.
NED1 Entity disambiguation (via context triple) batch_6a09e1398efc8190a6465defb1715c2b completed May 17, 2026, 3:39 p.m.
NEDg Description generation batch_6a09e24c7da48190b7e19f709b3c0d79 completed May 17, 2026, 3:44 p.m.
NED2 Entity disambiguation (via description) batch_6a09e2c86858819092216c12d8aa3348 completed May 17, 2026, 3:46 p.m.
Created at: April 16, 2026, 6:23 p.m.