Triple
T1451887
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Elwyn R. Berlekamp |
E31309
|
entity |
| Predicate | familyName |
P18
|
FINISHED |
| Object | Berlekamp |
E31309
|
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: Berlekamp | Statement: [Elwyn R. Berlekamp, familyName, Berlekamp]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Berlekamp Context triple: [Elwyn R. Berlekamp, familyName, Berlekamp]
-
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.
Rabin
Rabin is a surname most prominently associated with Yitzhak Rabin, the Israeli military leader, statesman, and Nobel Peace Prize–winning prime minister.
-
C.
Elwyn R. Berlekamp
chosen
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
D.
Conway polynomial
The Conway polynomial is an invariant of knots and links in topology that assigns a polynomial to each knot, capturing essential information about its structure and helping distinguish non-equivalent knots.
-
E.
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.
- 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_69a499171a28819085b993a3ac78e363 |
completed | March 1, 2026, 7:52 p.m. |
| NER | Named-entity recognition | batch_69a4c57d34cc8190801b769d9d9b2e2e |
completed | March 1, 2026, 11:02 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad08c6f7c881908d1ef9f7897895a6 |
completed | March 8, 2026, 5:27 a.m. |
Created at: March 1, 2026, 8 p.m.