Triple
T2792455
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | GNU Privacy Guard |
E61959
|
entity |
| Predicate | supportsAlgorithm |
P203
|
FINISHED |
| Object |
RIPEMD-160
RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
|
E299186
|
NE FINISHED |
How this triple was built (4 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: RIPEMD-160 | Statement: [GNU Privacy Guard, supportsAlgorithm, RIPEMD-160]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: RIPEMD-160 Context triple: [GNU Privacy Guard, supportsAlgorithm, RIPEMD-160]
-
A.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
B.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
C.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
-
D.
CRAM-MD5
CRAM-MD5 is a challenge–response authentication mechanism that uses MD5 hashing to securely verify a user's identity without transmitting their password in plaintext.
-
E.
Merkle tree
A Merkle tree is a cryptographic data structure that uses a tree of hash values to efficiently and securely verify the integrity and consistency of large sets of data.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: RIPEMD-160 Triple: [GNU Privacy Guard, supportsAlgorithm, RIPEMD-160]
Generated description
RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: RIPEMD-160 Target entity description: RIPEMD-160 is a 160-bit cryptographic hash function designed as an alternative to SHA-1, commonly used for data integrity and security applications.
-
A.
SHA-256
SHA-256 is a widely used cryptographic hash function from the SHA-2 family that produces a 256-bit hash value for securing data integrity and authentication.
-
B.
MD5
MD5 is a widely known but now cryptographically broken 128-bit hash function formerly used for checksums, data integrity, and security applications.
-
C.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
-
D.
CRAM-MD5
CRAM-MD5 is a challenge–response authentication mechanism that uses MD5 hashing to securely verify a user's identity without transmitting their password in plaintext.
-
E.
Merkle tree
A Merkle tree is a cryptographic data structure that uses a tree of hash values to efficiently and securely verify the integrity and consistency of large sets of data.
- F. None of above. chosen
Provenance (5 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_69ab4b7f51d881908768300ebd2fbdae |
completed | March 6, 2026, 9:47 p.m. |
| NER | Named-entity recognition | batch_69abddd107ac81908eb1a6946834eee3 |
completed | March 7, 2026, 8:12 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69afc65ebe788190859012e930918b05 |
completed | March 10, 2026, 7:21 a.m. |
| NEDg | Description generation | batch_69afc6c6c620819098b76db174a6f98e |
completed | March 10, 2026, 7:22 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69afc72b2e3c8190aad78ac8924f07af |
completed | March 10, 2026, 7:24 a.m. |
Created at: March 6, 2026, 9:58 p.m.