Triple
T26177683
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Cassels–Tate pairing |
E654586
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | bilinear pairing |
C27994
|
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: bilinear pairing Context triple: [Cassels–Tate pairing, instanceOf, bilinear pairing]
-
A.
pairing
chosen
Pairing is the conceptual class representing the association or coupling of two complementary or related entities treated as a single combined unit.
-
B.
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.
-
C.
cryptographic data structure
A cryptographic data structure is a data organization that uses cryptographic primitives to ensure properties like integrity, authenticity, privacy, or verifiability of the stored or processed information.
-
D.
cryptographic parameter set family
A cryptographic parameter set family is a collection of related parameter sets, typically varying in size or security level, that define the mathematical and operational settings for a class of cryptographic algorithms.
-
E.
finite-field Diffie-Hellman group
A finite-field Diffie-Hellman group is a multiplicative group of integers modulo a prime (or prime power) used as the algebraic setting in which two parties can securely compute a shared secret via the Diffie-Hellman key exchange protocol.
- 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_69ee5b45873c81909499203612d05d07 |
completed | April 26, 2026, 6:36 p.m. |
Created at: April 26, 2026, 8:38 p.m.