Triple
T5114208
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Arrow’s impossibility theorem |
E115290
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Condorcet paradox |
E278103
|
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: Condorcet paradox | Statement: [Arrow’s impossibility theorem, relatedTo, Condorcet paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Condorcet paradox Context triple: [Arrow’s impossibility theorem, relatedTo, Condorcet paradox]
-
A.
Condorcet paradox
chosen
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.
-
B.
Arrow’s impossibility theorem
Arrow’s impossibility theorem is a foundational result in social choice theory showing that no voting system can convert individual preferences into a collective ranking while simultaneously satisfying a set of seemingly reasonable fairness criteria.
-
C.
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.
-
D.
Arrow paradox
The Arrow paradox is an ancient philosophical argument that challenges the coherence of motion by claiming that a flying arrow must be motionless at every instant of its flight.
-
E.
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.
- 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_69bd4441d1648190a54a533895041987 |
completed | March 20, 2026, 12:57 p.m. |
| NER | Named-entity recognition | batch_69bd75cd13a08190b53e67ba65333557 |
completed | March 20, 2026, 4:29 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bec3758bb4819082d5876c4dc9df8d |
completed | March 21, 2026, 4:12 p.m. |
Created at: March 20, 2026, 1:41 p.m.