Triple
T19937655
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | James L. Massey |
E479214
|
entity |
| Predicate | coInventorOf |
P1858
|
FINISHED |
| Object | Massey–Omura cryptosystem |
—
|
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: Massey–Omura cryptosystem | Statement: [James L. Massey, coInventorOf, Massey–Omura cryptosystem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Massey–Omura cryptosystem Context triple: [James L. Massey, coInventorOf, Massey–Omura cryptosystem]
-
A.
Massey–Omura cryptosystem
chosen
The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
-
B.
Cramer–Shoup cryptosystem
The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
-
C.
Massey–Omura multiplier
The Massey–Omura multiplier is a hardware-efficient digital circuit architecture designed for fast finite-field multiplication, widely used in error-correcting codes and cryptographic systems.
-
D.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
-
E.
New Directions in Cryptography
New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
- 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_69d8e522a17c819095165d4d24939fd8 |
completed | April 10, 2026, 11:55 a.m. |
| NER | Named-entity recognition | batch_69e65a17fb2c8190b3aaae88e741648a |
completed | April 20, 2026, 4:53 p.m. |
Created at: April 10, 2026, 1:53 p.m.