Triple
T1907767
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | DNSSEC ZSK |
E38040
|
entity |
| Predicate | algorithm |
P21840
|
FINISHED |
| Object | EdDSA |
E192669
|
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: EdDSA | Statement: [DNSSEC ZSK, algorithm, EdDSA]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: EdDSA Context triple: [DNSSEC ZSK, algorithm, EdDSA]
-
A.
Ed25519
chosen
Ed25519 is a high-speed, high-security elliptic-curve digital signature scheme widely used in modern cryptographic protocols and software.
-
B.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
C.
Elliptic Curve Digital Signature Algorithm
Elliptic Curve Digital Signature Algorithm is a public-key cryptographic method that uses elliptic curve mathematics to create compact, secure digital signatures for authentication and data integrity.
-
D.
Curve25519-based schemes
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.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic protocols.
- 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_69a8862a26088190aae5243695aeefc0 |
completed | March 4, 2026, 7:21 p.m. |
| NER | Named-entity recognition | batch_69abb7c376208190bbf28504f1aac881 |
completed | March 7, 2026, 5:29 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69adeafb063481908a08f5570acc5b57 |
completed | March 8, 2026, 9:32 p.m. |
Created at: March 4, 2026, 7:35 p.m.