Triple
T1134438
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Avi Wigderson |
E23105
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Randomness and Computation |
E17284
|
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: Randomness and Computation | Statement: [Avi Wigderson, notableWork, Randomness and Computation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Randomness and Computation Context triple: [Avi Wigderson, notableWork, Randomness and Computation]
-
A.
Randomness and Computation
chosen
"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.
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.
-
C.
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
"Modern Cryptography, Probabilistic Proofs and Pseudorandomness" is a foundational textbook that systematically develops the theoretical underpinnings of modern cryptography, focusing on probabilistic proof techniques and the theory of pseudorandomness.
-
D.
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective is a graduate-level textbook that presents the foundations and key themes of computational complexity theory with an emphasis on conceptual understanding over technical detail.
-
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.
- 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_69a493ec75988190b63a11bafaec29b4 |
completed | March 1, 2026, 7:30 p.m. |
| NER | Named-entity recognition | batch_69a4bbfffaa48190b2534ff4da3544ce |
completed | March 1, 2026, 10:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac59ac2ea881908b9559ff9d47077a |
completed | March 7, 2026, 5 p.m. |
Created at: March 1, 2026, 7:44 p.m.