Triple

T5570543
Position Surface form Disambiguated ID Type / Status
Subject Fermat's Last Theorem E146188 entity
Predicate relatedProblem P37 FINISHED
Object Beal conjecture
The Beal conjecture is an unsolved problem in number theory proposing that if A^x + B^y = C^z with A, B, C, x, y, z positive integers and exponents greater than 2, then A, B, and C must share a common prime factor.
E530308 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: Beal conjecture | Statement: [Fermat's Last Theorem, relatedProblem, Beal conjecture]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Beal conjecture
Context triple: [Fermat's Last Theorem, relatedProblem, Beal conjecture]
  • A. Fermat's Last Theorem
    Fermat's Last Theorem is a famous statement in number theory asserting that there are no whole-number solutions to the equation xⁿ + yⁿ = zⁿ for integers n greater than 2, a problem that remained unsolved for over three centuries until it was proved by Andrew Wiles in the 1990s.
  • B. 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.
  • C. Birch and Swinnerton-Dyer Conjecture
    The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
  • 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. Goldbach conjecture
    The Goldbach conjecture is a famous unsolved problem in number theory asserting that every even integer greater than 2 can be expressed as the sum of two prime numbers.
  • 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: Beal conjecture
Triple: [Fermat's Last Theorem, relatedProblem, Beal conjecture]
Generated description
The Beal conjecture is an unsolved problem in number theory proposing that if A^x + B^y = C^z with A, B, C, x, y, z positive integers and exponents greater than 2, then A, B, and C must share a common prime factor.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Beal conjecture
Target entity description: The Beal conjecture is an unsolved problem in number theory proposing that if A^x + B^y = C^z with A, B, C, x, y, z positive integers and exponents greater than 2, then A, B, and C must share a common prime factor.
  • A. Fermat's Last Theorem
    Fermat's Last Theorem is a famous statement in number theory asserting that there are no whole-number solutions to the equation xⁿ + yⁿ = zⁿ for integers n greater than 2, a problem that remained unsolved for over three centuries until it was proved by Andrew Wiles in the 1990s.
  • B. 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.
  • C. Birch and Swinnerton-Dyer Conjecture
    The Birch and Swinnerton-Dyer Conjecture is a central unsolved problem in number theory that predicts a deep connection between the arithmetic of rational points on an elliptic curve and the behavior of its associated L-function at a specific value.
  • 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. Goldbach conjecture
    The Goldbach conjecture is a famous unsolved problem in number theory asserting that every even integer greater than 2 can be expressed as the sum of two prime numbers.
  • 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_69c008ffed108190a084602227af6157 completed March 22, 2026, 3:21 p.m.
NER Named-entity recognition batch_69c020502a288190af37f9ebb88fccae completed March 22, 2026, 5:01 p.m.
NED1 Entity disambiguation (via context triple) batch_69c0284bb71881908c0ac4ea2a302327 completed March 22, 2026, 5:35 p.m.
NEDg Description generation batch_69c040a395488190bea2fd651c3aeef7 completed March 22, 2026, 7:18 p.m.
NED2 Entity disambiguation (via description) batch_69c04141ea408190aba1463d56ad6b7d completed March 22, 2026, 7:21 p.m.
Created at: March 22, 2026, 3:37 p.m.