Triple
T22423227
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Erdős–Stone theorem |
E554300
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | result in extremal graph theory |
C46262
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: result in extremal graph theory Context triple: [Erdős–Stone theorem, instanceOf, result in extremal graph theory]
-
A.
open problem in graph theory
An open problem in graph theory is a well-defined question about graphs whose truth or solution is currently unknown and remains an active subject of mathematical research.
-
B.
area of combinatorics
An area of combinatorics is a branch of the mathematical field of combinatorics that focuses on a specific family of discrete structures, techniques, and problems, such as graph theory, extremal combinatorics, or probabilistic methods.
-
C.
non-3-edge-colorable graph
A non-3-edge-colorable graph is a graph whose edges cannot be colored with just three colors so that no two adjacent edges share the same color.
-
D.
result in lattice theory
A result in lattice theory is a proven theorem or proposition that describes structural, order-theoretic, or algebraic properties of lattices and their related constructs.
-
E.
result in combinatorial game theory
In combinatorial game theory, a result is a formal outcome or conclusion—such as a theorem, lemma, or classification—that characterizes the behavior, value, or winning conditions of one or more games under specified rules.
- F. None of above. chosen
Provenance (1 batch)
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. |
Created at: April 16, 2026, 8:47 p.m.