Pith. sign in

Higher-Order Message Passing for Glycan Representation Learning

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Glycans are the most complex biological sequence, with monosaccharides forming extended, non-linear sequences. As post-translational modifications, they modulate protein structure, function, and interactions. Due to their diversity and complexity, predictive models of glycan properties and functions are still insufficient. Graph Neural Networks (GNNs) are deep learning models designed to process and analyze graph-structured data. These architectures leverage the connectivity and relational information in graphs to learn effective representations of nodes, edges, and entire graphs. Iteratively aggregating information from neighboring nodes, GNNs capture complex patterns within graph data, making them particularly well-suited for tasks such as link prediction or graph classification across domains. This work presents a new model architecture based on combinatorial complexes and higher-order message passing to extract features from glycan structures into a latent space representation. The architecture is evaluated on an improved GlycanML benchmark suite, establishing a new state-of-the-art performance. We envision that these improvements will spur further advances in computational glycosciences and reveal the roles of glycans in biology.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

REJECT 1

roles

background 1

polarities

background 1

representative citing papers

Heat Kernel Goes Topological

cs.LG · 2025-07-16 · reject · novelty 5.0

TopoHKS defines a weighted combinatorial-complex Laplacian and heat kernel descriptor, claiming maximal expressive power; the supporting uniqueness theorem is incorrect.

citing papers explorer

Showing 1 of 1 citing paper.

  • Heat Kernel Goes Topological cs.LG · 2025-07-16 · reject · none · ref 18 · internal anchor

    TopoHKS defines a weighted combinatorial-complex Laplacian and heat kernel descriptor, claiming maximal expressive power; the supporting uniqueness theorem is incorrect.