Triple

T21191263
Position Surface form Disambiguated ID Type / Status
Subject IKEv1 E522215 entity
Predicate uses P98 FINISHED
Object Diffie–Hellman key exchange 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: Diffie–Hellman key exchange | Statement: [IKEv1, uses, Diffie–Hellman key exchange]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Diffie–Hellman key exchange
Context triple: [IKEv1, uses, Diffie–Hellman key exchange]
  • A. Diffie–Hellman key exchange chosen
    Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
  • B. SIGMA key exchange protocol
    The SIGMA key exchange protocol is a cryptographic protocol designed to provide secure authenticated key exchange with strong security guarantees and has been widely used as the basis for protocols like IKE in IPsec.
  • C. Dragonfly key exchange
    Dragonfly key exchange is a password-authenticated key exchange (PAKE) protocol designed to provide secure mutual authentication and key establishment resistant to offline dictionary attacks.
  • D. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • E. Massey–Omura cryptosystem
    The Massey–Omura cryptosystem is a public-key encryption scheme based on exponentiation in finite fields that enables secure communication without prior key exchange.
  • 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_69e0b51061388190aa03f19700d3ef04 completed April 16, 2026, 10:08 a.m.
NER Named-entity recognition batch_69e733381f288190b3da795f62a39568 completed April 21, 2026, 8:20 a.m.
Created at: April 16, 2026, 3:07 p.m.