Pith. sign in

REVIEW 1 cited by

Higher-Order Message Passing for Glycan Representation Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.13467 v3 pith:OMBJBPZU submitted 2024-09-20 cs.LG q-bio.BM

classification cs.LGq-bio.BM
keywords glycangrapharchitecturecomplexdataglycansgnnsgraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Heat Kernel Goes Topological

    cs.LG 2025-07 reject novelty 5.0 of 10

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

Pith tools