Triple

T2002249
Position Surface form Disambiguated ID Type / Status
Subject Poly1305 E43495 entity
Predicate belongsToFamily P4276 FINISHED
Object Carter–Wegman MACs
Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
E224031 NE FINISHED

How this triple was built (4 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: Carter–Wegman MACs | Statement: [Poly1305, belongsToFamily, Carter–Wegman MACs]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Carter–Wegman MACs
Context triple: [Poly1305, belongsToFamily, Carter–Wegman MACs]
  • A. Merkle–Damgård construction
    The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
  • B. 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.
  • C. Probabilistic Encryption
    Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
  • D. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • E. 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.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Carter–Wegman MACs
Triple: [Poly1305, belongsToFamily, Carter–Wegman MACs]
Generated description
Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Carter–Wegman MACs
Target entity description: Carter–Wegman MACs are a family of message authentication codes that use universal hashing combined with a secret key to provide efficient and provably secure authentication.
  • A. Merkle–Damgård construction
    The Merkle–Damgård construction is a fundamental method for building collision-resistant cryptographic hash functions from fixed-size compression functions, used in many classic hash algorithms like MD5 and SHA-1.
  • B. 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.
  • C. Probabilistic Encryption
    Probabilistic Encryption is a cryptographic technique that uses randomness in the encryption process so that the same message encrypts to different ciphertexts, enhancing security against attackers.
  • D. Merkle puzzles
    Merkle puzzles are an early cryptographic protocol that introduced the concept of public-key exchange by allowing two parties to establish a shared secret over an insecure channel using computationally asymmetric “puzzle” problems.
  • E. 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.
  • F. None of above. chosen

Provenance (5 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_69a88715dbbc8190b2299e29e955d997 completed March 4, 2026, 7:25 p.m.
NER Named-entity recognition batch_69abb8820cec8190a945e5daeb8c9df6 completed March 7, 2026, 5:32 a.m.
NED1 Entity disambiguation (via context triple) batch_69ae0342ef8c8190b7771076282981c3 completed March 8, 2026, 11:16 p.m.
NEDg Description generation batch_69ae057cc1a08190895031fa6c095f49 completed March 8, 2026, 11:25 p.m.
NED2 Entity disambiguation (via description) batch_69ae0751eff4819086e5469a2c56a24d completed March 8, 2026, 11:33 p.m.
Created at: March 4, 2026, 7:37 p.m.