Triple
T9931685
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ECC |
E192661
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | asymmetric cryptography algorithm |
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 cryptography algorithm Context triple: [ECC, instanceOf, asymmetric cryptography algorithm]
-
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.
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.
-
C.
symmetric-key algorithm
A symmetric-key algorithm is a cryptographic method that uses the same secret key for both encryption and decryption of data.
-
D.
public-key cryptography standard
A public-key cryptography standard is a formally defined specification that governs how asymmetric key pairs are generated, distributed, and used to securely encrypt, decrypt, sign, and verify digital data.
-
E.
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.
- 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_69ca82dd978c8190947124ab0d3315ac |
completed | March 30, 2026, 2:04 p.m. |
Created at: March 30, 2026, 8:43 p.m.