Triple
T9029425
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Republic Protocol |
E216130
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | Shamir secret sharing |
E195491
|
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: Shamir secret sharing | Statement: [Republic Protocol, uses, Shamir secret sharing]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Shamir secret sharing Context triple: [Republic Protocol, uses, Shamir secret sharing]
-
A.
Shamir secret sharing scheme
chosen
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.
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.
-
D.
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.
-
E.
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.
- 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_69ca83a5fa88819088144801b4dd7245 |
completed | March 30, 2026, 2:07 p.m. |
| NER | Named-entity recognition | batch_69cc6a9bcb508190b58751f1772407d4 |
completed | April 1, 2026, 12:45 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69cfdbc289648190834031537c8ce130 |
completed | April 3, 2026, 3:24 p.m. |
Created at: March 30, 2026, 7:08 p.m.