Triple

T20512728
Position Surface form Disambiguated ID Type / Status
Subject Yao’s pseudorandom generator construction E503603 entity
Predicate relatedTo P37 FINISHED
Object Blum-Blum-Shub pseudorandom generator — NE NERFINISHED

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: Blum-Blum-Shub pseudorandom generator | Statement: [Yao’s pseudorandom generator construction, relatedTo, Blum-Blum-Shub pseudorandom generator]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Blum-Blum-Shub pseudorandom generator
Context triple: [Yao’s pseudorandom generator construction, relatedTo, Blum-Blum-Shub pseudorandom generator]
  • A. Blum–Blum–Shub pseudorandom number generator chosen
    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. 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.
  • C. Naor–Reingold pseudorandom function
    The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
  • D. Fiat–Shamir heuristic
    The Fiat–Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones using hash functions, widely used in digital signatures and zero-knowledge proofs.
  • E. Yao’s pseudorandom generator construction
    Yao’s pseudorandom generator construction is a foundational cryptographic method that transforms any one-way function into a pseudorandom generator, establishing a deep connection between computational hardness and pseudorandomness.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69e0b4b2aa788190ae9eb37c1d73b1f1 completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e69dcd74c48190b050e25c20154c09 completed April 20, 2026, 9:42 p.m.
Created at: April 16, 2026, 11:36 a.m.