Triple
T6710762
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Gale |
E153133
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Gale–Shapley algorithm
The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.
|
E612744
|
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: Gale–Shapley algorithm | Statement: [David Gale, notableWork, Gale–Shapley algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gale–Shapley algorithm Context triple: [David Gale, notableWork, Gale–Shapley algorithm]
-
A.
Matchmakers
Matchmakers is a popular Ukrainian comedy television series produced by Kvartal 95 Studio that follows the humorous clashes and relationships between two very different families.
-
B.
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.
-
C.
Happy Ending problem
The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
-
D.
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.
-
E.
Eppstein
Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
- 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: Gale–Shapley algorithm Triple: [David Gale, notableWork, Gale–Shapley algorithm]
Generated description
The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Gale–Shapley algorithm Target entity description: The Gale–Shapley algorithm is a foundational procedure in mathematics and computer science that computes stable matchings between two equally sized sets, such as students and schools or men and women in the stable marriage problem.
-
A.
Matchmakers
Matchmakers is a popular Ukrainian comedy television series produced by Kvartal 95 Studio that follows the humorous clashes and relationships between two very different families.
-
B.
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.
-
C.
Happy Ending problem
The Happy Ending problem is a famous combinatorial geometry question that investigates the minimum number of points in general position in the plane needed to guarantee the existence of a convex polygon with a given number of vertices.
-
D.
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.
-
E.
Eppstein
Eppstein is a small historic town in the German state of Hesse, known for its medieval castle and scenic location in the Taunus mountains.
- 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.