Triple

T21768869
Position Surface form Disambiguated ID Type / Status
Subject Mike Shub E537368 entity
Predicate coAuthorOf P2389 FINISHED
Object Blum–Shub–Smale model of computation — NE NERFINISHED

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 computation | Statement: [Mike Shub, coAuthorOf, Blum–Shub–Smale model of computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Blum–Shub–Smale model of computation
Context triple: [Mike Shub, coAuthorOf, Blum–Shub–Smale model of 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. 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.
  • D. Complexity of Computer Computations
    "Complexity of Computer Computations" is a seminal 1972 conference proceedings volume that helped establish the foundations of computational complexity theory by collecting influential early papers on algorithmic efficiency and problem hardness.
  • E. Outline of a Mathematical Theory of Computation
    Outline of a Mathematical Theory of Computation is a foundational work by Dana Scott that helped establish the theoretical underpinnings of computer science through the development of denotational semantics and domain theory.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69e0c46f5d1c8190bf830409e98464e5 completed April 16, 2026, 11:13 a.m.
NER Named-entity recognition batch_69f031ac10808190837a0f69c4f8a02d completed April 28, 2026, 4:03 a.m.
Created at: April 16, 2026, 6:51 p.m.