Triple
T1762038
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Adi Shamir |
E38677
|
entity |
| Predicate | doctoralAdvisor |
P167
|
FINISHED |
| Object |
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
|
E199558
|
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: Michael Rabin | Statement: [Adi Shamir, doctoralAdvisor, Michael Rabin]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Michael Rabin Context triple: [Adi Shamir, doctoralAdvisor, Michael Rabin]
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
C.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
D.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
E.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
- 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: Michael Rabin Triple: [Adi Shamir, doctoralAdvisor, Michael Rabin]
Generated description
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Michael Rabin Target entity description: Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
C.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
D.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
E.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
- 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_69a8862d562481908d7025a1c1f67c0d |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69aa6463ac0081909e9ebe6ebf1db857 |
completed | March 6, 2026, 5:21 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ada98eb0348190a44e05393a2c6eff |
completed | March 8, 2026, 4:53 p.m. |
| NEDg | Description generation | batch_69adae9845f081908904030f7a10df63 |
completed | March 8, 2026, 5:15 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69adafa3494c8190b34a6930cf38ca40 |
completed | March 8, 2026, 5:19 p.m. |
Created at: March 4, 2026, 7:31 p.m.