Triple
T19352486
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PBKDF2 |
E484055
|
entity |
| Predicate | comparedWith |
P278
|
FINISHED |
| Object | bcrypt |
—
|
NE NERFINISHED |
How this triple was built (3 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: bcrypt | Statement: [PBKDF2, comparedWith, bcrypt]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: bcrypt Context triple: [PBKDF2, comparedWith, bcrypt]
-
A.
PBKDF2
PBKDF2 is a key derivation function that strengthens passwords by applying repeated hashing with a salt to produce cryptographic keys resistant to brute-force attacks.
-
B.
Hash
"Hash" is a darkly comic novel by Swedish author Torgny Lindgren that explores memory, identity, and rural life through the story of two men obsessively disputing who makes the better potato hash.
-
C.
SCRAM-SHA-256
SCRAM-SHA-256 is a modern, secure password-based authentication mechanism that uses the SHA-256 hash function within the SCRAM protocol to provide strong protection against credential theft and replay attacks.
-
D.
SHA-512
SHA-512 is a cryptographic hash function from the SHA-2 family that produces a 512-bit hash value and is widely used for secure data integrity and authentication.
-
E.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: bcrypt Target entity description: bcrypt is a password-hashing function designed to be computationally intensive and resistant to brute-force attacks, commonly used for securely storing passwords.
-
A.
PBKDF2
PBKDF2 is a key derivation function that strengthens passwords by applying repeated hashing with a salt to produce cryptographic keys resistant to brute-force attacks.
-
B.
Hash
"Hash" is a darkly comic novel by Swedish author Torgny Lindgren that explores memory, identity, and rural life through the story of two men obsessively disputing who makes the better potato hash.
-
C.
SCRAM-SHA-256
SCRAM-SHA-256 is a modern, secure password-based authentication mechanism that uses the SHA-256 hash function within the SCRAM protocol to provide strong protection against credential theft and replay attacks.
-
D.
SHA-512
SHA-512 is a cryptographic hash function from the SHA-2 family that produces a 512-bit hash value and is widely used for secure data integrity and authentication.
-
E.
HMAC
HMAC (Hash-based Message Authentication Code) is a cryptographic construction that combines a secret key with a hash function to provide data integrity and authentication.
- F. None of above. chosen
Provenance (2 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_69d8e8d244f8819080eb1f3491300db2 |
completed | April 10, 2026, 12:10 p.m. |
| NER | Named-entity recognition | batch_69e61905b16881909ab0e932bb9a0cda |
completed | April 20, 2026, 12:16 p.m. |
Created at: April 10, 2026, 1:34 p.m.