Triple

T1451911
Position Surface form Disambiguated ID Type / Status
Subject Elwyn R. Berlekamp E31309 entity
Predicate knownFor P22 FINISHED
Object Berlekamp–Massey algorithm E167281 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–Massey algorithm | Statement: [Elwyn R. Berlekamp, knownFor, Berlekamp–Massey algorithm]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Berlekamp–Massey algorithm
Context triple: [Elwyn R. Berlekamp, knownFor, Berlekamp–Massey algorithm]
  • A. Berlekamp–Massey algorithm chosen
    The Berlekamp–Massey algorithm is a key algorithm in coding theory and cryptography used to efficiently determine the shortest linear feedback shift register that generates a given binary sequence.
  • B. Berlekamp’s algorithm for factoring polynomials over finite fields
    Berlekamp’s algorithm for factoring polynomials over finite fields is a foundational deterministic method in computational algebra that efficiently decomposes polynomials into irreducible factors over finite fields and underpins many modern algorithms in coding theory and cryptography.
  • 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. Knuth–Morris–Pratt algorithm
    The Knuth–Morris–Pratt algorithm is a classic linear-time string-searching algorithm that efficiently finds occurrences of a pattern within a text by precomputing a prefix function to avoid redundant comparisons.
  • 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_69ad15a0adb0819096c560e8aa317016 completed March 8, 2026, 6:22 a.m.
Created at: March 1, 2026, 8 p.m.