Triple
T14720996
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Valiant–Vazirani theorem |
E345812
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | computational complexity theorem |
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: computational complexity theorem Context triple: [Valiant–Vazirani theorem, instanceOf, computational complexity theorem]
-
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.
foundational principle in theoretical computer science
A foundational principle in theoretical computer science is a core, abstract concept or rule—such as computability, complexity, or formal language theory—that underlies and unifies the study of algorithms, computation models, and their inherent limits.
-
E.
theoretical computer science conference
A theoretical computer science conference is a formal academic gathering where researchers present, discuss, and critique new results and ideas in areas such as algorithms, complexity theory, cryptography, and formal methods.
- 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_69d822e5911c8190ba589f957dbd9ba7 |
completed | April 9, 2026, 10:06 p.m. |
Created at: April 10, 2026, 1:29 a.m.