Triple
T3910485
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Harold W. Kuhn |
E87307
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Kuhn’s theorem
Kuhn’s theorem is a fundamental result in game theory that shows any finite extensive-form game with perfect recall has an equivalent normal-form (strategic-form) representation, ensuring the existence of mixed-strategy equilibria.
|
E398341
|
NE FINISHED |
How this triple was built (4 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: Kuhn’s theorem | Statement: [Harold W. Kuhn, notableConcept, Kuhn’s theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kuhn’s theorem Context triple: [Harold W. Kuhn, notableConcept, Kuhn’s theorem]
-
A.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
B.
expected utility theory (with John von Neumann)
Expected utility theory (with John von Neumann) is a foundational framework in economics and decision theory that models how rational agents make choices under uncertainty by maximizing the expected value of a utility function.
-
C.
Nash bargaining solution
The Nash bargaining solution is a foundational concept in game theory that defines a fair and efficient outcome for two-party bargaining problems based on axioms of rationality and symmetry.
-
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.
Kalai–Smorodinsky bargaining solution
The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Kuhn’s theorem Triple: [Harold W. Kuhn, notableConcept, Kuhn’s theorem]
Generated description
Kuhn’s theorem is a fundamental result in game theory that shows any finite extensive-form game with perfect recall has an equivalent normal-form (strategic-form) representation, ensuring the existence of mixed-strategy equilibria.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kuhn’s theorem Target entity description: Kuhn’s theorem is a fundamental result in game theory that shows any finite extensive-form game with perfect recall has an equivalent normal-form (strategic-form) representation, ensuring the existence of mixed-strategy equilibria.
-
A.
Szekeres–Lindström theorem
The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
-
B.
expected utility theory (with John von Neumann)
Expected utility theory (with John von Neumann) is a foundational framework in economics and decision theory that models how rational agents make choices under uncertainty by maximizing the expected value of a utility function.
-
C.
Nash bargaining solution
The Nash bargaining solution is a foundational concept in game theory that defines a fair and efficient outcome for two-party bargaining problems based on axioms of rationality and symmetry.
-
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.
Kalai–Smorodinsky bargaining solution
The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
- F. None of above. chosen
Provenance (5 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_69aed9424514819086e9c58adde6652d |
completed | March 9, 2026, 2:29 p.m. |
| NER | Named-entity recognition | batch_69aeed3408f881908c3cffc5dbfe3950 |
completed | March 9, 2026, 3:54 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b51cb454c48190bf47d080f6cc24f0 |
completed | March 14, 2026, 8:30 a.m. |
| NEDg | Description generation | batch_69b5206dfd848190ae7aaa9997150934 |
completed | March 14, 2026, 8:46 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b520ce6af481909b7824c2ec221331 |
completed | March 14, 2026, 8:48 a.m. |
Created at: March 9, 2026, 3:22 p.m.