Triple
T1696081
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 7919 |
E36660
|
entity |
| Predicate | usesAlgorithm |
P89
|
FINISHED |
| Object | finite-field Diffie-Hellman |
E5655
|
NE FINISHED |
How this triple was built (3 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: finite-field Diffie-Hellman | Statement: [RFC 7919, usesAlgorithm, finite-field Diffie-Hellman]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: finite-field Diffie-Hellman Context triple: [RFC 7919, usesAlgorithm, finite-field Diffie-Hellman]
-
A.
Diffie–Hellman key exchange
chosen
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.
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.
-
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.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
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.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: usesAlgorithm Context triple: [RFC 7919, usesAlgorithm, finite-field Diffie-Hellman]
-
A.
usesEncryptionAlgorithm
Indicates that one entity applies or relies on a specific encryption algorithm to protect data or communications.
-
B.
algorithmType
Indicates the specific kind or category of algorithm associated with an entity or process.
-
C.
relatedAlgorithm
Indicates that one algorithm has a meaningful connection or association with another algorithm, such as similarity, dependency, or complementary function.
-
D.
usesComputationMethod
chosen
Indicates that an entity performs its processing or decision-making by applying a specified computational method or algorithm.
-
E.
usesStrategy
Indicates that an entity intentionally applies a particular strategy or method to achieve a goal or perform an action.
- F. None of above.
Provenance (4 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_69a886163dec8190859c514232a37a05 |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69aaf169da888190b3aa334752f1952b |
completed | March 6, 2026, 3:23 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad799ad838819087e945f47284a3b0 |
completed | March 8, 2026, 1:28 p.m. |
| PD | Predicate disambiguation | batch_69aa61b8ce348190b46154af0b041ff0 |
completed | March 6, 2026, 5:10 a.m. |
Created at: March 4, 2026, 7:30 p.m.