Triple
T1711879
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 8017 |
E37200
|
entity |
| Predicate | defines |
P264
|
FINISHED |
| Object | RSAES-PKCS1-v1_5 |
E37199
|
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: RSAES-PKCS1-v1_5 | Statement: [RFC 8017, defines, RSAES-PKCS1-v1_5]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: RSAES-PKCS1-v1_5 Context triple: [RFC 8017, defines, RSAES-PKCS1-v1_5]
-
A.
PKCS #1
chosen
PKCS #1 is a cryptographic standard that defines the mathematical properties, formats, and padding schemes for implementing RSA encryption and digital signatures.
-
B.
RSA
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
C.
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.
-
D.
PGP
PGP (Pretty Good Privacy) is an encryption program that provides cryptographic privacy and authentication for data communication, most notably for securing emails and files.
-
E.
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.
- 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_69a8861912dc8190931af43b4b9158a7 |
completed | March 4, 2026, 7:20 p.m. |
| NER | Named-entity recognition | batch_69aa6315afdc81908409435bb47e8ee0 |
completed | March 6, 2026, 5:16 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad8addf4a48190b19cdb861db5eecd |
completed | March 8, 2026, 2:42 p.m. |
Created at: March 4, 2026, 7:30 p.m.