Triple

T20578272
Position Surface form Disambiguated ID Type / Status
Subject Blum integer E505280 entity
Predicate relatedTo P37 FINISHED
Object Blum integer-based trapdoor permutations — NE NERFINISHED

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: Blum integer-based trapdoor permutations | Statement: [Blum integer, relatedTo, Blum integer-based trapdoor permutations]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Blum integer-based trapdoor permutations
Context triple: [Blum integer, relatedTo, Blum integer-based trapdoor permutations]
  • A. “Theory and applications of trapdoor functions”
    “Theory and applications of trapdoor functions” is a foundational cryptography paper by Andrew Yao that formalizes trapdoor functions and demonstrates their use in constructing secure cryptographic protocols.
  • B. Naor–Yung encryption paradigm
    The Naor–Yung encryption paradigm is a foundational cryptographic framework that uses double encryption and zero-knowledge proofs to transform semantically secure public-key schemes into ones secure against chosen-ciphertext attacks.
  • C. Cramer–Shoup cryptosystem
    The Cramer–Shoup cryptosystem is a public-key encryption scheme designed to be secure against adaptive chosen-ciphertext attacks, improving on earlier systems like ElGamal in terms of robustness and security guarantees.
  • D. Blum–Blum–Shub pseudorandom number generator chosen
    The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
  • E. Naor–Reingold pseudorandom function
    The Naor–Reingold pseudorandom function is a foundational cryptographic construction that provides a simple, efficient, and provably secure method for generating pseudorandom outputs from secret keys based on number-theoretic assumptions.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (2 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_69e0b4b721588190993ac7b0a9be2736 completed April 16, 2026, 10:06 a.m.
NER Named-entity recognition batch_69e6a90cc22c8190969e3a21ae92f1c9 completed April 20, 2026, 10:30 p.m.
Created at: April 16, 2026, 11:39 a.m.