Triple
T677236
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Albert W. Tucker |
E13103
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Tucker’s lemma |
E83404
|
NE FINISHED |
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: Tucker’s lemma | Statement: [Albert W. Tucker, notableWork, Tucker’s lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Tucker’s lemma Context triple: [Albert W. Tucker, notableWork, Tucker’s lemma]
-
A.
Tucker’s lemma
chosen
Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
-
B.
Brouwer fixed-point theorem
The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
-
C.
Glicksberg fixed-point theorem
The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
-
D.
Kakutani fixed-point theorem
The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
-
E.
Euler’s polyhedron formula
Euler’s polyhedron formula is a fundamental result in topology and geometry that relates the numbers of vertices, edges, and faces of a convex polyhedron through the equation V − E + F = 2.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69a4933d3bf88190972041cd8cf143b9 |
completed | March 1, 2026, 7:27 p.m. |
| NER | Named-entity recognition | batch_69a4a04c89148190b6330e86697bb37b |
completed | March 1, 2026, 8:23 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a5dc9f5f7c8190a766c6b545d1abd8 |
completed | March 2, 2026, 6:53 p.m. |
Created at: March 1, 2026, 7:36 p.m.