Triple
T18276335
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | SHA-1 |
E437745
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | message digest algorithm |
C3162
|
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: message digest algorithm Context triple: [SHA-1, instanceOf, message digest algorithm]
-
A.
symmetric-key algorithm
A symmetric-key algorithm is a cryptographic method that uses the same secret key for both encryption and decryption of data.
-
B.
message authentication code
A message authentication code (MAC) is a short piece of information generated from a message and a secret key that verifies both the message’s integrity and the authenticity of its sender.
-
C.
cryptographic protocol message
A cryptographic protocol message is a structured unit of data exchanged between parties in a cryptographic protocol, containing information such as identifiers, nonces, keys, and signatures to achieve security goals like confidentiality, integrity, and authentication.
-
D.
cryptographic primitive
chosen
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.
-
E.
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.
- 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_69d8b914530c8190b4474d862a2b2a1b |
completed | April 10, 2026, 8:47 a.m. |
Created at: April 10, 2026, 10:34 a.m.