Triple

T22423153
Position Surface form Disambiguated ID Type / Status
Subject Erdős–Ko–Rado theorem E554298 entity
Predicate hasGeneralization P2372 FINISHED
Object Hilton–Milner theorem
The Hilton–Milner theorem is a result in extremal set theory that determines the maximum size and structure of the largest nontrivial intersecting family of subsets, refining the classic Erdős–Ko–Rado theorem.
E554298 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: Hilton–Milner theorem | Statement: [Erdős–Ko–Rado theorem, hasGeneralization, Hilton–Milner theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Hilton–Milner theorem
Context triple: [Erdős–Ko–Rado theorem, hasGeneralization, Hilton–Milner theorem]
  • A. Hales–Jewett theorem
    The Hales–Jewett theorem is a fundamental result in Ramsey theory that guarantees the existence of large monochromatic combinatorial lines in high-dimensional grids under any finite coloring.
  • B. Graham–Pollak theorem
    The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
  • C. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • D. 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.
  • E. 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.
  • 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: Hilton–Milner theorem
Triple: [Erdős–Ko–Rado theorem, hasGeneralization, Hilton–Milner theorem]
Generated description
The Hilton–Milner theorem is a result in extremal set theory that determines the maximum size and structure of the largest nontrivial intersecting family of subsets, refining the classic Erdős–Ko–Rado theorem.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Hilton–Milner theorem
Target entity description: The Hilton–Milner theorem is a result in extremal set theory that determines the maximum size and structure of the largest nontrivial intersecting family of subsets, refining the classic Erdős–Ko–Rado theorem.
  • A. Hales–Jewett theorem
    The Hales–Jewett theorem is a fundamental result in Ramsey theory that guarantees the existence of large monochromatic combinatorial lines in high-dimensional grids under any finite coloring.
  • B. Graham–Pollak theorem
    The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
  • C. Graham–Rothschild theorem
    The Graham–Rothschild theorem is a fundamental result in Ramsey theory that generalizes classical partition theorems to higher-dimensional combinatorial structures.
  • D. Erdős–Ko–Rado theorem chosen
    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.
  • E. 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.
  • F. None of above.

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.