Triple
T21046826
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Sperner family |
E518470
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object | extremal combinatorics |
—
|
NE NERFINISHED |
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: extremal combinatorics | Statement: [Sperner family, usedIn, extremal combinatorics]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: extremal combinatorics Context triple: [Sperner family, usedIn, extremal combinatorics]
-
A.
extremal combinatorics
chosen
Extremal combinatorics is a branch of combinatorics that studies how large or how structured a discrete object (such as a graph or set system) can be under given constraints, often focusing on optimal bounds and extremal configurations.
-
B.
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.
-
C.
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.
-
D.
Foundations of Combinatorial Theory
Foundations of Combinatorial Theory is a seminal mathematical work by Gian-Carlo Rota that helped establish modern combinatorics as a rigorous and unified field of study.
-
E.
Combinatorial Nullstellensatz
Combinatorial Nullstellensatz is a powerful algebraic tool in combinatorics that uses polynomial methods over fields to derive results about combinatorial structures, such as existence and counting theorems.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e0b50438e08190917e2538bb8bc034 |
completed | April 16, 2026, 10:08 a.m. |
| NER | Named-entity recognition | batch_69e6fcf4d26481908b639996500a8319 |
completed | April 21, 2026, 4:28 a.m. |
Created at: April 16, 2026, 2:34 p.m.