Pith. sign in

REVIEW 5 cited by

Cell Complex Neural Networks

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 2010.00743 v4 pith:62OROKGB submitted 2020-10-02 cs.LG cs.CGcs.CVmath.ATstat.ML

classification cs.LGcs.CGcs.CVmath.ATstat.ML
keywords cellcomplexescomplexgraphsneuralcellscombinatorialconstruction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Cell complexes are topological spaces constructed from simple blocks called cells. They generalize graphs, simplicial complexes, and polyhedral complexes that form important domains for practical applications. They also provide a combinatorial formalism that allows the inclusion of complicated relationships of restrictive structures such as graphs and meshes. In this paper, we propose \textbf{Cell Complexes Neural Networks (CXNs)}, a general, combinatorial and unifying construction for performing neural network-type computations on cell complexes. We introduce an inter-cellular message passing scheme on cell complexes that takes the topology of the underlying space into account and generalizes message passing scheme to graphs. Finally, we introduce a unified cell complex encoder-decoder framework that enables learning representation of cells for a given complex inside the Euclidean spaces. In particular, we show how our cell complex autoencoder construction can give, in the special case \textbf{cell2vec}, a generalization for node2vec.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Differentiable Lifting for Topological Neural Networks

    cs.LG 2026-08 conditional novelty 6.0 of 10

    A differentiable lifting framework that samples and accepts candidate higher-order cells end-to-end outperforms static liftings on multiple TNN benchmarks.

  2. 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.

  3. CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning

    cs.LG 2025-05 conditional novelty 5.0 of 10

    CellCLAT applies parameter-perturbation contrastive learning to cellular complexes and adaptively trims 2-cells to improve downstream graph classification.

  4. Representing Higher-Order Networks: A Survey of Graph-Based Frameworks

    cs.SI 2026-03 unverdicted novelty 4.0 of 10

    A survey organizing higher-order network formalisms into four families with a master comparison table, plus ~17 new superhypergraph-style definitions whose only supporting theorems are well-definedness checks.

  5. Don't be Afraid of Cell Complexes! An Introduction from an Applied Perspective

    eess.SP 2025-06 conditional novelty 4.0 of 10

    A tutorial that defines cell complexes through boundary matrices and simple cycles, proves this matches topological regular cell complexes up to dimension two, and surveys signal processing and learning applications.

Pith tools