Triple
T3522521
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PCP theorem |
E74456
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | theorem in computational complexity theory |
C716
|
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: theorem in computational complexity theory Context triple: [PCP theorem, instanceOf, theorem in computational complexity theory]
-
A.
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.
-
B.
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.
-
C.
mathematical theorem
chosen
A mathematical theorem is a rigorously proven statement derived from axioms and previously established results, expressing a fundamental truth within a formal mathematical system.
-
D.
set of axioms in information theory
A set of axioms in information theory is a foundational collection of formal assumptions that precisely define and constrain measures of information, uncertainty, and related concepts so that theorems and results can be derived consistently.
-
E.
set of axioms in information theory
A set of axioms in information theory is a foundational collection of formal principles that precisely define and constrain measures of information, uncertainty, and related concepts so that consistent theorems and results can be derived.
- 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_69ad85d0c5488190a3d8e02ebd01a1aa |
completed | March 8, 2026, 2:21 p.m. |
Created at: March 8, 2026, 3:19 p.m.