Triple

T17051496
Position Surface form Disambiguated ID Type / Status
Subject Verifiable Random Function E413706 entity
Predicate introducedInWork P513 FINISHED
Object Verifiable Random Functions (FOCS 1999) E413706 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: Verifiable Random Functions (FOCS 1999) | Statement: [Verifiable Random Function, introducedInWork, Verifiable Random Functions (FOCS 1999)]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Verifiable Random Functions (FOCS 1999)
Context triple: [Verifiable Random Function, introducedInWork, Verifiable Random Functions (FOCS 1999)]
  • A. Verifiable Random Function chosen
    A Verifiable Random Function (VRF) is a cryptographic primitive that produces pseudo-random outputs along with proofs that anyone can verify to confirm the outputs were correctly generated from a given input and secret key.
  • B. 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.
  • C. Fiat–Shamir heuristic
    The Fiat–Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones using hash functions, widely used in digital signatures and zero-knowledge proofs.
  • D. 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.
  • E. Blum–Micali pseudorandom number generator
    The Blum–Micali pseudorandom number generator is a foundational cryptographic algorithm that produces provably secure pseudorandom bits based on number-theoretic hardness assumptions.
  • 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_69d886cde3d481908d4d01ba88ba7eb7 completed April 10, 2026, 5:12 a.m.
NER Named-entity recognition batch_69e3daa26e84819098b41ae15618e813 completed April 18, 2026, 7:25 p.m.
NED1 Entity disambiguation (via context triple) batch_6a012343eca0819086a07511c5d22878 completed May 11, 2026, 12:31 a.m.
Created at: April 10, 2026, 5:34 a.m.