Triple
T7278031
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Sprague–Grundy theorem |
E163078
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | result in combinatorial game theory |
C20670
|
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 combinatorial game theory Context triple: [Sprague–Grundy theorem, instanceOf, result in combinatorial game theory]
-
A.
combinatorial game
A combinatorial game is a two-player, perfect-information game with no chance elements where players move alternately and the outcome depends solely on their strategic choices under well-defined rules.
-
B.
mathematical game
A mathematical game is a structured activity or problem governed by explicit rules in which players make decisions or moves, often analyzed using mathematical concepts such as strategy, probability, and optimization.
-
C.
topological game
A topological game is a two-player game played on a topological space where players alternately choose points, sets, or open neighborhoods according to specified rules, with winning conditions defined by topological properties such as convergence, closure, or covering.
-
D.
result in probability theory
In probability theory, a result is a formally stated and proven fact—such as a theorem, lemma, or corollary—that describes a property or relationship involving probabilistic concepts like random variables, events, or distributions.
-
E.
result in social choice theory
A result in social choice theory is a formal theorem or proposition that characterizes how individual preferences can be aggregated into a collective decision under specified axioms or conditions.
- 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_69c6885c5964819085b209701769877f |
completed | March 27, 2026, 1:38 p.m. |
Created at: March 27, 2026, 2:59 p.m.