Triple
T13035724
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Monge problem in optimal transport |
E326555
|
entity |
| Predicate | contrastedWith |
P278
|
FINISHED |
| Object |
Kantorovich problem in optimal transport
The Kantorovich problem in optimal transport is a relaxed, linear-programming formulation of transporting mass between probability distributions that allows splitting mass and guarantees existence of optimal transport plans.
|
E1020368
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d8076cc45c81908123123f43e69266 |
elicitation | completed |
| NER | batch_69d97f2a71a0819098bb6cf8a4b2208a |
ner | completed |
| NED1 | batch_69f6d5fa10fc81908a37b85894f8f849 |
ned_source_triple | completed |
| NED2 | batch_69f6dbec7e808190a7cee821ba193bb8 |
ned_description | completed |
| NEDg | batch_69f6db65879c819092387e028b792ab9 |
nedg | completed |
Created at: April 9, 2026, 8:55 p.m.