Triple
T9931241
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | FIPS 198-1 |
E192652
|
entity |
| Predicate | defines |
P264
|
FINISHED |
| Object | Keyed-Hash Message Authentication Code |
E832816
|
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: Keyed-Hash Message Authentication Code | Statement: [FIPS 198-1, defines, Keyed-Hash Message Authentication Code]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Keyed-Hash Message Authentication Code Context triple: [FIPS 198-1, defines, Keyed-Hash Message Authentication Code]
-
A.
Hash-based Message Authentication Code
chosen
Hash-based Message Authentication Code (HMAC) is a cryptographic mechanism that uses a hash function and a secret key to verify both the integrity and authenticity of a message.
-
B.
Carter–Wegman MACs
Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
-
C.
Message-Digest Algorithm 5
Message-Digest Algorithm 5 (MD5) is a widely known but now cryptographically broken hash function that produces a 128-bit hash value and was once commonly used for checksums and data integrity verification.
-
D.
Secure Hash Standard
The Secure Hash Standard is a U.S. federal standard that specifies secure hash algorithms (such as the SHA family) used for generating fixed-size cryptographic hashes to ensure data integrity and support digital signatures.
-
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_69ca82dd978c8190947124ab0d3315ac |
completed | March 30, 2026, 2:04 p.m. |
| NER | Named-entity recognition | batch_69cdb5b54f348190b8e70e7beff6098a |
completed | April 2, 2026, 12:17 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d269e28f0081908244f9f469b15ec1 |
completed | April 5, 2026, 1:55 p.m. |
Created at: March 30, 2026, 8:43 p.m.