H-SENT Hierarchical SENT
Partition blocks with explicit cross-community edges. Each community's atoms are serialized via a SENT walk with back-edge brackets.
HDT Hierarchical DFS Tokenization
Full tree structure via depth-first traversal with ENTER/EXIT nesting tokens. Intra- and inter-community edges are captured as back-edges.
HDTC HDT with Composition
The most expressive scheme: typed community nodes (ring, functional group, singleton), super-graph of inter-community bonds, and atom-level detail within each block.
H-SENT
HDT
HDTC