Triple
T23371812
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | St. Petersburg paradox |
E593494
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object | finite-horizon St. Petersburg game |
—
|
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: finite-horizon St. Petersburg game | Statement: [St. Petersburg paradox, hasVariant, finite-horizon St. Petersburg game]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: finite-horizon St. Petersburg game Context triple: [St. Petersburg paradox, hasVariant, finite-horizon St. Petersburg game]
-
A.
Choquet game
The Choquet game is a topological infinite game between two players whose winning strategies characterize important properties of spaces, such as being a Choquet or Baire space.
-
B.
St. Petersburg paradox
chosen
The St. Petersburg paradox is a famous problem in probability theory and economics that highlights how a lottery with an infinite expected payoff can still attract only a finite price from rational gamblers, challenging traditional notions of expected value and decision-making under risk.
-
C.
Snell envelope
The Snell envelope is a stochastic process that represents the smallest supermartingale dominating a given process and is fundamental in optimal stopping theory and the valuation of American-style options.
-
D.
Kemeny–Snell finite Markov chain theory
Kemeny–Snell finite Markov chain theory is a foundational mathematical framework that rigorously develops the behavior and long-term properties of finite-state Markov chains, widely used in probability theory and stochastic processes.
-
E.
Games and Decisions
Games and Decisions is a foundational book in game theory and decision theory that systematically analyzes strategic behavior and rational choice under uncertainty.
- 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_69e25d2593c88190bcdf4a716a94ccb2 |
completed | April 17, 2026, 4:17 p.m. |
| NER | Named-entity recognition | batch_69f1a3af45ec8190a32aa4e5f04f6756 |
completed | April 29, 2026, 6:22 a.m. |
Created at: April 17, 2026, 5:32 p.m.