Triple
T11438099
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Andrew Yao |
E271060
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Yao’s garbled circuits |
E926124
|
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: Yao’s garbled circuits | Statement: [Andrew Yao, notableConcept, Yao’s garbled circuits]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Yao’s garbled circuits Context triple: [Andrew Yao, notableConcept, Yao’s garbled circuits]
-
A.
Yao’s garbled circuits
chosen
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.
-
B.
Naor–Yung encryption paradigm
The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
-
C.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
D.
How to Exchange Secrets by Oblivious Transfer
"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.
-
E.
Naor–Reingold pseudorandom function
The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
- 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_69d6aadeef688190874bcecd88b3dd9b |
completed | April 8, 2026, 7:22 p.m. |
| NER | Named-entity recognition | batch_69d8088711ec8190afae9f4d9f2a11ca |
completed | April 9, 2026, 8:13 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69e5e8ed579c8190b1ddc1dce20d9617 |
completed | April 20, 2026, 8:50 a.m. |
Created at: April 8, 2026, 9:35 p.m.