Triple
T9958228
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Amos Fiat |
E195496
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object | Fiat–Shamir identification scheme |
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 identification scheme | Statement: [Amos Fiat, notableConcept, Fiat–Shamir identification scheme]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fiat–Shamir identification scheme Context triple: [Amos Fiat, notableConcept, Fiat–Shamir identification scheme]
-
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.
Secrecy, Authentication, and Public Key Systems
"Secrecy, Authentication, and Public Key Systems" is Ralph Merkle's influential doctoral thesis that helped lay the foundations of modern public-key cryptography and secure communication protocols.
-
C.
SIGMA protocol family
The SIGMA protocol family is a class of cryptographic key exchange protocols designed to provide strong security and authentication properties, widely used as the basis for modern secure communication standards.
-
D.
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.
-
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_69d281e1eb848190b898e36ec9821228 |
completed | April 5, 2026, 3:38 p.m. |
Created at: March 30, 2026, 8:46 p.m.