Triple
T7414884
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Keccak |
E171103
|
entity |
| Predicate | selectedAs |
P10044
|
FINISHED |
| Object | SHA-3 |
E663897
|
NE FINISHED |
How this triple was built (2 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: SHA-3 | Statement: [Keccak, selectedAs, SHA-3]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: SHA-3 Context triple: [Keccak, selectedAs, SHA-3]
-
A.
Keccak
chosen
Keccak is a cryptographic hash function family that forms the basis of the SHA-3 standard, known for its sponge construction and strong security properties.
-
B.
SHA-2
SHA-2 is a family of cryptographic hash functions widely used for data integrity, digital signatures, and security protocols on the internet.
-
C.
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.
-
D.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 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_69c68a618bdc81908d8018edadecd1a4 |
completed | March 27, 2026, 1:47 p.m. |
| NER | Named-entity recognition | batch_69c6f2c509ac8190876f207267a33a3b |
completed | March 27, 2026, 9:12 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c83c4dc1c08190876eb0e70f387b77 |
completed | March 28, 2026, 8:38 p.m. |
Created at: March 27, 2026, 3:11 p.m.