Triple
T9931709
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | ECC |
E192661
|
entity |
| Predicate | canBeUsedWith |
P4791
|
FINISHED |
| Object | Elliptic Curve Digital Signature Algorithm |
E195587
|
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: Elliptic Curve Digital Signature Algorithm | Statement: [ECC, canBeUsedWith, Elliptic Curve Digital Signature Algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Elliptic Curve Digital Signature Algorithm Context triple: [ECC, canBeUsedWith, Elliptic Curve Digital Signature Algorithm]
-
A.
Elliptic Curve Digital Signature Algorithm
chosen
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.
-
B.
Elliptic Curve Cryptography
Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
-
C.
DSA (Digital Signature Algorithm)
DSA (Digital Signature Algorithm) is a widely used public-key cryptographic standard for creating and verifying digital signatures, originally based on principles similar to those of the ElGamal signature scheme.
-
D.
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.
-
E.
EdDSA
EdDSA (Edwards-curve Digital Signature Algorithm) is a modern public-key signature scheme designed for high performance, security, and resistance to side-channel attacks, commonly used with curves like Ed25519.
- 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_69ca82dd978c8190947124ab0d3315ac |
completed | March 30, 2026, 2:04 p.m. |
| NER | Named-entity recognition | batch_69cdb5b54f348190b8e70e7beff6098a |
completed | April 2, 2026, 12:17 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d228d1620c8190ac7125b268dd6832 |
completed | April 5, 2026, 9:18 a.m. |
Created at: March 30, 2026, 8:43 p.m.