Triple
T15667157
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Christos H. Papadimitriou |
E377214
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Combinatorial Optimization: Algorithms and Complexity
Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
|
E1170225
|
NE FINISHED |
How this triple was built (4 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: Combinatorial Optimization: Algorithms and Complexity | Statement: [Christos H. Papadimitriou, notableWork, Combinatorial Optimization: Algorithms and Complexity]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Combinatorial Optimization: Algorithms and Complexity Context triple: [Christos H. Papadimitriou, notableWork, Combinatorial Optimization: Algorithms and Complexity]
-
A.
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.
-
B.
Garey and Johnson: Computers and Intractability
"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.
-
C.
Gomory cuts in integer programming
Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization 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.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Combinatorial Optimization: Algorithms and Complexity Triple: [Christos H. Papadimitriou, notableWork, Combinatorial Optimization: Algorithms and Complexity]
Generated description
Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Combinatorial Optimization: Algorithms and Complexity Target entity description: Combinatorial Optimization: Algorithms and Complexity is a foundational textbook that systematically develops the theory and algorithms of combinatorial optimization, emphasizing computational complexity and algorithmic efficiency.
-
A.
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.
-
B.
Garey and Johnson: Computers and Intractability
"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.
-
C.
Gomory cuts in integer programming
Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization 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.
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.
- F. None of above. chosen
Provenance (5 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_69d85cd2e28481909d4e975bee20872f |
completed | April 10, 2026, 2:13 a.m. |
| NER | Named-entity recognition | batch_69e04f1151548190a14607e762686cb1 |
completed | April 16, 2026, 2:53 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ff67a22888819092ea521bbad7bcb7 |
completed | May 9, 2026, 4:58 p.m. |
| NEDg | Description generation | batch_69ff68fd16b88190a78772bcd0302189 |
completed | May 9, 2026, 5:03 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69ff6943d47881908c1634b43a6d6b96 |
completed | May 9, 2026, 5:05 p.m. |
Created at: April 10, 2026, 4:16 a.m.