Triple

T21377439
Position Surface form Disambiguated ID Type / Status
Subject Richard E. Stearns E527248 entity
Predicate notableWork P4 FINISHED
Object On the Computational Complexity of Algorithms — NE NERFINISHED

How this triple was built (3 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: On the Computational Complexity of Algorithms | Statement: [Richard E. Stearns, notableWork, On the Computational Complexity of Algorithms]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: On the Computational Complexity of Algorithms
Context triple: [Richard E. Stearns, notableWork, On the Computational Complexity of Algorithms]
  • A. 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.
  • B. 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.
  • C. 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.
  • D. The Design and Analysis of Computer Algorithms
    The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
  • E. The Computational Complexity of Boolean Functions
    "The Computational Complexity of Boolean Functions" is a foundational monograph in theoretical computer science that systematically studies the resources required to compute Boolean functions, particularly within circuit complexity.
  • 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: On the Computational Complexity of Algorithms
Target entity description: "On the Computational Complexity of Algorithms" is a foundational research paper that helped establish the formal study of computational complexity by analyzing the resource requirements of algorithms.
  • A. 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.
  • B. 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.
  • C. 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.
  • D. The Design and Analysis of Computer Algorithms
    The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
  • E. The Computational Complexity of Boolean Functions
    "The Computational Complexity of Boolean Functions" is a foundational monograph in theoretical computer science that systematically studies the resources required to compute Boolean functions, particularly within circuit complexity.
  • F. None of above. chosen

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_69e0b51f363c8190944000ab5523b02b completed April 16, 2026, 10:08 a.m.
NER Named-entity recognition batch_69e8b0c8768c8190ad7cddf5cd1d06f7 completed April 22, 2026, 11:28 a.m.
Created at: April 16, 2026, 5:11 p.m.