Triple
T19112062
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | FLP impossibility result |
E467812
|
entity |
| Predicate | originalPaperTitle |
P6930
|
FINISHED |
| Object | Impossibility of Distributed Consensus with One Faulty Process |
—
|
NE NERFINISHED |
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: Impossibility of Distributed Consensus with One Faulty Process | Statement: [FLP impossibility result, originalPaperTitle, Impossibility of Distributed Consensus with One Faulty Process]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Impossibility of Distributed Consensus with One Faulty Process Context triple: [FLP impossibility result, originalPaperTitle, Impossibility of Distributed Consensus with One Faulty Process]
-
A.
"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.
-
B.
FLP impossibility result
chosen
The FLP impossibility result is a foundational theorem in distributed computing showing that in an asynchronous system, no deterministic consensus protocol can guarantee both safety and liveness in the presence of even a single crash failure.
-
C.
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.
-
D.
Byzantine fault tolerance
Byzantine fault tolerance is a property of distributed systems that enables them to continue operating correctly even when some components behave arbitrarily or maliciously.
-
E.
"Time, Clocks, and the Ordering of Events in a Distributed System"
"Time, Clocks, and the Ordering of Events in a Distributed System" is a seminal 1978 paper that introduced logical clocks and the happened-before relation, fundamentally shaping the theory and practice of distributed computing.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69d8dd06a26481908039e2a1bae8c597 |
completed | April 10, 2026, 11:20 a.m. |
| NER | Named-entity recognition | batch_69e5e394969c81909d09b2300ea0e041 |
completed | April 20, 2026, 8:28 a.m. |
Created at: April 10, 2026, 12:04 p.m.