Triple
T9312190
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carter–Wegman MACs |
E224031
|
entity |
| Predicate | definedIn |
P775
|
FINISHED |
| Object | paper "Universal classes of hash functions" |
E224031
|
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: paper "Universal classes of hash functions" | Statement: [Carter–Wegman MACs, definedIn, paper "Universal classes of hash functions"]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: paper "Universal classes of hash functions" Context triple: [Carter–Wegman MACs, definedIn, paper "Universal classes of hash functions"]
-
A.
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.
-
B.
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.
-
C.
Carter–Wegman MACs
chosen
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.
-
D.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
E.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
- 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_69ca8425f4fc81909c1c586e9a5b7530 |
completed | March 30, 2026, 2:09 p.m. |
| NER | Named-entity recognition | batch_69cd20ae96e481909a1af9ea1c91f2b2 |
completed | April 1, 2026, 1:42 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d0c797640c8190be003e321faf3b86 |
completed | April 4, 2026, 8:11 a.m. |
Created at: March 30, 2026, 7:37 p.m.