Triple
T17403879
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Benny Pinkas |
E423162
|
entity |
| Predicate | notableWorkArea |
P23945
|
FINISHED |
| Object | oblivious transfer |
—
|
NE NERFINISHED |
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: oblivious transfer | Statement: [Benny Pinkas, notableWorkArea, oblivious transfer]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: oblivious transfer Context triple: [Benny Pinkas, notableWorkArea, oblivious transfer]
-
A.
How to Exchange Secrets by Oblivious Transfer
chosen
"How to Exchange Secrets by Oblivious Transfer" is a seminal cryptography paper by Michael O. Rabin that introduced the concept of oblivious transfer, a fundamental primitive for secure multi-party computation and privacy-preserving protocols.
-
B.
oblivious RAM
Oblivious RAM is a cryptographic technique that hides a program’s memory access patterns to protect sensitive information from being inferred by observing those accesses.
-
C.
Yao’s garbled circuits
Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
-
D.
Probabilistic Encryption
Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
-
E.
Merkle puzzles
Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69d889d7d27c819088486ce3f0627fa1 |
completed | April 10, 2026, 5:25 a.m. |
| NER | Named-entity recognition | batch_69e43b051cc48190872278ee0b52240d |
completed | April 19, 2026, 2:16 a.m. |
Created at: April 10, 2026, 5:45 a.m.