Triple

T5335919
Position Surface form Disambiguated ID Type / Status
Subject P, NP, and NP-Completeness: The Basics of Complexity Theory E123824 entity
Predicate relatedWork P37 FINISHED
Object Computational Complexity: A Conceptual Perspective E122536 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: Computational Complexity: A Conceptual Perspective | Statement: [P, NP, and NP-Completeness: The Basics of Complexity Theory, relatedWork, Computational Complexity: A Conceptual Perspective]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Computational Complexity: A Conceptual Perspective
Context triple: [P, NP, and NP-Completeness: The Basics of Complexity Theory, relatedWork, Computational Complexity: A Conceptual Perspective]
  • A. Computational Complexity: A Conceptual Perspective chosen
    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.
  • 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. Complexity Theory
    Complexity Theory is a branch of theoretical computer science that studies the resources, such as time and space, required to solve computational problems and classifies these problems based on their inherent difficulty.
  • 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. Randomness and Computation
    "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
  • 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_69bd464b07f8819095aa76577c9829e4 completed March 20, 2026, 1:06 p.m.
NER Named-entity recognition batch_69bd85af799081909ee60bfbb65149ee completed March 20, 2026, 5:36 p.m.
NED1 Entity disambiguation (via context triple) batch_69bf18be4bb88190a2b83e51716e677e completed March 21, 2026, 10:16 p.m.
Created at: March 20, 2026, 2 p.m.