Triple
T33056937
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blowfish |
E845867
|
entity |
| Predicate | keyScheduleComplexity |
P175756
|
FINISHED |
| Object | computationally expensive |
—
|
LITERAL 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: computationally expensive | Statement: [Blowfish, keyScheduleComplexity, computationally expensive]
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: keyScheduleComplexity Context triple: [Blowfish, keyScheduleComplexity, computationally expensive]
-
A.
usesKeyScheduleLike
Indicates that one cryptographic algorithm employs a key schedule that is the same as, or closely derived from, the key schedule of another algorithm.
-
B.
keyExpansion
Indicates the process of deriving a set of subkeys from an original key for use in a cryptographic algorithm.
-
C.
supportsPrecomputedKeySchedule
Indicates that an entity is capable of using or handling a cryptographic key schedule that has been computed in advance rather than generating it on the fly.
-
D.
decryptionComplexity
Indicates the level of computational effort or difficulty required to decrypt data protected by a given cryptographic method or key.
-
E.
usesKeyDependentSBoxes
Indicates that the cryptographic construction employs S-boxes whose behavior or mapping depends on the value of the secret key.
- F. None of above. chosen
Provenance (4 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_69f3495333b8819095e9af56855b9061 |
completed | April 30, 2026, 12:21 p.m. |
| NER | Named-entity recognition | batch_69f6d74b20a48190900dda1014cc13a8 |
completed | May 3, 2026, 5:04 a.m. |
| PD | Predicate disambiguation | batch_69f6d27120988190aacec621cf2bf0e8 |
completed | May 3, 2026, 4:43 a.m. |
| PDg | Predicate description generation | batch_69f6d6a482fc8190b526291cd99b8696 |
completed | May 3, 2026, 5:01 a.m. |
Created at: May 1, 2026, 1:25 a.m.