Triple

T9958227
Position Surface form Disambiguated ID Type / Status
Subject Amos Fiat E195496 entity
Predicate notableConcept P201 FINISHED
Object Fiat–Shamir heuristic E831747 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: Fiat–Shamir heuristic | Statement: [Amos Fiat, notableConcept, Fiat–Shamir heuristic]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Fiat–Shamir heuristic
Context triple: [Amos Fiat, notableConcept, Fiat–Shamir heuristic]
  • A. Fiat–Shamir heuristic chosen
    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.
  • 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. Blum–Blum–Shub pseudorandom number generator
    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.
  • D. 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.
  • E. 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.
  • 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_69ca82eaaa008190a54fa1a9f954b9ad completed March 30, 2026, 2:04 p.m.
NER Named-entity recognition batch_69cdb6cec7dc8190bb7e43c82a317707 completed April 2, 2026, 12:22 a.m.
NED1 Entity disambiguation (via context triple) batch_69d269ef79548190ac87851efffa3f12 completed April 5, 2026, 1:55 p.m.
Created at: March 30, 2026, 8:46 p.m.