Triple
T20836630
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Miklós Ajtai |
E512974
|
entity |
| Predicate | coAuthor |
P398
|
FINISHED |
| Object |
Gábor Tardos
Gábor Tardos is a Hungarian mathematician and computer scientist known for his contributions to combinatorics and theoretical computer science.
|
E1452096
|
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: Gábor Tardos | Statement: [Miklós Ajtai, coAuthor, Gábor Tardos]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gábor Tardos Context triple: [Miklós Ajtai, coAuthor, Gábor Tardos]
-
A.
Éva Tardos
Éva Tardos is a prominent Hungarian-American computer scientist known for her influential work in algorithms, combinatorial optimization, and algorithmic game theory.
-
B.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
C.
László Lovász
László Lovász is a Hungarian mathematician renowned for his fundamental contributions to combinatorics, graph theory, and theoretical computer science, including work on the Lovász Local Lemma and the proof of the weak perfect graph conjecture.
-
D.
László Babai
László Babai is a Hungarian mathematician and theoretical computer scientist renowned for his pioneering work in group theory, complexity theory, and interactive proof systems.
-
E.
Béla Bollobás
Béla Bollobás is a Hungarian-born British mathematician renowned for his influential work in combinatorics, graph theory, and discrete mathematics.
- 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: Gábor Tardos Triple: [Miklós Ajtai, coAuthor, Gábor Tardos]
Generated description
Gábor Tardos is a Hungarian mathematician and computer scientist known for his contributions to combinatorics and theoretical computer science.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Gábor Tardos Target entity description: Gábor Tardos is a Hungarian mathematician and computer scientist known for his contributions to combinatorics and theoretical computer science.
-
A.
Éva Tardos
Éva Tardos is a prominent Hungarian-American computer scientist known for her influential work in algorithms, combinatorial optimization, and algorithmic game theory.
-
B.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
C.
László Lovász
László Lovász is a Hungarian mathematician renowned for his fundamental contributions to combinatorics, graph theory, and theoretical computer science, including work on the Lovász Local Lemma and the proof of the weak perfect graph conjecture.
-
D.
László Babai
László Babai is a Hungarian mathematician and theoretical computer scientist renowned for his pioneering work in group theory, complexity theory, and interactive proof systems.
-
E.
Béla Bollobás
Béla Bollobás is a Hungarian-born British mathematician renowned for his influential work in combinatorics, graph theory, and discrete mathematics.
- 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_69e0b4cf62a88190bbf92351e9e57259 |
completed | April 16, 2026, 10:07 a.m. |
| NER | Named-entity recognition | batch_69e6c326daec8190bd4caa41a4b38833 |
completed | April 21, 2026, 12:21 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a090084a1c481909a344ee40d846b10 |
completed | May 16, 2026, 11:40 p.m. |
| NEDg | Description generation | batch_6a0900fd590c8190b42faa5c5191189a |
completed | May 16, 2026, 11:42 p.m. |
| NED2 | Entity disambiguation (via description) | batch_6a0901950c1c8190befa72dc20236b9e |
completed | May 16, 2026, 11:45 p.m. |
Created at: April 16, 2026, 12:42 p.m.