Triple
T16107791
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Esther Szekeres |
E390783
|
entity |
| Predicate | influenced |
P9
|
FINISHED |
| Object | Ramsey theory in combinatorics |
E381617
|
NE FINISHED |
How this triple was built (2 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 theory in combinatorics | Statement: [Esther Szekeres, influenced, Ramsey theory in combinatorics]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Ramsey theory in combinatorics Context triple: [Esther Szekeres, influenced, Ramsey theory in combinatorics]
-
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.
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.
-
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.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69d87f1a8dd881909f1de6ef78849874 |
completed | April 10, 2026, 4:39 a.m. |
| NER | Named-entity recognition | batch_69e1ff6e55c08190b77f344e4e8c42ad |
completed | April 17, 2026, 9:37 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ffeba4479c81909f7d43e33f228f7e |
completed | May 10, 2026, 2:21 a.m. |
Created at: April 10, 2026, 5 a.m.