Triple
T20627466
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Schur algorithm |
E506855
|
entity |
| Predicate | basedOn |
P98
|
FINISHED |
| Object | Schur transformation |
—
|
NE NERFINISHED |
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: Schur transformation | Statement: [Schur algorithm, basedOn, Schur transformation]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Schur transformation Context triple: [Schur algorithm, basedOn, Schur transformation]
-
A.
Schur
Schur is a surname most prominently associated with Michael Schur, the American television writer and producer known for creating and co-creating acclaimed comedy series such as Parks and Recreation and The Good Place.
-
B.
Bogoliubov transformation
The Bogoliubov transformation is a mathematical change of basis used in quantum field theory and many-body physics to diagonalize Hamiltonians by mixing creation and annihilation operators, enabling the description of quasiparticles and phenomena like superconductivity.
-
C.
Schur decomposition
chosen
Schur decomposition is a matrix factorization in linear algebra that expresses a square matrix as a unitary (or orthogonal) matrix times an upper triangular matrix times the inverse of the unitary matrix, revealing its eigenvalues and simplifying many numerical computations.
-
D.
Schur’s lemma
Schur’s lemma is a fundamental result in representation theory stating that any homomorphism between irreducible representations is either zero or an isomorphism, and that endomorphisms of an irreducible representation over an algebraically closed field are scalar multiples of the identity.
-
E.
Schur algorithm
The Schur algorithm is a recursive procedure in complex analysis and operator theory used to construct and analyze Schur functions, playing a key role in interpolation problems and system theory.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e0b4bd4a0081908d4e97a590a33fb2 |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e6abe645888190b639ebedc5b3041a |
completed | April 20, 2026, 10:42 p.m. |
Created at: April 16, 2026, 11:42 a.m.