A gated recurrent graph architecture that applies minGRU-style gating to node embeddings with Laplacian positional encoding, reporting state-of-the-art on several benchmarks and claiming linear-time long-range dependency modeling.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
GraphMinNet: Learning Dependencies in Graphs with Light Complexity Minimal Architecture
A gated recurrent graph architecture that applies minGRU-style gating to node embeddings with Laplacian positional encoding, reporting state-of-the-art on several benchmarks and claiming linear-time long-range dependency modeling.