Triple
T143819
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Shafi Goldwasser |
E2908
|
entity |
| Predicate | coAuthor |
P398
|
FINISHED |
| Object |
Johan Håstad
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
|
E22525
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a2521e35c08190b28e5c9f1e3c9b59 |
elicitation | completed |
| NER | batch_69a257caf678819092e975d5167f9df4 |
ner | completed |
| NED1 | batch_69a2f0b399d0819088332903146ddf94 |
ned_source_triple | completed |
| NED2 | batch_69a2f1cf22f48190a7cc60661a61db4a |
ned_description | completed |
| NEDg | batch_69a2f1617d1881908010a173098ad8a8 |
nedg | completed |
Created at: Feb. 28, 2026, 2:31 a.m.