Triple
T15741742
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ramsey theory |
E381617
|
entity |
| Predicate | hasCentralConcept |
P531
|
FINISHED |
| Object |
Ramsey theorem
Ramsey theorem is a fundamental result in combinatorics stating that in any sufficiently large structure, one can always find a large, highly ordered substructure.
|
E381617
|
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: Ramsey theorem | Statement: [Ramsey theory, hasCentralConcept, Ramsey theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ramsey theorem Context triple: [Ramsey theory, hasCentralConcept, Ramsey theorem]
-
A.
Ramsey theory
Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
-
B.
Ramsey number
A Ramsey number is the smallest integer n such that any coloring or partitioning of the edges of a complete graph on n vertices must contain a particular monochromatic substructure, making it a central object in combinatorics and graph theory.
-
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–Rado theorem
The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.
-
E.
Ramsey multiplicity
Ramsey multiplicity is a concept in Ramsey theory that quantifies the minimum number of monochromatic substructures (such as cliques) that must appear in any edge-coloring of a large enough complete graph.
- 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: Ramsey theorem Triple: [Ramsey theory, hasCentralConcept, Ramsey theorem]
Generated description
Ramsey theorem is a fundamental result in combinatorics stating that in any sufficiently large structure, one can always find a large, highly ordered substructure.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Ramsey theorem Target entity description: Ramsey theorem is a fundamental result in combinatorics stating that in any sufficiently large structure, one can always find a large, highly ordered substructure.
-
A.
Ramsey theory
chosen
Ramsey theory is a branch of combinatorics that studies the conditions under which order or structure must appear within sufficiently large or complex mathematical objects.
-
B.
Ramsey number
A Ramsey number is the smallest integer n such that any coloring or partitioning of the edges of a complete graph on n vertices must contain a particular monochromatic substructure, making it a central object in combinatorics and graph theory.
-
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–Rado theorem
The Erdős–Rado theorem is a fundamental result in combinatorial set theory that generalizes Ramsey’s theorem to infinite cardinals, establishing powerful partition relations for large sets.
-
E.
Ramsey multiplicity
Ramsey multiplicity is a concept in Ramsey theory that quantifies the minimum number of monochromatic substructures (such as cliques) that must appear in any edge-coloring of a large enough complete graph.
- 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_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_69ff876b7fd081909d84ebe7a4cdb675 |
completed | May 9, 2026, 7:13 p.m. |
| NEDg | Description generation | batch_69ff8827e5e0819084e12bfd546ed215 |
completed | May 9, 2026, 7:16 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69ff88cfbe388190b20c426b4c745f92 |
completed | May 9, 2026, 7:19 p.m. |
Created at: April 10, 2026, 4:46 a.m.