Triple

T13507371
Position Surface form Disambiguated ID Type / Status
Subject David S. Johnson E321047 entity
Predicate authorOf P4244 FINISHED
Object Computers and Intractability: A Guide to the Theory of NP-Completeness E679895 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: Computers and Intractability: A Guide to the Theory of NP-Completeness | Statement: [David S. Johnson, authorOf, Computers and Intractability: A Guide to the Theory of NP-Completeness]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Computers and Intractability: A Guide to the Theory of NP-Completeness
Context triple: [David S. Johnson, authorOf, Computers and Intractability: A Guide to the Theory of NP-Completeness]
  • A. Garey and Johnson: Computers and Intractability chosen
    "Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
  • 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. "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.
  • D. 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.
  • E. “Inapproximability results for SAT and other problems”
    “Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
  • 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_69d807629d6c8190998f1b9bb12d2ed0 completed April 9, 2026, 8:09 p.m.
NER Named-entity recognition batch_69dbaf8259a08190ada13c4a3078f07d completed April 12, 2026, 2:43 p.m.
NED1 Entity disambiguation (via context triple) batch_69f7548e51b881909a3384812556bc3d completed May 3, 2026, 1:58 p.m.
Created at: April 9, 2026, 9:43 p.m.