Triple
T2792413
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GNU Privacy Guard |
E61959
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | OpenPGP implementation |
C10729
|
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: OpenPGP implementation Context triple: [GNU Privacy Guard, instanceOf, OpenPGP implementation]
-
A.
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.
-
B.
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.
-
C.
asymmetric cryptographic algorithm
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.
-
D.
cryptographic protocol framework
A cryptographic protocol framework is a structured set of tools, abstractions, and rules that enables the design, specification, analysis, and implementation of secure communication protocols.
-
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. chosen
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_69ab4b7f51d881908768300ebd2fbdae |
completed | March 6, 2026, 9:47 p.m. |
Created at: March 6, 2026, 9:58 p.m.