Triple
T31135414
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Carter–Wegman universal hashing |
E793624
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | universal hashing scheme |
C26353
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: universal hashing scheme Context triple: [Carter–Wegman universal hashing, instanceOf, universal hashing scheme]
-
A.
cryptographic scheme family
chosen
A cryptographic scheme family is a parameterized collection of related cryptographic schemes (e.g., keyed by security parameter or algorithm variant) that share a common structure and security goals while differing in specific instantiations or parameters.
-
B.
hash table data structure
A hash table data structure stores key-value pairs in an array-like structure using a hash function to map keys to indices, enabling fast average-time insertion, lookup, and deletion operations.
-
C.
cryptographic primitive
A cryptographic primitive is a low-level, well-defined algorithm or protocol (such as a hash function, block cipher, or digital signature scheme) that serves as a basic building block for constructing more complex cryptographic systems and protocols.
-
D.
encryption scheme
An encryption scheme is a systematic method that transforms readable data into an unreadable form using algorithms and keys to ensure confidentiality, integrity, and secure communication.
-
E.
hash code provider
A hash code provider is a component responsible for generating consistent, deterministic hash codes for objects, typically used to support efficient lookups in hash-based data structures.
- F. None of above.
Provenance (1 batch)
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_69f224d2b3a48190aa9dd26fbf6eab1a |
completed | April 29, 2026, 3:33 p.m. |
Created at: April 29, 2026, 9:05 p.m.