Triple
T20509218
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Kazhdan–Lusztig theory |
E503515
|
entity |
| Predicate | uses |
P98
|
FINISHED |
| Object | Bruhat order |
—
|
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: Bruhat order | Statement: [Kazhdan–Lusztig theory, uses, Bruhat order]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bruhat order Context triple: [Kazhdan–Lusztig theory, uses, Bruhat order]
-
A.
Bruhat order
chosen
The Bruhat order is a partial order on elements of a Coxeter or Weyl group that plays a central role in algebraic geometry, representation theory, and the study of flag varieties.
-
B.
Bruhat decomposition
Bruhat decomposition is a fundamental result in algebraic group theory that expresses a group as a union of double cosets indexed by elements of its Weyl group, revealing a deep combinatorial structure.
-
C.
Bott–Samelson theorem
The Bott–Samelson theorem is a fundamental result in algebraic topology and geometry that provides a resolution of singularities for Schubert varieties via Bott–Samelson varieties, illuminating the topology and cohomology of flag manifolds.
-
D.
Kazhdan–Lusztig theory
Kazhdan–Lusztig theory is a framework in representation theory and algebraic geometry that studies Hecke algebras and their bases via Kazhdan–Lusztig polynomials, with deep connections to the representation theory of Lie algebras and geometry of Schubert varieties.
-
E.
Gelfand–Tsetlin graph
The Gelfand–Tsetlin graph is a combinatorial structure whose vertices encode interlacing patterns corresponding to representations of unitary groups, organizing the branching of these representations in a graded, graph-theoretic form.
- 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_69e0b4b1e52c8190894281cf7e3283ab |
completed | April 16, 2026, 10:06 a.m. |
| NER | Named-entity recognition | batch_69e69dc9de788190882ce471966ef2b4 |
completed | April 20, 2026, 9:42 p.m. |
Created at: April 16, 2026, 11:36 a.m.