Triple
T18281204
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | PMAC |
E437866
|
entity |
| Predicate | citation |
P771
|
FINISHED |
| Object | Phillip Rogaway, "PMAC: Parallelizable Message Authentication Code," EUROCRYPT 2002 |
—
|
NE NERFINISHED |
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: Phillip Rogaway, "PMAC: Parallelizable Message Authentication Code," EUROCRYPT 2002 | Statement: [PMAC, citation, Phillip Rogaway, "PMAC: Parallelizable Message Authentication Code," EUROCRYPT 2002]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Phillip Rogaway, "PMAC: Parallelizable Message Authentication Code," EUROCRYPT 2002 Context triple: [PMAC, citation, Phillip Rogaway, "PMAC: Parallelizable Message Authentication Code," EUROCRYPT 2002]
-
A.
PMAC message authentication code
chosen
PMAC (Parallelizable Message Authentication Code) is a cryptographic message authentication scheme designed for efficient, parallelizable computation of authentication tags over data.
-
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.
Hash-based Message Authentication Code
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.
-
D.
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.
-
E.
Cramer–Shoup cryptosystem
The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
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_69d8b914530c8190b4474d862a2b2a1b |
completed | April 10, 2026, 8:47 a.m. |
| NER | Named-entity recognition | batch_69e50056ea0481908d66bf263ac80c75 |
completed | April 19, 2026, 4:18 p.m. |
Created at: April 10, 2026, 10:35 a.m.