Triple
T23131784
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Mikhail Graev |
E577187
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object | Graev metric on free groups |
—
|
NE NERFINISHED |
How this triple was built (3 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: Graev metric on free groups | Statement: [Mikhail Graev, notableWork, Graev metric on free groups]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Graev metric on free groups Context triple: [Mikhail Graev, notableWork, Graev metric on free groups]
-
A.
Gromov’s theorem on groups of polynomial growth
Gromov’s theorem on groups of polynomial growth is a fundamental result in geometric group theory stating that any finitely generated group with polynomial growth is virtually nilpotent.
-
B.
Tarski’s theorem on amenable groups
Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
-
C.
Burger–Iozzi–Wienhard inequalities for higher rank groups
The Burger–Iozzi–Wienhard inequalities for higher rank groups are a family of sharp bounds in bounded cohomology and representation theory that extend the classical Milnor–Wood inequality to representations of surface groups into higher rank Lie groups.
-
D.
Gromov hyperbolic group
A Gromov hyperbolic group is a finitely generated group whose Cayley graph exhibits negative curvature–like properties, leading to rich geometric, dynamical, and algorithmic behavior.
-
E.
Kesten’s theorem on random walks on groups
Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Graev metric on free groups Target entity description: The Graev metric on free groups is a canonical way to extend a given metric on a generating set to a compatible, left-invariant metric on the entire free group, widely used in geometric and topological group theory.
-
A.
Gromov’s theorem on groups of polynomial growth
Gromov’s theorem on groups of polynomial growth is a fundamental result in geometric group theory stating that any finitely generated group with polynomial growth is virtually nilpotent.
-
B.
Tarski’s theorem on amenable groups
Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
-
C.
Burger–Iozzi–Wienhard inequalities for higher rank groups
The Burger–Iozzi–Wienhard inequalities for higher rank groups are a family of sharp bounds in bounded cohomology and representation theory that extend the classical Milnor–Wood inequality to representations of surface groups into higher rank Lie groups.
-
D.
Gromov hyperbolic group
A Gromov hyperbolic group is a finitely generated group whose Cayley graph exhibits negative curvature–like properties, leading to rich geometric, dynamical, and algorithmic behavior.
-
E.
Kesten’s theorem on random walks on groups
Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
- F. None of above. chosen
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_69e245f7b0e481909c473ff4e6a54e2c |
completed | April 17, 2026, 2:38 p.m. |
| NER | Named-entity recognition | batch_69f18e88909881908c695cd7d39d380c |
completed | April 29, 2026, 4:52 a.m. |
Created at: April 17, 2026, 4 p.m.