Triple
T7666916
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Complexity Theory |
E173644
|
entity |
| Predicate | usesConcept |
P531
|
FINISHED |
| Object | Turing reductions |
E679186
|
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: Turing reductions | Statement: [Complexity Theory, usesConcept, Turing reductions]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turing reductions Context triple: [Complexity Theory, usesConcept, Turing reductions]
-
A.
Turing reducibility
chosen
Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.
-
B.
Karp reductions
Karp reductions are polynomial-time many-one reductions used in computational complexity theory to show that one decision problem is at least as hard as another, central to defining NP-completeness.
-
C.
Turing degrees
Turing degrees are an abstract classification of sets of natural numbers or decision problems according to their relative level of algorithmic unsolvability or computational complexity under Turing reducibility.
-
D.
Computability Theory
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
E.
Cook–Levin theorem
The Cook–Levin theorem is a foundational result in computational complexity theory that established the Boolean satisfiability problem (SAT) as the first NP-complete problem, launching the theory of NP-completeness.
- 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_69c699562484819086752091e3164a27 |
completed | March 27, 2026, 2:51 p.m. |
| NER | Named-entity recognition | batch_69c701c1383c8190ab5bf803bd6211a9 |
completed | March 27, 2026, 10:16 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c8a22442dc8190a26c966e7b06f1a9 |
completed | March 29, 2026, 3:53 a.m. |
Created at: March 27, 2026, 4 p.m.