Triple
T3757267
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | George Szekeres |
E82077
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E386030
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ad8b1db40081908b61ffa6b78afd4d |
elicitation | completed |
| NER | batch_69adcbbe7a6081909b0f835a77941300 |
ner | completed |
| NED1 | batch_69b4e50bfdb0819097bdfdd38f553ada |
ned_source_triple | completed |
| NED2 | batch_69b4e74df9b481909d5286c64ae6d91a |
ned_description | completed |
| NEDg | batch_69b4e6c7164881909f14bf5b57916ae3 |
nedg | completed |
Created at: March 8, 2026, 3:35 p.m.