Triple

T36151125

Position	Surface form	Disambiguated ID	Type / Status
Subject	Stephen A. Cook	`E1045586`	entity
Predicate	doctoralThesis	`P6`	FINISHED
Object	The Complexity of Theorem-Proving Procedures "The Complexity of Theorem-Proving Procedures" is Stephen A. Cook’s landmark 1971 PhD thesis that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.	`E321037`	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: The Complexity of Theorem-Proving Procedures | Statement: [Stephen A. Cook, doctoralThesis, The Complexity of Theorem-Proving Procedures]

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: The Complexity of Theorem-Proving Procedures
Triple: [Stephen A. Cook, doctoralThesis, The Complexity of Theorem-Proving Procedures]

Generated description

"The Complexity of Theorem-Proving Procedures" is Stephen A. Cook’s landmark 1971 PhD thesis that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.

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_69f76e37ace88190a906b107d388f5d1`	completed	May 3, 2026, 3:48 p.m.
NER	Named-entity recognition	`batch_69f7b362f24c8190a325f0a12cc4c692`	completed	May 3, 2026, 8:43 p.m.
NED1	Entity disambiguation (via context triple)	`batch_6a393407e50c81908b993240bd023ecf`	completed	June 22, 2026, 1:09 p.m.
NEDg	Description generation	`batch_6a393537daf08190824d48b9ee6e19f8`	completed	June 22, 2026, 1:14 p.m.
NED2	Entity disambiguation (via description)	`batch_6a39359f2e1c8190b7e5dbf5447f25ee`	completed	June 22, 2026, 1:16 p.m.

Created at: May 3, 2026, 4:08 p.m.