Triple
T1413461
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Ueli Maurer |
E31855
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
information-theoretic cryptography
Information-theoretic cryptography is a branch of cryptography that studies schemes whose security is guaranteed by fundamental information-theoretic limits rather than computational hardness assumptions.
|
E3531
|
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: information-theoretic cryptography | Statement: [Ueli Maurer, notableWork, information-theoretic cryptography]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: information-theoretic cryptography Context triple: [Ueli Maurer, notableWork, information-theoretic cryptography]
-
A.
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.
-
B.
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.
-
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.
Communication Theory of Secrecy Systems
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
E.
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.
- 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: information-theoretic cryptography Triple: [Ueli Maurer, notableWork, information-theoretic cryptography]
Generated description
Information-theoretic cryptography is a branch of cryptography that studies schemes whose security is guaranteed by fundamental information-theoretic limits rather than computational hardness assumptions.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: information-theoretic cryptography Target entity description: Information-theoretic cryptography is a branch of cryptography that studies schemes whose security is guaranteed by fundamental information-theoretic limits rather than computational hardness assumptions.
-
A.
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.
-
B.
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.
-
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.
Communication Theory of Secrecy Systems
chosen
Communication Theory of Secrecy Systems is Claude Shannon’s foundational paper that established the mathematical basis of modern cryptography and information-theoretic security.
-
E.
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.
- F. None of above.
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_69a49919a994819086528951bc224775 |
completed | March 1, 2026, 7:52 p.m. |
| NER | Named-entity recognition | batch_69a4c3e476f08190aed1576805c62462 |
completed | March 1, 2026, 10:55 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ace57ec2d88190b06d0f20e3b52462 |
completed | March 8, 2026, 2:57 a.m. |
| NEDg | Description generation | batch_69ace5fc91d081909b33009d06a38616 |
completed | March 8, 2026, 2:59 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ace6c10f54819089a4afcf49ef894f |
completed | March 8, 2026, 3:02 a.m. |
Created at: March 1, 2026, 7:59 p.m.