Triple
T14661237
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Francistown Airport |
E344243
|
entity |
| Predicate | ICAOcode |
P419
|
FINISHED |
| Object |
FBFT
FBFT is the ICAO airport code assigned to Francistown Airport in Botswana.
|
E1112393
|
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: FBFT | Statement: [Francistown Airport, ICAOcode, FBFT]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: FBFT Context triple: [Francistown Airport, ICAOcode, FBFT]
-
A.
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.
-
B.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
C.
Practical Byzantine Fault Tolerance
Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
-
D.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
-
E.
"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.
- 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: FBFT Triple: [Francistown Airport, ICAOcode, FBFT]
Generated description
FBFT is the ICAO airport code assigned to Francistown Airport in Botswana.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: FBFT Target entity description: FBFT is the ICAO airport code assigned to Francistown Airport in Botswana.
-
A.
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.
-
B.
Paxos
Paxos is a small Greek island in the Ionian Sea, known for its clear turquoise waters, olive groves, and tranquil, less-touristed atmosphere.
-
C.
Practical Byzantine Fault Tolerance
Practical Byzantine Fault Tolerance is a consensus algorithm for distributed systems that efficiently tolerates Byzantine (arbitrary) faults, enabling reliable operation even when some nodes behave maliciously or unpredictably.
-
D.
Paxos consensus algorithm
The Paxos consensus algorithm is a fault-tolerant protocol for achieving agreement among distributed systems, widely used as a foundation for reliable, replicated state machines and modern distributed databases.
-
E.
"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.
- 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_69d822e283fc8190a0e4c235cf880052 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69deb51c84448190a1f5fa9ab8a1e2c4 |
completed | April 14, 2026, 9:43 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fdd5e28f848190a3d686bc11336601 |
completed | May 8, 2026, 12:24 p.m. |
| NEDg | Description generation | batch_69fdd65a6c24819088fb18ffcdfe6404 |
completed | May 8, 2026, 12:26 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69fdd6f172288190ba7097518b1a971e |
completed | May 8, 2026, 12:28 p.m. |
Created at: April 10, 2026, 1:27 a.m.