Triple
T5458421
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Foundations of Cryptography, Volume 2: Basic Applications |
E122535
|
entity |
| Predicate | author |
P4
|
FINISHED |
| Object | Oded Goldreich |
E21871
|
NE FINISHED |
How this triple was built (2 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: Oded Goldreich | Statement: [Foundations of Cryptography, Volume 2: Basic Applications, author, Oded Goldreich]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Oded Goldreich Context triple: [Foundations of Cryptography, Volume 2: Basic Applications, author, Oded Goldreich]
-
A.
Oded Goldreich
chosen
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
B.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to cryptography and computational complexity theory.
-
C.
Boaz Barak
Boaz Barak is a prominent theoretical computer scientist known for his influential work in cryptography and computational complexity theory.
-
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.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69bd46424248819085282ddf50a565f3 |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd91f1cca48190afa15b8ccfea1f88 |
completed | March 20, 2026, 6:29 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bf6c63cb6481908ea46a836a3804fe |
completed | March 22, 2026, 4:13 a.m. |
Created at: March 20, 2026, 2:08 p.m.