Triple
T26966596
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | EXPTIME |
E679188
|
entity |
| Predicate | timeComplexityForm |
P27167
|
FINISHED |
| Object | O(2^{p(n)}) for some polynomial p |
—
|
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: O(2^{p(n)}) for some polynomial p | Statement: [EXPTIME, timeComplexityForm, O(2^{p(n)}) for some polynomial p]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: timeComplexityForm
Context triple: [EXPTIME, timeComplexityForm, O(2^{p(n)}) for some polynomial p]
-
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.
hasComplexity
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
-
D.
computationalCost
Indicates the amount of computing resources (such as time, memory, or processing power) required to perform a given operation or process.
-
E.
complexityStatus
Indicates the current level or state of complexity associated with an entity 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_69eeeb4f3a448190b1e94b2d4776c16e |
completed | April 27, 2026, 4:51 a.m. |
| NER | Named-entity recognition | batch_69f621210b788190ab9e910cd635f366 |
completed | May 2, 2026, 4:06 p.m. |
| PD | Predicate disambiguation | batch_69f611af72ac819094598dd2530d7411 |
completed | May 2, 2026, 3:01 p.m. |
Created at: April 27, 2026, 6:36 a.m.