Triple

T15741745
Position Surface form Disambiguated ID Type / Status
Subject Ramsey theory E381617 entity
Predicate hasCentralConcept P531 FINISHED
Object Hindman theorem
Hindman theorem is a fundamental result in Ramsey theory stating that for any finite coloring of the natural numbers, there exists an infinite subset whose finite sums of distinct elements are all the same color.
E1174201 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: Hindman theorem | Statement: [Ramsey theory, hasCentralConcept, Hindman theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hindman theorem
Context triple: [Ramsey theory, hasCentralConcept, Hindman theorem]
  • A. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • B. 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.
  • C. Steinhaus theorem
    The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
  • D. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • E. Erdős–Ko–Rado theorem
    The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
  • 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: Hindman theorem
Triple: [Ramsey theory, hasCentralConcept, Hindman theorem]
Generated description
Hindman theorem is a fundamental result in Ramsey theory stating that for any finite coloring of the natural numbers, there exists an infinite subset whose finite sums of distinct elements are all the same color.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hindman theorem
Target entity description: Hindman theorem is a fundamental result in Ramsey theory stating that for any finite coloring of the natural numbers, there exists an infinite subset whose finite sums of distinct elements are all the same color.
  • A. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • B. 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.
  • C. Steinhaus theorem
    The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
  • D. Szekeres–Lindström theorem
    The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
  • E. Erdős–Ko–Rado theorem
    The Erdős–Ko–Rado theorem is a fundamental result in extremal combinatorics that determines the maximum size of a family of subsets of a finite set in which every pair of subsets has a non-empty intersection.
  • 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_69d86d9cdb648190bf3171be0bd7d872 completed April 10, 2026, 3:25 a.m.
NER Named-entity recognition batch_69e04fd97d6c8190b2fa6ca422bfe512 completed April 16, 2026, 2:56 a.m.
NED1 Entity disambiguation (via context triple) batch_69ff83056aa0819098b757ed125e61fe completed May 9, 2026, 6:55 p.m.
NEDg Description generation batch_69ff83ca33d08190816130bf2ea735df completed May 9, 2026, 6:58 p.m.
NED2 Entity disambiguation (via description) batch_69ff846436e48190b711da134c9a3b81 completed May 9, 2026, 7 p.m.
Created at: April 10, 2026, 4:46 a.m.