Triple
T5335949
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | EATCS Award |
E123825
|
entity |
| Predicate | notableRecipient |
P108
|
FINISHED |
| Object |
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
|
E512974
|
NE FINISHED |
How this triple was built (4 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: Miklos Ajtai | Statement: [EATCS Award, notableRecipient, Miklos Ajtai]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Miklos Ajtai Context triple: [EATCS Award, notableRecipient, Miklos Ajtai]
-
A.
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.
-
B.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
C.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
D.
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.
-
E.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Miklos Ajtai Triple: [EATCS Award, notableRecipient, Miklos Ajtai]
Generated description
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Miklos Ajtai Target entity description: Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
A.
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.
-
B.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
C.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
D.
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.
-
E.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
- F. None of above. chosen
Provenance (5 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_69bd464b07f8819095aa76577c9829e4 |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd85af799081909ee60bfbb65149ee |
completed | March 20, 2026, 5:36 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf18be4bb88190a2b83e51716e677e |
completed | March 21, 2026, 10:16 p.m. |
| NEDg | Description generation | batch_69bf194c53a48190b0895bbe9aa2f6f1 |
completed | March 21, 2026, 10:18 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69bf1a198418819089b25102733f9191 |
completed | March 21, 2026, 10:22 p.m. |
Created at: March 20, 2026, 2 p.m.