Triple
T5213954
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum complexity measures |
E117702
|
entity |
| Predicate | describedBy |
P264
|
FINISHED |
| Object | Blum axioms |
E117701
|
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 axioms | Statement: [Blum complexity measures, describedBy, Blum axioms]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Blum axioms Context triple: [Blum complexity measures, describedBy, Blum axioms]
-
A.
Blum axioms
chosen
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.
-
B.
Blum complexity measures
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.
-
C.
Håstad’s switching lemma
Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
-
D.
arithmetization of syntax
Arithmetization of syntax is a method in mathematical logic that encodes formal language expressions and proofs as natural numbers so that syntactic properties can be studied using arithmetic.
-
E.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
- 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.