Research map / Graph learning / Graph self-supervised learning
Latent Geometry-Driven Network Automata for Complex Network Dismantling
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Benchmarking Structural Inference Methods for Interacting Dynamical Systems with Synthetic Data (NeurIPS 2024 · similarity 0.85)
- Analytical Construction on Geometric Architectures: Transitioning from Static to Temporal Link Prediction (ICML 2025 · similarity 0.85)
- Dynamics of the Transformer Residual Stream: Coupling Spectral Geometry to Network Topology (NeurIPS 2026 · similarity 0.85)
- When Edge Independence Fails: Joint Graph Diffusion with Latent Sociability Priors (NeurIPS 2026 · similarity 0.85)
- Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction (ICML 2024 · similarity 0.85)
- Get a GRIP, this will be a long TRIP: A Quantifiable Long-Range Framework for Verifying Over-squashing (NeurIPS 2026 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
