Triple

T2425582
Position Surface form Disambiguated ID Type / Status
Subject Charles Rackoff E53517 entity
Predicate notableWork P4 FINISHED
Object Interactive proof systems and zero-knowledge E17288 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: Interactive proof systems and zero-knowledge | Statement: [Charles Rackoff, notableWork, Interactive proof systems and zero-knowledge]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Interactive proof systems and zero-knowledge
Context triple: [Charles Rackoff, notableWork, Interactive proof systems and zero-knowledge]
  • A. The Knowledge Complexity of Interactive Proof Systems chosen
    "The Knowledge Complexity of Interactive Proof Systems" is a seminal theoretical computer science paper that introduced the notion of zero-knowledge proofs, fundamentally shaping modern cryptography and complexity theory.
  • B. 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.
  • C. 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.
  • D. Interactive Proofs and the Hardness of Approximating Cliques
    "Interactive Proofs and the Hardness of Approximating Cliques" is a seminal theoretical computer science paper that introduced powerful interactive proof techniques to show that finding near-maximum cliques in graphs is computationally intractable to approximate within strong bounds.
  • E. New Directions in Cryptography
    New Directions in Cryptography is a landmark 1976 paper that introduced the concepts of public-key cryptography and digital signatures, fundamentally reshaping modern cryptography and secure communications.
  • 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_69ab495c44d48190b7235b23719bc3f6 completed March 6, 2026, 9:38 p.m.
NER Named-entity recognition batch_69abc99a773c819092d5f3c297b83887 completed March 7, 2026, 6:45 a.m.
NED1 Entity disambiguation (via context triple) batch_69aef0a5fc208190a2479de4b1344759 completed March 9, 2026, 4:09 p.m.
Created at: March 6, 2026, 9:42 p.m.