Triple
T5642182
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Inapproximability results for SAT and other problems |
E124291
|
entity |
| Predicate | author |
P4
|
FINISHED |
| Object | Johan Håstad |
E22525
|
NE FINISHED |
How this triple was built (2 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: Johan Håstad | Statement: [Inapproximability results for SAT and other problems, author, Johan Håstad]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Johan Håstad Context triple: [Inapproximability results for SAT and other problems, author, Johan Håstad]
-
A.
Johan Håstad
chosen
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.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
D.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
E.
Juris Hartmanis
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69c00824643c81909ffdb888a2d35189 |
completed | March 22, 2026, 3:17 p.m. |
| NER | Named-entity recognition | batch_69c022a6a22881908d16f4df564ed2a2 |
completed | March 22, 2026, 5:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c04d7c98008190b79528596eca4208 |
completed | March 22, 2026, 8:13 p.m. |
Created at: March 22, 2026, 3:41 p.m.