Triple
T1711882
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RFC 8017 |
E37200
|
entity |
| Predicate | defines |
P264
|
FINISHED |
| Object | EME-OAEP |
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: EME-OAEP | Statement: [RFC 8017, defines, EME-OAEP]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: EME-OAEP Context triple: [RFC 8017, defines, EME-OAEP]
-
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.
Ed448
Ed448 is a modern high-security elliptic-curve digital signature algorithm designed for strong cryptographic assurance and efficient performance.
-
C.
PKCS #7
PKCS #7 is a cryptographic standard that defines the syntax for digitally signing and encrypting data, forming the basis for formats like S/MIME and CMS (Cryptographic Message Syntax).
-
D.
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.
-
E.
Merkle–Damgård construction
The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
- 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_69adb5be1a2c819083b95d55c969b9d6 |
completed | March 8, 2026, 5:45 p.m. |
Created at: March 4, 2026, 7:30 p.m.