Triple
T9961828
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Elliptic Curve Digital Signature Algorithm |
E195587
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | asymmetric cryptographic primitive |
C2105
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: asymmetric cryptographic primitive Context triple: [Elliptic Curve Digital Signature Algorithm, instanceOf, asymmetric cryptographic primitive]
-
A.
asymmetric cryptographic algorithm
chosen
An asymmetric cryptographic algorithm is a method that uses a mathematically related pair of keys—one public and one private—to enable secure operations such as encryption, decryption, and digital signatures without sharing secret keys.
-
B.
cryptographic primitive
A cryptographic primitive is a low-level, well-defined algorithm or protocol (such as a hash function, block cipher, or digital signature scheme) that serves as a basic building block for constructing more complex cryptographic systems and protocols.
-
C.
cryptographic key
A cryptographic key is a piece of information, usually a string of bits, used by cryptographic algorithms to encrypt, decrypt, sign, or verify data securely.
-
D.
public-key cryptographic algorithm
A public-key cryptographic algorithm is a method that uses a mathematically related pair of keys—one public and one private—to enable secure operations such as encryption, digital signatures, and key exchange over untrusted networks.
-
E.
cryptographic data structure
A cryptographic data structure is a data organization that uses cryptographic primitives to ensure properties like integrity, authenticity, privacy, or verifiability of the stored or processed information.
- F. None of above.
Provenance (1 batch)
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_69ca82ebd1288190912f9e4482d1fa35 |
completed | March 30, 2026, 2:04 p.m. |
Created at: March 30, 2026, 8:47 p.m.