Triple
T5085222
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | RC5 |
E114618
|
entity |
| Predicate | category |
P87
|
FINISHED |
| Object | Rivest Cipher family |
E114618
|
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: Rivest Cipher family | Statement: [RC5, category, Rivest Cipher family]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rivest Cipher family Context triple: [RC5, category, Rivest Cipher family]
-
A.
Blum–Blum–Shub pseudorandom number generator
The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
-
B.
Rijndael
Rijndael is a symmetric block cipher designed by Joan Daemen and Vincent Rijmen that was selected by NIST as the basis for the Advanced Encryption Standard (AES).
-
C.
RC5
chosen
RC5 is a symmetric-key block cipher designed by cryptographer Ronald L. Rivest, known for its simplicity, parameter flexibility, and use in various encryption applications.
-
D.
Spritz cipher
Spritz cipher is a modern stream cipher and hash function designed by Ronald Rivest and Jacob Schuldt as a more secure and flexible successor to RC4.
-
E.
Merkle–Hellman knapsack cryptosystem
The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
- 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_69bd443e941881908eb4e8c685b6f656 |
completed | March 20, 2026, 12:57 p.m. |
| NER | Named-entity recognition | batch_69bd751db4f4819088b998d7af0e6f41 |
completed | March 20, 2026, 4:26 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69beb13a8be08190a0f1fc3aec224dde |
completed | March 21, 2026, 2:54 p.m. |
Created at: March 20, 2026, 1:40 p.m.