Triple

T22423463
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Moser equation E554305 entity
Predicate isRelatedTo P37 FINISHED
Object Prouhet–Tarry–Escott problem
The Prouhet–Tarry–Escott problem is a classic number theory problem that asks for distinct integer multisets whose powers up to a given degree have equal sums, making it a central example in the study of equal-sum power partitions and Diophantine equations.
E1536262 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: Prouhet–Tarry–Escott problem | Statement: [Erdős–Moser equation, isRelatedTo, Prouhet–Tarry–Escott problem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Prouhet–Tarry–Escott problem
Context triple: [Erdős–Moser equation, isRelatedTo, Prouhet–Tarry–Escott problem]
  • A. 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).
  • B. Waring's problem
    Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
  • C. 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.
  • D. 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.
  • E. 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.
  • 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: Prouhet–Tarry–Escott problem
Triple: [Erdős–Moser equation, isRelatedTo, Prouhet–Tarry–Escott problem]
Generated description
The Prouhet–Tarry–Escott problem is a classic number theory problem that asks for distinct integer multisets whose powers up to a given degree have equal sums, making it a central example in the study of equal-sum power partitions and Diophantine equations.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Prouhet–Tarry–Escott problem
Target entity description: The Prouhet–Tarry–Escott problem is a classic number theory problem that asks for distinct integer multisets whose powers up to a given degree have equal sums, making it a central example in the study of equal-sum power partitions and Diophantine equations.
  • A. 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).
  • B. Waring's problem
    Waring's problem is a famous conjecture in number theory that concerns representing natural numbers as sums of fixed powers of integers and determining how many such powers are needed.
  • C. 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.
  • D. 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.
  • E. 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.
  • 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_69e11e4f2d0c819091aa3558ea2ee630 completed April 16, 2026, 5:37 p.m.
NER Named-entity recognition batch_69f15a2af620819083338127e78137dc completed April 29, 2026, 1:08 a.m.
NED1 Entity disambiguation (via context triple) batch_6a0af0f06cec8190a911ab9a867c0596 completed May 18, 2026, 10:58 a.m.
NEDg Description generation batch_6a0af2c6151881908f85a7c3c751cea9 completed May 18, 2026, 11:06 a.m.
NED2 Entity disambiguation (via description) batch_6a0b08e411048190a368214c57c35d5e completed May 18, 2026, 12:41 p.m.
Created at: April 16, 2026, 8:47 p.m.