“…Here we suggest constructions of universal graphs on which every automorphism can be realized as an adic shift. The study of specific automorphisms has already begun (see the survey [1], and also [2]), but, according to the conclusion of the paper [16] (see also below), the problem of classification of combinatorially definite filtrations is tame, i.e., there is a manageable space of classes, or orbits, or complete metric invariants of such filtrations (see the definition of combinatorial schemes of hierarchies below). This gives a chance to obtain a reasonable combinatorial classification of measure-preserving automorphisms.…”