Triple
T6710767
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Gale |
E153133
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Gale transform
The Gale transform is a construction in convex geometry and combinatorics that represents a finite point configuration or polytope in a dual space, often used to study their structural and combinatorial properties.
|
E612749
|
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 transform | Statement: [David Gale, notableWork, Gale transform]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gale transform Context triple: [David Gale, notableWork, Gale transform]
-
A.
Gauss map
The Gauss map is a differential geometry concept that assigns to each point on a surface the corresponding point on the unit sphere determined by the surface’s normal vector at that point.
-
B.
Plücker coordinates
Plücker coordinates are a system of homogeneous coordinates used in projective geometry to represent lines (and other subspaces) in higher-dimensional spaces.
-
C.
Tucker’s lemma
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.
-
D.
Sylvester–Gallai theorem
The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.
-
E.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
- 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 transform Triple: [David Gale, notableWork, Gale transform]
Generated description
The Gale transform is a construction in convex geometry and combinatorics that represents a finite point configuration or polytope in a dual space, often used to study their structural and combinatorial properties.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Gale transform Target entity description: The Gale transform is a construction in convex geometry and combinatorics that represents a finite point configuration or polytope in a dual space, often used to study their structural and combinatorial properties.
-
A.
Gauss map
The Gauss map is a differential geometry concept that assigns to each point on a surface the corresponding point on the unit sphere determined by the surface’s normal vector at that point.
-
B.
Plücker coordinates
Plücker coordinates are a system of homogeneous coordinates used in projective geometry to represent lines (and other subspaces) in higher-dimensional spaces.
-
C.
Tucker’s lemma
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.
-
D.
Sylvester–Gallai theorem
The Sylvester–Gallai theorem is a result in incidence geometry stating that for any finite set of points in the Euclidean plane not all on a single line, there exists a line that passes through exactly two of the points.
-
E.
Szekeres configuration
The Szekeres configuration is a notable geometric arrangement in projective geometry consisting of points and lines with specific incidence properties, studied for its combinatorial and symmetry characteristics.
- 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.