Triple

T1013306
Position Surface form Disambiguated ID Type / Status
Subject Oded Goldreich E21871 entity
Predicate knownFor P22 FINISHED
Object foundations of cryptography
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.
E122535 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: foundations of cryptography | Statement: [Oded Goldreich, knownFor, foundations of cryptography]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: foundations of cryptography
Context triple: [Oded Goldreich, knownFor, foundations of cryptography]
  • A. Secrecy, Authentication, and Public Key Systems
    "Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
  • B. New Directions in Cryptography
    New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
  • C. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • 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. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • 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: foundations of cryptography
Triple: [Oded Goldreich, knownFor, foundations of cryptography]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: foundations of cryptography
Target entity description: 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.
  • A. Secrecy, Authentication, and Public Key Systems
    "Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
  • B. New Directions in Cryptography
    New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
  • C. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • 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. Elliptic Curve Cryptography
    Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
  • 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.