Triple
T9810360
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Theoretical Computer Science |
E238251
|
entity |
| Predicate | hasSubfield |
P5461
|
FINISHED |
| Object | Computational Complexity Theory |
E173644
|
NE FINISHED |
How this triple was built (2 steps)
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.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Computational Complexity Theory | Statement: [Theoretical Computer Science, hasSubfield, Computational Complexity Theory]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computational Complexity Theory Context triple: [Theoretical Computer Science, hasSubfield, Computational Complexity Theory]
-
A.
Complexity Theory
chosen
Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
-
B.
Theoretical Computer Science
Theoretical Computer Science is a branch of computer science that focuses on mathematical and abstract foundations of computation, including algorithms, complexity, automata, and formal languages.
-
C.
Computational Complexity blog
The Computational Complexity blog is a long-running, influential blog on theoretical computer science and complexity theory, co-authored by Lance Fortnow (and often Bill Gasarch), featuring commentary on research, academia, and the theory community.
-
D.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
E.
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
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_69ca84defac48190abc1148804f184c1 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb220310c8190a16ca0b746f0ef7a |
completed | April 2, 2026, 12:02 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1cc5b4dd8819088c86946b4eb8a39 |
completed | April 5, 2026, 2:43 a.m. |
Created at: March 30, 2026, 8:30 p.m.