Triple
T8083748
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Borda count |
E188679
|
entity |
| Predicate | alsoKnownAs |
P39
|
FINISHED |
| Object | Borda rule |
E188679
|
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: Borda rule | Statement: [Borda count, alsoKnownAs, Borda rule]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borda rule Context triple: [Borda count, alsoKnownAs, Borda rule]
-
A.
Borda count
chosen
The Borda count is a ranked voting method in which voters order candidates and points are assigned based on position in each ranking, with the candidate having the highest total score winning.
-
B.
Condorcet paradox
The Condorcet paradox is a voting theory phenomenon where collective preferences can become cyclic and inconsistent, even when individual voters’ preferences are perfectly rational and transitive.
-
C.
Sainte-Laguë method
The Sainte-Laguë method is a highest-averages system of party-list proportional representation that allocates seats more evenly between large and small parties than the d’Hondt method.
-
D.
d’Hondt method
The d’Hondt method is a highest-averages formula used in proportional representation systems to allocate seats or posts among parties based on their share of the vote.
-
E.
Gibbard–Satterthwaite theorem
The Gibbard–Satterthwaite theorem is a fundamental result in social choice theory showing that every reasonable voting system with at least three options is susceptible to strategic manipulation by voters.
- 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_69ca82b662e88190b9323daab8c28a21 |
completed | March 30, 2026, 2:03 p.m. |
| NER | Named-entity recognition | batch_69cb415e61ac81909e924aea69a7ff77 |
completed | March 31, 2026, 3:37 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cc63ff37a88190a980e023a9b7c30c |
completed | April 1, 2026, 12:17 a.m. |
Created at: March 30, 2026, 5:29 p.m.