Triple
T5896708
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Pál Erdős |
E131117
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Erdős distinct distances problem
The Erdős distinct distances problem is a famous question in combinatorial geometry that asks for the minimum number of distinct distances determined by a given number of points in the plane.
|
E554301
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c00857439c819095950754176aa58a |
elicitation | completed |
| NER | batch_69c036f4b56c8190aa52c9460eae8fbe |
ner | completed |
| NED1 | batch_69c0b159cb908190b78b78d1e854212b |
ned_source_triple | completed |
| NED2 | batch_69c0b608a10881908c9bca7d09a99b05 |
ned_description | completed |
| NEDg | batch_69c0b22d661c8190a055abd3ca6fa92f |
nedg | completed |
Created at: March 22, 2026, 3:58 p.m.