Triple
T6710763
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Gale |
E153133
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Shapley–Gale theorem
The Shapley–Gale theorem is a foundational result in cooperative game theory that characterizes stable outcomes in assignment and matching problems, underpinning much of modern market design and matching theory.
|
E612745
|
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: Shapley–Gale theorem | Statement: [David Gale, notableWork, Shapley–Gale theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shapley–Gale theorem Context triple: [David Gale, notableWork, Shapley–Gale theorem]
-
A.
Sperner's lemma
Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
-
B.
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.
-
C.
Erdős–Gallai theorem
The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
-
D.
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.
-
E.
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.
- 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: Shapley–Gale theorem Triple: [David Gale, notableWork, Shapley–Gale theorem]
Generated description
The Shapley–Gale theorem is a foundational result in cooperative game theory that characterizes stable outcomes in assignment and matching problems, underpinning much of modern market design and matching theory.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Shapley–Gale theorem Target entity description: The Shapley–Gale theorem is a foundational result in cooperative game theory that characterizes stable outcomes in assignment and matching problems, underpinning much of modern market design and matching theory.
-
A.
Sperner's lemma
Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
-
B.
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.
-
C.
Erdős–Gallai theorem
The Erdős–Gallai theorem is a fundamental result in graph theory that characterizes which sequences of nonnegative integers can occur as the degree sequences of simple graphs.
-
D.
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.
-
E.
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.
- 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_69c68808d8d8819087369015270788fe |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d107380481909cc761dc182834c1 |
completed | March 27, 2026, 6:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c700906a9c81908a121db4291195d8 |
completed | March 27, 2026, 10:11 p.m. |
| NEDg | Description generation | batch_69c701db4eb081908db6dd22fbfb28d1 |
completed | March 27, 2026, 10:16 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69c7026529ec81909479b826efb5eb54 |
completed | March 27, 2026, 10:19 p.m. |
Created at: March 27, 2026, 2:06 p.m.