Triple

T1013311
Position Surface form Disambiguated ID Type / Status
Subject Oded Goldreich E21871 entity
Predicate knownFor P22 FINISHED
Object complexity-theoretic foundations of cryptography E122535 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: complexity-theoretic foundations of cryptography | Statement: [Oded Goldreich, knownFor, complexity-theoretic foundations of cryptography]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: complexity-theoretic foundations of cryptography
Context triple: [Oded Goldreich, knownFor, complexity-theoretic foundations of cryptography]
  • A. foundations of cryptography chosen
    Foundations of Cryptography is a seminal two-volume work by Oded Goldreich that rigorously develops the theoretical underpinnings of modern cryptography, including definitions, proofs, and core primitives.
  • B. 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.
  • C. 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.
  • D. Håstad’s switching lemma
    Håstad’s switching lemma is a fundamental result in computational complexity theory that provides powerful bounds on the simplification of Boolean formulas under random restrictions, with major applications in circuit lower bounds.
  • E. The Knowledge Complexity of Interactive Proof Systems
    "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
  • 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_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_69ac429016088190bf06c7327471d3d3 completed March 7, 2026, 3:21 p.m.
Created at: March 1, 2026, 7:41 p.m.