Triple

T16974232
Position Surface form Disambiguated ID Type / Status
Subject Victor Shoup E411765 entity
Predicate developed P73 FINISHED
Object HElib homomorphic encryption library E1242675 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: HElib homomorphic encryption library | Statement: [Victor Shoup, developed, HElib homomorphic encryption library]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: HElib homomorphic encryption library
Context triple: [Victor Shoup, developed, HElib homomorphic encryption library]
  • A. HElib homomorphic encryption library chosen
    HElib is an open-source C++ library that implements advanced homomorphic encryption schemes, enabling computation on encrypted data without decryption.
  • B. Hybrid Public Key Encryption (HPKE)
    Hybrid Public Key Encryption (HPKE) is a cryptographic framework that combines public-key and symmetric-key techniques to provide flexible, interoperable encryption for modern protocols such as TLS, QUIC, and MLS.
  • C. Rabin cryptosystem
    The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
  • D. SIV misuse-resistant AEAD
    SIV misuse-resistant AEAD is a cryptographic scheme designed to provide authenticated encryption that remains secure even when nonces are misused or repeated.
  • E. Yao’s garbled circuits
    Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
  • 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_69d886ca8f348190812768ea8d5055ce completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e3d0af06688190a77682aa297cd27e completed April 18, 2026, 6:42 p.m.
NED1 Entity disambiguation (via context triple) batch_6a011b3f751c81908906ec969bef55c5 completed May 10, 2026, 11:56 p.m.
Created at: April 10, 2026, 5:31 a.m.