Triple
T21061762
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Furst–Saxe–Sipser lower bounds |
E518865
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | circuit complexity lower bound |
C33131
|
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: circuit complexity lower bound Context triple: [Furst–Saxe–Sipser lower bounds, instanceOf, circuit complexity lower bound]
-
A.
complexity theory paper
chosen
A complexity theory paper is a scholarly work that rigorously analyzes the computational resources required to solve problems, classifies them into complexity classes, and explores relationships or separations between these classes.
-
B.
complexity measure
A complexity measure is a quantitative function or criterion used to assess and compare the intricacy, difficulty, or resource requirements of objects, systems, or problems.
-
C.
model of computation
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
-
D.
bound in coding theory
In coding theory, a bound is a theoretical limit that constrains parameters such as code length, dimension, and minimum distance, defining what combinations are possible or optimal for error-correcting codes.
-
E.
lower bound on variance
A lower bound on variance is a theoretical limit that specifies the smallest possible variance any unbiased estimator of a parameter can achieve under given model assumptions.
- F. None of above.
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_69e0b505ef108190b25dd4033e2ff7eb |
completed | April 16, 2026, 10:08 a.m. |
Created at: April 16, 2026, 2:38 p.m.