Triple
T1383073
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Emmy Noether Lecture |
E29381
|
entity |
| Predicate | hasNotableLecturer |
P21690
|
FINISHED |
| Object |
Noga Alon
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
|
E157415
|
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: Noga Alon | Statement: [Emmy Noether Lecture, hasNotableLecturer, Noga Alon]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Noga Alon Context triple: [Emmy Noether Lecture, hasNotableLecturer, Noga Alon]
-
A.
Ehud Kalai
Ehud Kalai is an Israeli-American game theorist and economist known for his influential contributions to bargaining theory, game theory, and economic theory.
-
B.
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.
-
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.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
E.
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.
- 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: Noga Alon Triple: [Emmy Noether Lecture, hasNotableLecturer, Noga Alon]
Generated description
Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Noga Alon Target entity description: Noga Alon is an Israeli mathematician renowned for his influential work in combinatorics, graph theory, and theoretical computer science.
-
A.
Ehud Kalai
Ehud Kalai is an Israeli-American game theorist and economist known for his influential contributions to bargaining theory, game theory, and economic theory.
-
B.
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.
-
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.
Avi Wigderson
Avi Wigderson is a prominent Israeli-American computer scientist renowned for his foundational contributions to computational complexity theory and for receiving the Turing Award.
-
E.
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.
- 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_69a498d883a48190bfdca525296ef7ee |
completed | March 1, 2026, 7:51 p.m. |
| NER | Named-entity recognition | batch_69a4c48ff58c8190aeaf09d3e7cad7c7 |
completed | March 1, 2026, 10:58 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69acd48c41f4819092f7e1302d803662 |
completed | March 8, 2026, 1:44 a.m. |
| NEDg | Description generation | batch_69acd543a0ac8190b9fd5e921b5ad9ea |
completed | March 8, 2026, 1:47 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69acd5b8fa2481908fd52d94e55b6377 |
completed | March 8, 2026, 1:49 a.m. |
Created at: March 1, 2026, 7:59 p.m.