Triple
T17683456
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | OCB authenticated-encryption mode |
E440827
|
entity |
| Predicate | wasDesignedBy |
P184
|
FINISHED |
| Object | Mihir Bellare |
E92132
|
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: Mihir Bellare | Statement: [OCB authenticated-encryption mode, wasDesignedBy, Mihir Bellare]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mihir Bellare Context triple: [OCB authenticated-encryption mode, wasDesignedBy, Mihir Bellare]
-
A.
Mihir Bellare
chosen
Mihir Bellare is a prominent computer scientist and cryptographer known for his foundational work in modern cryptographic theory and practice.
-
B.
Phillip Rogaway
Phillip Rogaway is a prominent cryptographer known for his influential work on the theory and practice of encryption and for advocating the ethical and social responsibilities of cryptography.
-
C.
Shafi Goldwasser
Shafi Goldwasser is an Israeli-American computer scientist renowned for her foundational contributions to 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.
Daniele Micciancio
Daniele Micciancio is a computer scientist known for his influential work in lattice-based cryptography and computational complexity.
- 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_69d8b9e940b081908b862bb0e6e89b0d |
completed | April 10, 2026, 8:50 a.m. |
| NER | Named-entity recognition | batch_69e4704626308190bbdd98d27beb3f24 |
completed | April 19, 2026, 6:03 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a0230189290819087d80b8c447bbf08 |
completed | May 11, 2026, 7:38 p.m. |
Created at: April 10, 2026, 10:02 a.m.