Triple
T7934640
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ElGamal |
E184257
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object | threshold ElGamal |
E184257
|
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: threshold ElGamal | Statement: [ElGamal, hasVariant, threshold ElGamal]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: threshold ElGamal Context triple: [ElGamal, hasVariant, threshold ElGamal]
-
A.
ElGamal
chosen
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
-
B.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
C.
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.
-
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.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
- 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_69ca8290c21c8190906a5ca6fe2b03c4 |
completed | March 30, 2026, 2:02 p.m. |
| NER | Named-entity recognition | batch_69cb3aeb132c8190bea4906aaf51b869 |
completed | March 31, 2026, 3:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cb5c0791e48190af18299c22f6a804 |
completed | March 31, 2026, 5:30 a.m. |
Created at: March 30, 2026, 5:08 p.m.