Triple
T21494559
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Steiner tree problem |
E530318
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | combinatorial optimization problem |
C44866
|
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: combinatorial optimization problem Context triple: [Steiner tree problem, instanceOf, combinatorial optimization problem]
-
A.
mathematical program
A mathematical program is an optimization model that seeks to minimize or maximize an objective function subject to a set of mathematical constraints.
-
B.
optimization paradigm
An optimization paradigm is a conceptual framework that defines how to formulate, search for, and evaluate solutions to a problem in order to find the best (or sufficiently good) outcome under given constraints and objectives.
-
C.
problem in optimal transport theory
A problem in optimal transport theory seeks the most efficient way to move mass from one probability distribution to another while minimizing a given cost function.
-
D.
optimality conditions
Optimality conditions are mathematical criteria that must be satisfied by a candidate solution to ensure it is a local or global optimum of an optimization problem.
-
E.
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.
- 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_69e0c45bd15481909fba5910765cdda2 |
completed | April 16, 2026, 11:13 a.m. |
Created at: April 16, 2026, 6:23 p.m.