Triple
T3757268
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | George Szekeres |
E82077
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Erdős–Szekeres theorem
The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
|
E386031
|
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: Erdős–Szekeres theorem | Statement: [George Szekeres, notableWork, Erdős–Szekeres theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Erdős–Szekeres theorem Context triple: [George Szekeres, notableWork, Erdős–Szekeres theorem]
-
A.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
-
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.
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.
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
-
E.
Conway circle theorem
The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
- 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: Erdős–Szekeres theorem Triple: [George Szekeres, notableWork, Erdős–Szekeres theorem]
Generated description
The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Erdős–Szekeres theorem Target entity description: The Erdős–Szekeres theorem is a fundamental result in combinatorial geometry that guarantees the existence of large convex polygons within sufficiently large sets of points in the plane in general position.
-
A.
de Bruijn–Erdős theorem
The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.
-
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.
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.
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
-
E.
Conway circle theorem
The Conway circle theorem is a geometric result in triangle geometry that identifies a special circle associated with a triangle and certain constructed points, revealing notable collinearities and concyclicity relationships.
- 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_69ad8b1db40081908b61ffa6b78afd4d |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69adcbbe7a6081909b0f835a77941300 |
completed | March 8, 2026, 7:19 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b4e50bfdb0819097bdfdd38f553ada |
completed | March 14, 2026, 4:33 a.m. |
| NEDg | Description generation | batch_69b4e6c7164881909f14bf5b57916ae3 |
completed | March 14, 2026, 4:40 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b4e74df9b481909d5286c64ae6d91a |
completed | March 14, 2026, 4:42 a.m. |
Created at: March 8, 2026, 3:35 p.m.