Triple

T12026555
Position Surface form Disambiguated ID Type / Status
Subject Green–Tao theorem E286292 entity
Predicate generalizesFrom P57966 FINISHED
Object Szemerédi's theorem
Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
E959796 NE FINISHED

How this triple was built (5 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: Szemerédi's theorem | Statement: [Green–Tao theorem, generalizesFrom, Szemerédi's theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Szemerédi's theorem
Context triple: [Green–Tao theorem, generalizesFrom, Szemerédi's theorem]
  • A. Green–Tao theorem
    The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
  • B. 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.
  • C. Erdős discrepancy problem
    The Erdős discrepancy problem is a famous question in combinatorial number theory that asks whether every infinite ±1 sequence has arbitrarily large discrepancy along some homogeneous arithmetic progression.
  • D. Roth theorem
    Roth's theorem is a fundamental result in Diophantine approximation that gives an essentially optimal bound on how well algebraic irrational numbers can be approximated by rational numbers.
  • E. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • 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: Szemerédi's theorem
Triple: [Green–Tao theorem, generalizesFrom, Szemerédi's theorem]
Generated description
Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Szemerédi's theorem
Target entity description: Szemerédi's theorem is a fundamental result in combinatorial number theory stating that any subset of the integers with positive upper density contains arbitrarily long arithmetic progressions.
  • A. Green–Tao theorem
    The Green–Tao theorem is a landmark result in number theory proving that the sequence of prime numbers contains arbitrarily long arithmetic progressions.
  • B. 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.
  • C. Erdős discrepancy problem
    The Erdős discrepancy problem is a famous question in combinatorial number theory that asks whether every infinite ±1 sequence has arbitrarily large discrepancy along some homogeneous arithmetic progression.
  • D. Roth theorem
    Roth's theorem is a fundamental result in Diophantine approximation that gives an essentially optimal bound on how well algebraic irrational numbers can be approximated by rational numbers.
  • E. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • F. None of above. chosen
PD Predicate disambiguation gpt-5-mini-2025-08-07
Target predicate: generalizesFrom
Context triple: [Green–Tao theorem, generalizesFrom, Szemerédi's theorem]
  • A. generalizationTo chosen
    Indicates that one concept or entity is a more general, abstract, or encompassing version of another, capturing a broader category or superset relationship.
  • B. generalizationOf
    Indicates that one entity represents a broader, more general concept or category that subsumes or abstracts over another, more specific entity.
  • C. generalizationProperty
    Indicates that one property is a more general, overarching version of another property, capturing a broader or more abstract relationship.
  • D. extendsTo
    Indicates that one entity reaches, stretches, or continues its scope, influence, or coverage up to or into another entity.
  • E. adaptsFrom
    Indicates that one entity is derived, modified, or transformed from another, preserving core elements while changing form, medium, or context.
  • F. None of above.

Provenance (6 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_69d6ab4669e48190b59246358b0383ab completed April 8, 2026, 7:23 p.m.
NER Named-entity recognition batch_69d9100b4ca8819084845ca4c13e34ce completed April 10, 2026, 2:58 p.m.
NED1 Entity disambiguation (via context triple) batch_69f48b8111b88190a42a8904a2d26862 completed May 1, 2026, 11:16 a.m.
NEDg Description generation batch_69f48fc7a8848190a06b34cc45db4789 completed May 1, 2026, 11:34 a.m.
NED2 Entity disambiguation (via description) batch_69f495f069c48190a6e5856c272420c0 completed May 1, 2026, noon
PD Predicate disambiguation batch_69d902b6ebbc8190b13c44a61c6f81b9 completed April 10, 2026, 2:01 p.m.
Created at: April 8, 2026, 9:47 p.m.