Triple
T4087566
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Rafail Ostrovsky |
E87623
|
entity |
| Predicate | notableStudent |
P4838
|
FINISHED |
| Object |
Eyal Kushilevitz
Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
|
E414312
|
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: Eyal Kushilevitz | Statement: [Rafail Ostrovsky, notableStudent, Eyal Kushilevitz]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Eyal Kushilevitz Context triple: [Rafail Ostrovsky, notableStudent, Eyal Kushilevitz]
-
A.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
B.
Moni Naor
Moni Naor is an Israeli computer scientist renowned for his foundational contributions to cryptography and theoretical computer science.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
E.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity 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: Eyal Kushilevitz Triple: [Rafail Ostrovsky, notableStudent, Eyal Kushilevitz]
Generated description
Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Eyal Kushilevitz Target entity description: Eyal Kushilevitz is an Israeli computer scientist known for his influential work in cryptography, communication complexity, and theoretical computer science.
-
A.
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
B.
Moni Naor
Moni Naor is an Israeli computer scientist renowned for his foundational contributions to cryptography and theoretical computer science.
-
C.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
D.
Omer Reingold
Omer Reingold is a prominent theoretical computer scientist known for his influential work in computational complexity and cryptography, including a landmark log-space algorithm for undirected graph connectivity.
-
E.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity 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_69aed94425148190be337845d56fac22 |
completed | March 9, 2026, 2:29 p.m. |
| NER | Named-entity recognition | batch_69aefca899008190b5ada98bdb79639f |
completed | March 9, 2026, 5 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5769e8b188190a6356c325d0551ea |
completed | March 14, 2026, 2:54 p.m. |
| NEDg | Description generation | batch_69b5773ed3388190a299558ea2d889a6 |
completed | March 14, 2026, 2:57 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b578003dd48190b9264fd834cffbdf |
completed | March 14, 2026, 3 p.m. |
Created at: March 9, 2026, 3:39 p.m.