Triple

T1013318
Position Surface form Disambiguated ID Type / Status
Subject Oded Goldreich E21871 entity
Predicate authorOf P4244 FINISHED
Object In a World of Pseudorandomness
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
 E122538 NE FINISHED

How this triple was built (4 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: In a World of Pseudorandomness | Statement: [Oded Goldreich, authorOf, In a World of Pseudorandomness]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: In a World of Pseudorandomness
Context triple: [Oded Goldreich, authorOf, In a World of Pseudorandomness]
  • A. Randomness and Computation
    "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
  • 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. 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. Probabilistic Encryption
    Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
  • E. Blum complexity measures
    Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: In a World of Pseudorandomness
Triple: [Oded Goldreich, authorOf, In a World of Pseudorandomness]
Generated description
"In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07 
Target entity: In a World of Pseudorandomness
Target entity description: "In a World of Pseudorandomness" is a theoretical computer science work exploring the foundations, constructions, and implications of pseudorandomness in computation and cryptography.
  • A. Randomness and Computation
    "Randomness and Computation" is Shafi Goldwasser's influential doctoral thesis that helped lay the foundations of modern complexity theory and cryptography by rigorously exploring the role of randomness in efficient computation.
  • 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. 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. Probabilistic Encryption
    Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
  • E. Blum complexity measures
    Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
  • 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_69a493c68e24819080ed0ee8bcfd5ce0 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4b7a8b254819089ffed9cb62a6930 completed March 1, 2026, 10:03 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac3bad654c81909dd59211fafa8b2c completed March 7, 2026, 2:52 p.m.
NEDg Description generation batch_69ac3c41ab70819090084c508dbfd295 completed March 7, 2026, 2:54 p.m.
NED2 Entity disambiguation (via description) batch_69ac3cbb30d081909759df25c21eb275 completed March 7, 2026, 2:56 p.m.
Created at: March 1, 2026, 7:41 p.m.