Fig. 1

Illustration of the relational information framework developed in this study. Data events are collected by an observer, and pairwise distances between events are calculated to apply Hierarchical clustering, resulting in a dendrogramic tree. Each event in the tree is represented by a binary string or p-adic expansion. Numerical examples demonstrate calculations and 2-adic differences. The set of these strings/p-adic expansions constitutes the relational information between all collected data events, describing the dendrogram’s structure. We compress this relational information set into a 4D parameter space without information loss. Utilizing the information.