Triple

T19494844
Position Surface form Disambiguated ID Type / Status
Subject Paris C. Kanellakis E487741 entity
Predicate coAuthorOf P2389 FINISHED
Object Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
E1377986 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: Fault-Tolerant Parallel Computation | Statement: [Paris C. Kanellakis, coAuthorOf, Fault-Tolerant Parallel Computation]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Fault-Tolerant Parallel Computation
Context triple: [Paris C. Kanellakis, coAuthorOf, Fault-Tolerant Parallel Computation]
  • A. Elements of Distributed Algorithms
    Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
  • B. "Reaching Agreement in the Presence of Faults"
    "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
  • C. "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
    "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
  • D. BBN Butterfly parallel computer
    The BBN Butterfly parallel computer was an early massively parallel processing system notable for its scalable architecture and use in advanced research and defense applications in the 1980s.
  • 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: Fault-Tolerant Parallel Computation
Triple: [Paris C. Kanellakis, coAuthorOf, Fault-Tolerant Parallel Computation]
Generated description
Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Fault-Tolerant Parallel Computation
Target entity description: Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
  • A. Elements of Distributed Algorithms
    Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
  • B. "Reaching Agreement in the Presence of Faults"
    "Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
  • C. "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
    "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
  • D. BBN Butterfly parallel computer
    The BBN Butterfly parallel computer was an early massively parallel processing system notable for its scalable architecture and use in advanced research and defense applications in the 1980s.
  • 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_69d8e8d9d1c88190b01cd78b8be49384 completed April 10, 2026, 12:11 p.m.
NER Named-entity recognition batch_69e63490c16481908423e304d82722d7 completed April 20, 2026, 2:13 p.m.
NED1 Entity disambiguation (via context triple) batch_6a07405fbebc81909d939d528081b2c5 completed May 15, 2026, 3:48 p.m.
NEDg Description generation batch_6a07413800488190b15864c7ae43df12 completed May 15, 2026, 3:52 p.m.
NED2 Entity disambiguation (via description) batch_6a0741a5783081908e0434153351b4a3 completed May 15, 2026, 3:54 p.m.
Created at: April 10, 2026, 1:40 p.m.