Triple

T5645006
Position Surface form Disambiguated ID Type / Status
Subject Lenore Blum E124362 entity
Predicate notableWork P4 FINISHED
Object Blum–Shub–Smale model of computation
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
 E537367 NE FINISHED

Named-entity recognition

Before disambiguation, gpt-5-mini classified whether the object phrase is a named entity — the step behind the object's NE type shown above.

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 computation | Statement: [Lenore Blum, notableWork, Blum–Shub–Smale model of computation]

Disambiguation candidates (2 decisions)

The exact options the model was shown at each disambiguation step, with the option it chose highlighted — the evidence behind this triple's disambiguated ids.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Blum–Shub–Smale model of computation
Context triple: [Lenore Blum, notableWork, Blum–Shub–Smale model of computation]
  • A. 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.
  • 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. 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. 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. Furst–Saxe–Sipser lower bounds
    Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: Blum–Shub–Smale model of computation
Target entity description: The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.
  • A. 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.
  • 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. 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. 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. Furst–Saxe–Sipser lower bounds
    Furst–Saxe–Sipser lower bounds are foundational results in circuit complexity theory that established superpolynomial lower bounds for constant-depth Boolean circuits (AC⁰), demonstrating inherent limitations of such circuits for computing certain functions.
  • F. None of above. chosen

How the object was described

The object's one-sentence description was generated by prompting gpt-5.1 with the object name and this triple as context.

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: Blum–Shub–Smale model of computation
Triple: [Lenore Blum, notableWork, Blum–Shub–Smale model of computation]
Generated description
The Blum–Shub–Smale model of computation is a theoretical framework for analyzing algorithms over real numbers, extending classical complexity theory beyond discrete computation.

Provenance (5 batches)

Stage Batch ID Job type Status
creating batch_69c00824643c81909ffdb888a2d35189 elicitation completed
NER batch_69c022a8eccc8190837d4705670dc25e ner completed
NED1 batch_69c04d84e14c8190b913486cb516eee1 ned_source_triple completed
NED2 batch_69c04f7e64c88190bbced2f2460c1913 ned_description completed
NEDg batch_69c04edbf1f081908d74d0ac29601a35 nedg completed
Created at: March 22, 2026, 3:41 p.m.