Triple
T17385732
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Bennett–Brassard 1984 protocol |
E422682
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | quantum key distribution protocol |
C35269
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: quantum key distribution protocol Context triple: [Bennett–Brassard 1984 protocol, instanceOf, quantum key distribution protocol]
-
A.
quantum computing protocol
chosen
A quantum computing protocol is a structured set of rules and operations that leverage quantum mechanical phenomena, such as superposition and entanglement, to perform computational or communication tasks securely and efficiently.
-
B.
cryptographic protocol
A cryptographic protocol is a precisely defined sequence of operations and message exchanges that uses cryptographic primitives to achieve security goals such as confidentiality, integrity, authentication, and non-repudiation between parties.
-
C.
cryptographic protocol framework
A cryptographic protocol framework is a structured set of tools, abstractions, and rules that enables the design, specification, analysis, and implementation of secure communication protocols.
-
D.
cryptographic key
A cryptographic key is a piece of information, usually a string of bits, used by cryptographic algorithms to encrypt, decrypt, sign, or verify data securely.
-
E.
problem in quantum information theory
A problem in quantum information theory is a conceptual or mathematical question concerning how information is represented, processed, transmitted, or measured using quantum mechanical systems and principles.
- F. None of above.
Provenance (1 batch)
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_69d889d710288190bf0f4762801fefae |
completed | April 10, 2026, 5:25 a.m. |
Created at: April 10, 2026, 5:45 a.m.