Triple
T4443372
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Random |
E96222
|
entity |
| Predicate | defaultRNGType |
P56538
|
FINISHED |
| Object | MersenneTwister |
E440656
|
NE FINISHED |
How this triple was built (3 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: MersenneTwister | Statement: [Random, defaultRNGType, MersenneTwister]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: MersenneTwister Context triple: [Random, defaultRNGType, MersenneTwister]
-
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
Monte Carlo is a famous district of Monaco renowned for its luxury casinos, upscale resorts, and role as a glamorous hub for high-end tourism and events like the Monaco Grand Prix.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: defaultRNGType Context triple: [Random, defaultRNGType, MersenneTwister]
-
A.
defaultSolver
Indicates that one entity functions as the standard or primary solver used by another entity or within a given context.
-
B.
typicalSeed
Indicates that something is a usual or characteristic seed for a given plant or context.
-
C.
seedUse
Indicates the use or application of seeds for a particular purpose, such as planting, cultivation, or propagation.
-
D.
seedSize
Indicates the relative magnitude or dimensions of a seed in comparison to others or to a standard.
-
E.
uniformSupplier
Indicates that one entity supplies uniforms to another entity, typically as a regular or designated provider.
- F. None of above. chosen
Provenance (5 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_69b345415ba481908df738e7174448ba |
completed | March 12, 2026, 10:59 p.m. |
| NER | Named-entity recognition | batch_69b355b052688190a0d8e5912f82151c |
completed | March 13, 2026, 12:09 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b6376286e48190906874d67c730dc9 |
completed | March 15, 2026, 4:36 a.m. |
| PD | Predicate disambiguation | batch_69b34f62c180819097ced38da2052207 |
completed | March 12, 2026, 11:42 p.m. |
| PDg | Predicate description generation | batch_69b35034cd248190bae09e9d090e13ec |
completed | March 12, 2026, 11:45 p.m. |
Created at: March 12, 2026, 11:32 p.m.