Triple
T9931894
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | brainpool curves |
E192665
|
entity |
| Predicate | includesCurve |
P91194
|
FINISHED |
| Object | brainpoolP192r1 |
E192665
|
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: brainpoolP192r1 | Statement: [brainpool curves, includesCurve, brainpoolP192r1]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: brainpoolP192r1 Context triple: [brainpool curves, includesCurve, brainpoolP192r1]
-
A.
brainpool curves
chosen
Brainpool curves are a family of elliptic curves over prime fields designed to provide high-security, efficiently implementable alternatives to earlier standardized curves in elliptic curve cryptography.
-
B.
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.
-
C.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
D.
Ed25519
Ed25519 is a high-speed, high-security elliptic-curve digital signature scheme widely used in modern cryptographic protocols and software.
-
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_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.