Triple
T11214615
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | John C. Calhoun |
E265401
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | theory of concurrent majority |
E249280
|
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: theory of concurrent majority | Statement: [John C. Calhoun, notableWork, theory of concurrent majority]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: theory of concurrent majority Context triple: [John C. Calhoun, notableWork, theory of concurrent majority]
-
A.
concurrent majority theory
chosen
Concurrent majority theory is a political doctrine that holds that major decisions in a diverse society should require the consent of all significant interest groups or regions, effectively giving each a veto to protect minority interests against a simple numerical majority.
-
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.
FLP impossibility result
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.
-
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.
Verification of Concurrent Programs
"Verification of Concurrent Programs" is a foundational computer science text that presents formal methods and techniques for proving the correctness of programs that execute concurrently.
- 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_69d6aac59460819089b9848b27f57848 |
completed | April 8, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69d7e8e8eef48190932a85784ce15c86 |
completed | April 9, 2026, 5:59 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e49762e3188190ba3c0e01cf04f6a1 |
completed | April 19, 2026, 8:50 a.m. |
Created at: April 8, 2026, 9:30 p.m.