Triple
T5245518
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum–Blum–Shub pseudorandom number generator |
E118448
|
entity |
| Predicate | comparedTo |
P278
|
FINISHED |
| Object | Mersenne Twister |
E440656
|
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: Mersenne Twister | Statement: [Blum–Blum–Shub pseudorandom number generator, comparedTo, Mersenne Twister]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Mersenne Twister Context triple: [Blum–Blum–Shub pseudorandom number generator, comparedTo, Mersenne Twister]
-
A.
MersenneTwister
chosen
MersenneTwister is a widely used pseudorandom number generator algorithm known for its long period and high-quality statistical properties.
-
B.
cuRAND
cuRAND is NVIDIA's GPU-accelerated random number generation library designed to efficiently produce high-quality random numbers for parallel applications using CUDA.
-
C.
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.
-
D.
Blum–Micali pseudorandom number generator
The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
-
E.
Monte Carlo method
The Monte Carlo method is a computational technique that uses random sampling to approximate numerical results, especially for complex integrals, simulations, and probabilistic systems.
- 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_69bd4468aacc8190a8196f71855cdf4f |
completed | March 20, 2026, 12:58 p.m. |
| NER | Named-entity recognition | batch_69bd7b515edc8190a9db198d4eb1c4f6 |
completed | March 20, 2026, 4:52 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bef832ae8481908a90faf66c1db631 |
completed | March 21, 2026, 7:57 p.m. |
Created at: March 20, 2026, 1:49 p.m.