Triple

T9958020
Position Surface form Disambiguated ID Type / Status
Subject Shamir secret sharing scheme E195491 entity
Predicate relatedTo P37 FINISHED
Object Blakley secret sharing scheme
The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
E831737 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: Blakley secret sharing scheme | Statement: [Shamir secret sharing scheme, relatedTo, Blakley secret sharing scheme]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Blakley secret sharing scheme
Context triple: [Shamir secret sharing scheme, relatedTo, Blakley secret sharing scheme]
  • A. Shamir secret sharing scheme
    The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
  • B. 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.
  • C. Merkle–Hellman knapsack cryptosystem
    The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
  • D. 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.
  • 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. 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: Blakley secret sharing scheme
Triple: [Shamir secret sharing scheme, relatedTo, Blakley secret sharing scheme]
Generated description
The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Blakley secret sharing scheme
Target entity description: The Blakley secret sharing scheme is a threshold cryptographic method that hides a secret as the intersection point of multiple hyperplanes, requiring a minimum number of shares (hyperplanes) to reconstruct it.
  • A. Shamir secret sharing scheme
    The Shamir secret sharing scheme is a cryptographic method that divides a secret into multiple parts so that only a specified threshold of parts can reconstruct the original secret, while fewer parts reveal nothing.
  • B. 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.
  • C. Merkle–Hellman knapsack cryptosystem
    The Merkle–Hellman knapsack cryptosystem is an early public-key encryption scheme based on the subset sum (knapsack) problem, historically significant as one of the first practical public-key systems though later found to be insecure.
  • D. 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.
  • 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. 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_69ca82eaaa008190a54fa1a9f954b9ad completed March 30, 2026, 2:04 p.m.
NER Named-entity recognition batch_69cdb6cceb608190ad4424afaddcabfa completed April 2, 2026, 12:22 a.m.
NED1 Entity disambiguation (via context triple) batch_69d23d7988948190bae81c1020f2b605 completed April 5, 2026, 10:46 a.m.
NEDg Description generation batch_69d23e6ee6d48190ae724d0ee96b64bf completed April 5, 2026, 10:50 a.m.
NED2 Entity disambiguation (via description) batch_69d23fd274dc8190b7af27cf503d7dc6 completed April 5, 2026, 10:56 a.m.
Created at: March 30, 2026, 8:46 p.m.