Triple
T5245496
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Blum–Blum–Shub pseudorandom number generator |
E118448
|
entity |
| Predicate | namedAfter |
P63
|
FINISHED |
| Object | Manuel Blum |
E21386
|
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: Manuel Blum | Statement: [Blum–Blum–Shub pseudorandom number generator, namedAfter, Manuel Blum]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Manuel Blum Context triple: [Blum–Blum–Shub pseudorandom number generator, namedAfter, Manuel Blum]
-
A.
Manuel Blum
chosen
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
C.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
D.
Oded Goldreich
Oded Goldreich is an Israeli computer scientist renowned for his foundational contributions to cryptography, computational complexity, and the theory of pseudorandomness.
-
E.
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
- 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_69bf331e0e2881908b52da110384302a |
completed | March 22, 2026, 12:09 a.m. |
Created at: March 20, 2026, 1:49 p.m.