Triple
T10595195
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | CFRG |
E250093
|
entity |
| Predicate | standardized |
P1371
|
FINISHED |
| Object | Curve25519 for key agreement |
E192664
|
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: Curve25519 for key agreement | Statement: [CFRG, standardized, Curve25519 for key agreement]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Curve25519 for key agreement Context triple: [CFRG, standardized, Curve25519 for key agreement]
-
A.
Curve25519-based schemes
chosen
Curve25519-based schemes are cryptographic protocols and algorithms that use the Curve25519 elliptic curve to provide efficient, high-security public-key operations such as key exchange and digital signatures.
-
B.
Diffie–Hellman key exchange
Diffie–Hellman key exchange is a foundational cryptographic protocol that enables two parties to securely establish a shared secret over an insecure communication channel.
-
C.
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.
-
D.
Twisted Edwards curve
A Twisted Edwards curve is a type of elliptic curve with a specific algebraic form that enables especially fast and secure implementations of cryptographic operations such as digital signatures and key exchange.
-
E.
Koblitz curves
Koblitz curves are a special class of elliptic curves defined over binary fields that enable particularly efficient and fast implementations of elliptic curve 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_69d381c9d3d48190a29ee491e1696a0e |
completed | April 6, 2026, 9:50 a.m. |
| NER | Named-entity recognition | batch_69d5278cbf9081909ef419b0144d5019 |
completed | April 7, 2026, 3:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d95e8de2e88190835954abb2ac2ece |
completed | April 10, 2026, 8:33 p.m. |
Created at: April 6, 2026, 12:41 p.m.