Triple
T1043664
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Johan Håstad |
E22525
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | “Some optimal inapproximability results” |
E17354
|
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: “Some optimal inapproximability results” | Statement: [Johan Håstad, notableWork, “Some optimal inapproximability results”]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: “Some optimal inapproximability results” Context triple: [Johan Håstad, notableWork, “Some optimal inapproximability results”]
-
A.
Interactive Proofs and the Hardness of Approximating Cliques
chosen
"Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
-
B.
PCP theorem
The PCP theorem is a fundamental result in computational complexity theory stating that every problem in NP has probabilistically checkable proofs that can be verified by examining only a constant number of bits, with major implications for the hardness of approximation.
-
C.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
-
D.
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing
Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing is a 1985 ACM conference volume collecting influential research papers in theoretical computer science, including foundational work on topics such as interactive proof systems and computational complexity.
-
E.
The Knowledge Complexity of Interactive Proof Systems
"The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
- 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_69a493d91478819094cc01fb65564bc1 |
completed | March 1, 2026, 7:30 p.m. |
| NER | Named-entity recognition | batch_69a4b8475ab48190848388eea6448cb6 |
completed | March 1, 2026, 10:05 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac3bc97dec81909b6ad48e3f203923 |
completed | March 7, 2026, 2:52 p.m. |
Created at: March 1, 2026, 7:42 p.m.