Triple
T20364043
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | social choice theory |
E496859
|
entity |
| Predicate | hasKeyConcept |
P533
|
FINISHED |
| Object | Condorcet method |
—
|
NE NERFINISHED |
How this triple was built (3 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: Condorcet method | Statement: [social choice theory, hasKeyConcept, Condorcet method]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Condorcet method Context triple: [social choice theory, hasKeyConcept, Condorcet method]
-
A.
Borda count
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 criterion
The Condorcet criterion is a voting system standard requiring that if a candidate would win every head-to-head contest against each other candidate, that candidate must be the overall election winner.
-
C.
Kemeny–Young method
The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
-
D.
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.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Condorcet method Target entity description: The Condorcet method is a family of voting systems in which the winner is the candidate who would defeat every other candidate in head-to-head majority contests.
-
A.
Borda count
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 criterion
The Condorcet criterion is a voting system standard requiring that if a candidate would win every head-to-head contest against each other candidate, that candidate must be the overall election winner.
-
C.
Kemeny–Young method
The Kemeny–Young method is a voting system that ranks candidates by finding the ordering that best reflects voters’ pairwise preferences, minimizing overall disagreement.
-
D.
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.
-
E.
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.
- F. None of above. chosen
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_69e0b4a4f9b081908a5a021919c21ccb |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e6786fd0088190908187ab642344cc |
completed | April 20, 2026, 7:03 p.m. |
Created at: April 16, 2026, 11:26 a.m.