Triple
T5213912
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum axioms |
E117701
|
entity |
| Predicate | definesConcept |
P773
|
FINISHED |
| Object | Blum complexity measure |
E117702
|
NE 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: Blum complexity measure | Statement: [Blum axioms, definesConcept, Blum complexity measure]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Blum complexity measure Context triple: [Blum axioms, definesConcept, Blum complexity measure]
-
A.
Blum complexity measures
chosen
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
B.
Kolmogorov complexity
Kolmogorov complexity is a measure of the amount of information in an object, defined as the length of the shortest computer program that can produce it.
-
C.
Blum axioms
Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
-
D.
P, NP, and NP-Completeness: The Basics of Complexity Theory
"P, NP, and NP-Completeness: The Basics of Complexity Theory" is a foundational textbook by Oded Goldreich that introduces the core concepts, problems, and techniques of computational complexity theory, with a focus on the classes P, NP, and NP-complete problems.
-
E.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69bd4464ba3c8190bc16b2ebbe42ddb0 |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd7a911d40819086621537274dc0f0 |
completed | March 20, 2026, 4:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69beefe325988190b35e3502f147c9c2 |
completed | March 21, 2026, 7:22 p.m. |
Created at: March 20, 2026, 1:47 p.m.