Triple
T5570561
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Fermat's little theorem |
E146189
|
entity |
| Predicate | usedIn |
P98
|
FINISHED |
| Object | RSA cryptosystem |
E5909
|
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: RSA cryptosystem | Statement: [Fermat's little theorem, usedIn, RSA cryptosystem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: RSA cryptosystem Context triple: [Fermat's little theorem, usedIn, RSA cryptosystem]
-
A.
RSA
chosen
RSA is a widely used public-key cryptographic algorithm that enables secure key exchange and digital signatures in many internet security protocols.
-
B.
RSA
RSA is the three-letter World Rugby trigram used to represent the South Africa national rugby union team in international competitions and official records.
-
C.
RSA Security
RSA Security is a pioneering American cybersecurity company best known for its contributions to public-key cryptography and secure data encryption technologies.
-
D.
RSA Fellowship
The RSA Fellowship is a global community of accomplished individuals from diverse fields who collaborate to address social challenges and promote innovative solutions for the public good.
-
E.
ElGamal
ElGamal is a public-key cryptosystem based on the discrete logarithm problem, widely used for secure encryption and digital signatures in various cryptographic 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_69c008ffed108190a084602227af6157 |
completed | March 22, 2026, 3:21 p.m. |
| NER | Named-entity recognition | batch_69c020502a288190af37f9ebb88fccae |
completed | March 22, 2026, 5:01 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c0284bb71881908c0ac4ea2a302327 |
completed | March 22, 2026, 5:35 p.m. |
Created at: March 22, 2026, 3:37 p.m.