Triple
T14840798
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | François Bruhat |
E348956
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Bruhat order
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.
|
E1121930
|
NE FINISHED |
How this triple was built (4 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: [François Bruhat, notableConcept, Bruhat order]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Bruhat order Context triple: [François Bruhat, notableConcept, Bruhat order]
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Knuth–Bendix order
The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.
-
E.
Weyl group
A Weyl group is a finite reflection group associated with a root system that encodes the symmetries of Lie algebras and Lie groups in representation theory and geometry.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Bruhat order Triple: [François Bruhat, notableConcept, Bruhat order]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Bruhat order Target entity description: 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.
-
A.
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.
-
B.
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.
-
C.
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.
-
D.
Knuth–Bendix order
The Knuth–Bendix order is a well-founded, total, simplification ordering on terms used in automated theorem proving and term rewriting systems to ensure termination and confluence.
-
E.
Weyl group
A Weyl group is a finite reflection group associated with a root system that encodes the symmetries of Lie algebras and Lie groups in representation theory and geometry.
- F. None of above. chosen
Provenance (5 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_69d822ec69008190a9232caa68836872 |
completed | April 9, 2026, 10:06 p.m. |
| NER | Named-entity recognition | batch_69ded28e40f08190b309d8ac6404d2fc |
completed | April 14, 2026, 11:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69fe38a9eb9481908ca509f484007cf6 |
completed | May 8, 2026, 7:25 p.m. |
| NEDg | Description generation | batch_69fe3d0eca948190b107bc593b6e5b72 |
completed | May 8, 2026, 7:44 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69fe3d94785881908911a7c6f1546d45 |
completed | May 8, 2026, 7:46 p.m. |
Created at: April 10, 2026, 1:53 a.m.