Triple
T26992659
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computers and Intractability: A Guide to the Theory of NP-Completeness |
E679895
|
entity |
| Predicate | timeComplexityModel |
P27167
|
FINISHED |
| Object | Turing machine model |
—
|
LITERAL 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 machine model | Statement: [Computers and Intractability: A Guide to the Theory of NP-Completeness, timeComplexityModel, Turing machine model]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: timeComplexityModel Context triple: [Computers and Intractability: A Guide to the Theory of NP-Completeness, timeComplexityModel, Turing machine model]
-
A.
timeComplexity
chosen
Indicates the computational growth rate of an algorithm’s resource usage (typically time) as a function of input size.
-
B.
spaceComplexity
Indicates the relationship between an algorithm and the amount of memory it requires as a function of input size.
-
C.
assumesComplexityMeasure
Indicates that one entity adopts or takes for granted a particular method or standard for measuring complexity in relation to another entity or context.
-
D.
hasComplexity
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
-
E.
computationalCost
Indicates the amount of computing resources (such as time, memory, or processing power) required to perform a given operation or process.
- F. None of above.
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_69eeeb5138ac8190b3c273ddc659a54f |
completed | April 27, 2026, 4:51 a.m. |
| NER | Named-entity recognition | batch_69f621915ee48190b508025afa2fb4fc |
completed | May 2, 2026, 4:08 p.m. |
| PD | Predicate disambiguation | batch_69f61b3ee7b08190a0a1bc5d26b757aa |
completed | May 2, 2026, 3:41 p.m. |
Created at: April 27, 2026, 6:53 a.m.