Triple
T4567015
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Simultaneous Authentication of Equals |
E121933
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | elliptic curve Diffie–Hellman |
E192664
|
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: elliptic curve Diffie–Hellman | Statement: [Simultaneous Authentication of Equals, uses, elliptic curve Diffie–Hellman]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: elliptic curve Diffie–Hellman Context triple: [Simultaneous Authentication of Equals, uses, elliptic curve Diffie–Hellman]
-
A.
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.
-
B.
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.
-
C.
Elliptic Curve Cryptography
Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
-
D.
Curve25519-based schemes
chosen
Curve25519-based schemes are cryptographic protocols and algorithms that use the Curve25519 elliptic curve to provide efficient, high-security public-key operations such as key exchange and digital signatures.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- 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_69bd463f156881908a99aca69c5721ac |
completed | March 20, 2026, 1:06 p.m. |
| NER | Named-entity recognition | batch_69bd589e35808190aa609bb04b128dbe |
completed | March 20, 2026, 2:24 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bdd3b560a08190a485e9ec45e0f0f8 |
completed | March 20, 2026, 11:09 p.m. |
Created at: March 20, 2026, 1:09 p.m.