Triple
T17677584
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Joe Armstrong |
E440677
|
entity |
| Predicate | thesisTitle |
P1860
|
FINISHED |
| Object | Making reliable distributed systems in the presence of software errors |
—
|
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: Making reliable distributed systems in the presence of software errors | Statement: [Joe Armstrong, thesisTitle, Making reliable distributed systems in the presence of software errors]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Making reliable distributed systems in the presence of software errors Context triple: [Joe Armstrong, thesisTitle, Making reliable distributed systems in the presence of software errors]
-
A.
Making reliable distributed systems in the presence of software errors
chosen
"Making reliable distributed systems in the presence of software errors" is a foundational PhD thesis by Joe Armstrong that presents the principles behind Erlang and its approach to building fault-tolerant distributed systems.
-
B.
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.
-
C.
"Guardians and Actions: Linguistic Support for Robust, Distributed Programs"
"Guardians and Actions: Linguistic Support for Robust, Distributed Programs" is a foundational research paper that introduces language constructs for building fault-tolerant, distributed systems, notably influencing the design of the Argus programming language.
-
D.
"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.
-
E.
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.
- 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_69d8b9e940b081908b862bb0e6e89b0d |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e46f6e959c819092d9d33e79bd51f7 |
completed | April 19, 2026, 6 a.m. |
Created at: April 10, 2026, 10:01 a.m.