Triple
T7666918
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Complexity Theory |
E173644
|
entity |
| Predicate | usesConcept |
P531
|
FINISHED |
| Object |
Big-O notation
Big-O notation is a mathematical tool used in computer science to describe how the running time or space requirements of an algorithm grow relative to the size of its input.
|
E679192
|
NE FINISHED |
How this triple was built (4 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: Big-O notation | Statement: [Complexity Theory, usesConcept, Big-O notation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Big-O notation Context triple: [Complexity Theory, usesConcept, Big-O notation]
-
A.
Bounding Theory
Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
-
B.
Bounds
Bounds is the maiden surname of Lillian Disney, the wife of Walt Disney and a key figure in the early Disney family history.
-
C.
Amdahl's law
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
-
D.
Knuth’s up-arrow notation
Knuth’s up-arrow notation is a mathematical notation introduced by Donald Knuth to concisely represent very large integers using iterated exponentiation and its higher-order generalizations.
-
E.
Stirling's approximation
Stirling's approximation is a classical formula in mathematics that provides an efficient asymptotic estimate for factorials and the gamma function, especially for large arguments.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Big-O notation Triple: [Complexity Theory, usesConcept, Big-O notation]
Generated description
Big-O notation is a mathematical tool used in computer science to describe how the running time or space requirements of an algorithm grow relative to the size of its input.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Big-O notation Target entity description: Big-O notation is a mathematical tool used in computer science to describe how the running time or space requirements of an algorithm grow relative to the size of its input.
-
A.
Bounding Theory
Bounding Theory is a subtheory within Government and Binding Theory in generative linguistics that constrains how far syntactic elements can move in a sentence.
-
B.
Bounds
Bounds is the maiden surname of Lillian Disney, the wife of Walt Disney and a key figure in the early Disney family history.
-
C.
Amdahl's law
Amdahl's law is a formula in computer architecture and parallel computing that predicts the maximum performance improvement achievable by parallelizing parts of a system, given that some portion must remain serial.
-
D.
Knuth’s up-arrow notation
Knuth’s up-arrow notation is a mathematical notation introduced by Donald Knuth to concisely represent very large integers using iterated exponentiation and its higher-order generalizations.
-
E.
Stirling's approximation
Stirling's approximation is a classical formula in mathematics that provides an efficient asymptotic estimate for factorials and the gamma function, especially for large arguments.
- F. None of above. chosen
Provenance (5 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_69c89b260000819088d744ea8dc53cd2 |
completed | March 29, 2026, 3:23 a.m. |
| NEDg | Description generation | batch_69c89c037d188190ace1c5e80a43aba0 |
completed | March 29, 2026, 3:26 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c89c698f2c8190b5d2717835bd1d82 |
completed | March 29, 2026, 3:28 a.m. |
Created at: March 27, 2026, 4 p.m.