Triple
T14860119
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Deutsch–Jozsa algorithm |
E349464
|
entity |
| Predicate | generalizationOf |
P2372
|
FINISHED |
| Object | Deutsch algorithm |
E349464
|
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: Deutsch algorithm | Statement: [Deutsch–Jozsa algorithm, generalizationOf, Deutsch algorithm]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Deutsch algorithm Context triple: [Deutsch–Jozsa algorithm, generalizationOf, Deutsch algorithm]
-
A.
Deutsch–Jozsa algorithm
chosen
The Deutsch–Jozsa algorithm is a foundational quantum algorithm that demonstrates how quantum computation can solve certain decision problems exponentially faster than any classical deterministic algorithm.
-
B.
Bernstein–Vazirani algorithm
The Bernstein–Vazirani algorithm is a quantum algorithm that efficiently determines a hidden binary string using a single query to an oracle, illustrating quantum speedup over classical methods.
-
C.
Grover’s algorithm
Grover’s algorithm is a quantum search algorithm that provides a quadratic speedup over classical methods for finding a marked item in an unsorted database.
-
D.
Simon’s algorithm
Simon’s algorithm is a quantum algorithm that efficiently solves a specific type of hidden-period problem, demonstrating an exponential speedup over classical algorithms and paving the way for later breakthroughs like Shor’s algorithm.
-
E.
Benettin algorithm
The Benettin algorithm is a numerical method used in dynamical systems theory to estimate Lyapunov exponents, which quantify the rate of separation of nearby trajectories and indicate chaos.
- 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_69d822ed7e1881909b90fca143ad7e34 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69ded44598e48190b759a05ed2d9ecaf |
completed | April 14, 2026, 11:56 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe6b4f224c8190bb2e06203c9b3a94 |
completed | May 8, 2026, 11:01 p.m. |
Created at: April 10, 2026, 1:54 a.m.