Triple
T36151481
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | pairing heap |
E1045596
|
entity |
| Predicate | timeComplexityDeleteMin |
P27167
|
FINISHED |
| Object | O(log n) amortized (under common analyses) |
—
|
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(log n) amortized (under common analyses) | Statement: [pairing heap, timeComplexityDeleteMin, O(log n) amortized (under common analyses)]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: timeComplexityDeleteMin Context triple: [pairing heap, timeComplexityDeleteMin, O(log n) amortized (under common analyses)]
-
A.
timeComplexity
chosen
Indicates the computational growth rate of an algorithm’s resource usage (typically time) as a function of input size.
-
B.
deleteMinProcess
Indicates the action of removing the process with the minimum (e.g., lowest priority or earliest) value from a collection or scheduling structure.
-
C.
spaceComplexity
Indicates the relationship between an algorithm and the amount of memory it requires as a function of input size.
-
D.
minimumDepth
Indicates the smallest or shallowest depth value associated with an entity or between entities in a given context.
-
E.
minimumDegree
Indicates that the relationship specifies the smallest number of connections or edges incident to any entity within a given structure or set.
- 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_69f76e37ace88190a906b107d388f5d1 |
completed | May 3, 2026, 3:48 p.m. |
| NER | Named-entity recognition | batch_69f7be53890081909b1d93f30a8f31c6 |
completed | May 3, 2026, 9:29 p.m. |
| PD | Predicate disambiguation | batch_69f7bccacbac8190978976324c67db28 |
completed | May 3, 2026, 9:23 p.m. |
Created at: May 3, 2026, 4:08 p.m.