Triple

T21088225
Position Surface form Disambiguated ID Type / Status
Subject Reducibility Among Combinatorial Problems E519559 entity
Predicate publishedIn P309 FINISHED
Object Complexity of Computer Computations — 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: Complexity of Computer Computations | Statement: [Reducibility Among Combinatorial Problems, publishedIn, Complexity of Computer Computations]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Complexity of Computer Computations
Context triple: [Reducibility Among Combinatorial Problems, publishedIn, Complexity of Computer Computations]
  • A. "Reducibility Among Combinatorial Problems" (1972)
    "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
  • B. Elements of the Theory of Computation
    Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
  • C. Papadimitriou: Computational Complexity
    "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
  • D. 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.
  • E. 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.
  • 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: Complexity of Computer Computations
Target entity description: "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.
  • A. "Reducibility Among Combinatorial Problems" (1972)
    "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
  • B. Elements of the Theory of Computation
    Elements of the Theory of Computation is a foundational textbook that introduces the mathematical and theoretical principles underlying computer science, including automata, formal languages, and computability.
  • C. Papadimitriou: Computational Complexity
    "Papadimitriou: Computational Complexity" is a widely used graduate-level textbook that systematically develops the theory of computational complexity, including classes like P and NP and the foundations of NP-completeness.
  • D. 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.
  • E. 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.
  • 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_69e0b507dd9081908fb8bfcbef4c8b46 completed April 16, 2026, 10:08 a.m.
NER Named-entity recognition batch_69e7094cebe08190bb10f51a45c244ec completed April 21, 2026, 5:21 a.m.
Created at: April 16, 2026, 2:50 p.m.