Triple
T5645009
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Lenore Blum |
E124362
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Blum–Shub–Smale model of real computation |
E537367
|
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–Shub–Smale model of real computation | Statement: [Lenore Blum, knownFor, Blum–Shub–Smale model of real computation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Blum–Shub–Smale model of real computation Context triple: [Lenore Blum, knownFor, Blum–Shub–Smale model of real computation]
-
A.
Blum–Shub–Smale model of computation
chosen
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
-
B.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
The Calculus of Computation
The Calculus of Computation is a textbook that introduces the mathematical foundations of verification, focusing on logic-based methods for specifying and proving properties of computational systems.
-
D.
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.
-
E.
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.
- 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_69c00824643c81909ffdb888a2d35189 |
completed | March 22, 2026, 3:17 p.m. |
| NER | Named-entity recognition | batch_69c022a8eccc8190837d4705670dc25e |
completed | March 22, 2026, 5:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c05a1d7af8819092e28ce9fb14d1f1 |
completed | March 22, 2026, 9:07 p.m. |
Created at: March 22, 2026, 3:41 p.m.