Triple
T13507187
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fibonacci heap |
E321043
|
entity |
| Predicate | timeComplexityAmortized |
P27167
|
FINISHED |
| Object | O(1) for insert |
—
|
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(1) for insert | Statement: [Fibonacci heap, timeComplexityAmortized, O(1) for insert]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: timeComplexityAmortized Context triple: [Fibonacci heap, timeComplexityAmortized, O(1) for insert]
-
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.
runtimeApprox
Indicates an approximate or estimated duration of time that something (such as a process, program, or event) takes to run or complete.
-
D.
boundedByApprox
Indicates that one quantity is constrained by another within an approximate or tolerance-based bound, rather than an exact strict limit.
-
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_69d807629d6c8190998f1b9bb12d2ed0 |
completed | April 9, 2026, 8:09 p.m. |
| NER | Named-entity recognition | batch_69dbaf8259a08190ada13c4a3078f07d |
completed | April 12, 2026, 2:43 p.m. |
| PD | Predicate disambiguation | batch_69dbae0b63748190b5e207f84b2532ea |
completed | April 12, 2026, 2:36 p.m. |
Created at: April 9, 2026, 9:43 p.m.