Triple
T22791004
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ellsberg paradox |
E564108
|
entity |
| Predicate | challenges |
P3648
|
FINISHED |
| Object | Savage axioms |
—
|
NE NERFINISHED |
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: Savage axioms | Statement: [Ellsberg paradox, challenges, Savage axioms]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Savage axioms Context triple: [Ellsberg paradox, challenges, Savage axioms]
-
A.
Savage axioms
chosen
Savage axioms are a set of rationality principles in decision theory that characterize how a rational agent should make choices under uncertainty, forming the foundation of subjective expected utility theory.
-
B.
Blum axioms
Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
-
C.
Axioma
Axioma is a financial technology company known for providing advanced portfolio risk management, analytics, and optimization solutions to institutional investors.
-
D.
Tarski’s fixed point theorem
Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
-
E.
Faddeev’s axioms
Faddeev’s axioms are a set of conditions characterizing Shannon entropy in information theory, providing an alternative but equivalent axiomatization to the Shannon–Khinchin framework.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69e2455500788190b4b33030461f3bbd |
completed | April 17, 2026, 2:36 p.m. |
| NER | Named-entity recognition | batch_69f17c3545fc819084af67cc25e94839 |
completed | April 29, 2026, 3:34 a.m. |
Created at: April 17, 2026, 3:29 p.m.