Triple

T19559149
Position Surface form Disambiguated ID Type / Status
Subject John C. Reynolds E489395 entity
Predicate notableWork P4 FINISHED
Object “Separation Logic: A Logic for Shared Mutable Data Structures” — 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: “Separation Logic: A Logic for Shared Mutable Data Structures” | Statement: [John C. Reynolds, notableWork, “Separation Logic: A Logic for Shared Mutable Data Structures”]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: “Separation Logic: A Logic for Shared Mutable Data Structures”
Context triple: [John C. Reynolds, notableWork, “Separation Logic: A Logic for Shared Mutable Data Structures”]
  • A. Hoare logic
    Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • B. Dijkstra weakest precondition calculus
    Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
  • C. “Linear Types Can Change the World!”
    “Linear Types Can Change the World!” is a seminal research paper in programming languages that advocates for the use of linear type systems to improve resource management, safety, and efficiency in software.
  • D. The Temporal Logic of Programs
    The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
  • E. TLA+ proof system
    The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
  • 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: “Separation Logic: A Logic for Shared Mutable Data Structures”
Target entity description: “Separation Logic: A Logic for Shared Mutable Data Structures” is a seminal paper that introduced separation logic, a formal system for reasoning locally and modularly about programs that manipulate shared, mutable memory.
  • A. Hoare logic
    Hoare logic is a formal system in computer science used to reason rigorously about the correctness of computer programs using logical assertions about program states.
  • B. Dijkstra weakest precondition calculus
    Dijkstra weakest precondition calculus is a formal method for reasoning about program correctness by computing the weakest conditions that must hold before execution to guarantee a desired postcondition.
  • C. “Linear Types Can Change the World!”
    “Linear Types Can Change the World!” is a seminal research paper in programming languages that advocates for the use of linear type systems to improve resource management, safety, and efficiency in software.
  • D. The Temporal Logic of Programs
    The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
  • E. TLA+ proof system
    The TLA+ proof system is a formal verification framework that allows users to mechanically check the correctness of TLA+ specifications using machine-checked logical proofs.
  • 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_69d8e8dc5d8c8190a6d7bd8864f43ca0 completed April 10, 2026, 12:11 p.m.
NER Named-entity recognition batch_69e63f723d5081909553a4363b579a6b completed April 20, 2026, 3 p.m.
Created at: April 10, 2026, 1:42 p.m.