Triple
T17797375
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gordon Tullock |
E444327
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Tullock paradox |
—
|
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: Tullock paradox | Statement: [Gordon Tullock, knownFor, Tullock paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Tullock paradox Context triple: [Gordon Tullock, knownFor, Tullock paradox]
-
A.
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.
-
B.
Sen’s liberal paradox
Sen’s liberal paradox is a result in social choice theory showing that even minimal individual rights can be incompatible with always achieving Pareto-efficient collective decisions.
-
C.
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.
-
D.
Condorcet jury theorem
The Condorcet jury theorem is a result in probability theory and social choice stating that, under certain conditions, the likelihood that a majority vote yields the correct decision increases as the size of the voting group grows.
-
E.
Law of the Maximum
The Law of the Maximum was a French Revolutionary price-control measure that fixed maximum prices on essential goods to curb inflation and protect the urban poor.
- 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: Tullock paradox Target entity description: The Tullock paradox is an economic puzzle highlighting why real-world spending on rent-seeking and political lobbying is often far lower than the huge potential gains at stake would predict.
-
A.
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.
-
B.
Sen’s liberal paradox
Sen’s liberal paradox is a result in social choice theory showing that even minimal individual rights can be incompatible with always achieving Pareto-efficient collective decisions.
-
C.
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.
-
D.
Condorcet jury theorem
The Condorcet jury theorem is a result in probability theory and social choice stating that, under certain conditions, the likelihood that a majority vote yields the correct decision increases as the size of the voting group grows.
-
E.
Law of the Maximum
The Law of the Maximum was a French Revolutionary price-control measure that fixed maximum prices on essential goods to curb inflation and protect the urban poor.
- 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_69d8b9efe370819095cd219b143ae727 |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e487fbc83481909a30fc7203b64099 |
completed | April 19, 2026, 7:44 a.m. |
Created at: April 10, 2026, 10:13 a.m.