Triple

T14981620
Position Surface form Disambiguated ID Type / Status
Subject Matt Kaufmann E373588 entity
Predicate coauthorOf P2389 FINISHED
Object "Computer-Aided Reasoning: An Approach" E1130850 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: "Computer-Aided Reasoning: An Approach" | Statement: [Matt Kaufmann, coauthorOf, "Computer-Aided Reasoning: An Approach"]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: "Computer-Aided Reasoning: An Approach"
Context triple: [Matt Kaufmann, coauthorOf, "Computer-Aided Reasoning: An Approach"]
  • A. "Computer-Aided Reasoning: An Approach" chosen
    "Computer-Aided Reasoning: An Approach" is a foundational book on automated and interactive theorem proving that presents methods and tools for using computers to assist in formal reasoning and proof development.
  • B. Handbook of Automated Reasoning
    The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
  • C. Journal of Automated Reasoning
    The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
  • D. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
    "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
  • E. "The Complexity of Theorem-Proving Procedures"
    "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper 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.
  • 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_69d85ccbbcd48190acb56e7cf104d8ad completed April 10, 2026, 2:13 a.m.
NER Named-entity recognition batch_69ded6fe42a081909308f788fdf024d5 completed April 15, 2026, 12:08 a.m.
NED1 Entity disambiguation (via context triple) batch_69fe9694aa688190bbecb645c49e795e completed May 9, 2026, 2:06 a.m.
Created at: April 10, 2026, 2:52 a.m.