{"total":104,"rows":[{"id":"2302.08043","title":"GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks","created":"2023-02-16","cited_by_count":167,"area":null},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122,"area":null},{"id":"2201.07083","title":"A Short Tutorial on The Weisfeiler-Lehman Test And Its Variants","created":"2022-01-18","cited_by_count":52,"area":null},{"id":"2210.01906","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","created":"2022-10-04","cited_by_count":41,"area":null},{"id":"2106.01098","title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","created":"2021-06-02","cited_by_count":39,"area":null},{"id":"2311.15317","title":"Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphs","created":"2023-11-26","cited_by_count":39,"area":null},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37,"area":null},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37,"area":null},{"id":"2206.07023","title":"SBERT studies Meaning Representations: Decomposing Sentence Embeddings into Explainable Semantic Features","created":"2022-06-14","cited_by_count":33,"area":null},{"id":"2110.15529","title":"Topological Relational Learning on Graphs","created":"2021-10-29","cited_by_count":27,"area":null},{"id":"2110.02753","title":"Semi-relaxed Gromov-Wasserstein divergence with applications on graphs","created":"2021-10-06","cited_by_count":21,"area":null},{"id":"2305.06993","title":"SMATCH++: Standardized and Extended Evaluation of Semantic Graphs","created":"2023-05-11","cited_by_count":21,"area":null},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20,"area":null},{"id":"2104.02995","title":"Theoretically Improving Graph Neural Networks via Anonymous Walk Graph Kernels","created":"2021-04-07","cited_by_count":19,"area":null},{"id":"2105.05911","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","created":"2021-05-12","cited_by_count":19,"area":null},{"id":"2301.12906","title":"Curvature Filtrations for Graph Generative Model Evaluation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2211.02904","title":"HAQJSK: Hierarchical-Aligned Quantum Jensen-Shannon Kernels for Graph Classification","created":"2022-11-05","cited_by_count":18,"area":null},{"id":"2108.11949","title":"Weisfeiler-Leman in the BAMBOO: Novel AMR Graph Metrics and a Benchmark for AMR Graph Similarity","created":"2021-08-26","cited_by_count":16,"area":null},{"id":"2202.02495","title":"Weisfeiler-Lehman meets Gromov-Wasserstein","created":"2022-02-05","cited_by_count":14,"area":null},{"id":"2408.11370","title":"Graph Classification via Reference Distribution Learning: Theory and Practice","created":"2024-08-21","cited_by_count":11,"area":null},{"id":"2101.08104","title":"A Generalized Weisfeiler-Lehman Graph Kernel","created":"2021-01-20","cited_by_count":9,"area":null},{"id":"2112.05872","title":"SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddings","created":"2021-12-11","cited_by_count":9,"area":null},{"id":"2203.04711","title":"On a linear fused Gromov-Wasserstein distance for graph structured data","created":"2022-03-09","cited_by_count":9,"area":null},{"id":"2205.10914","title":"Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited","created":"2022-05-22","cited_by_count":9,"area":null},{"id":"2205.15059","title":"Hilbert Curve Projection Distance for Distribution Comparison","created":"2022-05-30","cited_by_count":9,"area":null},{"id":"2210.06461","title":"Better Smatch = Better Parser? AMR evaluation is not so simple anymore","created":"2022-10-12","cited_by_count":9,"area":null},{"id":"2406.19244","title":"Improving the Expressiveness of $K$-hop Message-Passing GNNs by Injecting Contextualized Substructure Information","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2106.04739","title":"Learning subtree pattern importance for Weisfeiler-Lehmanbased graph kernels","created":"2021-06-08","cited_by_count":8,"area":null},{"id":"2110.11862","title":"Graph Filtration Kernels","created":"2021-10-22","cited_by_count":8,"area":null},{"id":"2110.02722","title":"Graphon based Clustering and Testing of Networks: Algorithms and Theory","created":"2021-10-06","cited_by_count":7,"area":null},{"id":"2211.02501","title":"Weisfeiler and Leman go Hyperbolic: Learning Distance Preserving Node Representations","created":"2022-11-04","cited_by_count":7,"area":null},{"id":"2302.00713","title":"The Weisfeiler-Lehman Distance: Reinterpretation and Connection with GNNs","created":"2023-02-01","cited_by_count":7,"area":null},{"id":"2402.03838","title":"Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels","created":"2024-02-06","cited_by_count":7,"area":null},{"id":"2309.14091","title":"On the Benefit of Optimal Transport for Curriculum Reinforcement Learning","created":"2023-09-25","cited_by_count":6,"area":null},{"id":"2111.02842","title":"Adversarial Attacks on Graph Classification via Bayesian Optimisation","created":"2021-11-04","cited_by_count":5,"area":null},{"id":"2209.09048","title":"Gradual Weisfeiler-Leman: Slow and Steady Wins the Race","created":"2022-09-19","cited_by_count":5,"area":null},{"id":"2301.06794","title":"Subgraph Centralization: A Necessary Step for Graph Anomaly Detection","created":"2023-01-17","cited_by_count":5,"area":null},{"id":"2307.01770","title":"Fast Optimal Transport through Sliced Wasserstein Generalized Geodesics","created":"2023-07-04","cited_by_count":5,"area":null},{"id":"2406.07314","title":"Rethinking the impact of noisy labels in graph classification: A utility and privacy perspective","created":"2024-06-11","cited_by_count":5,"area":null},{"id":"2410.24080","title":"Graph Learning for Numeric Planning","created":"2024-10-31","cited_by_count":5,"area":null},{"id":"2103.03892","title":"Set Representation Learning with Generalized Sliced-Wasserstein Embeddings","created":"2021-03-05","cited_by_count":4,"area":null},{"id":"2207.04216","title":"Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees","created":"2022-07-09","cited_by_count":4,"area":null},{"id":"2306.03770","title":"Graph Classification Gaussian Processes via Spectral Features","created":"2023-06-06","cited_by_count":4,"area":null},{"id":"2312.11927","title":"Empowering Dual-Level Graph Self-Supervised Pretraining with Motif Discovery","created":"2023-12-19","cited_by_count":4,"area":null},{"id":"2405.03706","title":"Improving Graph Machine Learning Performance Through Feature Augmentation Based on Network Control Theory","created":"2024-05-03","cited_by_count":4,"area":null},{"id":"2105.14364","title":"Graph Similarity Description: How Are These Graphs Similar?","created":"2021-05-29","cited_by_count":3,"area":null},{"id":"2206.01008","title":"Approximate Network Motif Mining Via Graph Learning","created":"2022-06-02","cited_by_count":3,"area":null},{"id":"2301.13764","title":"Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification","created":"2023-01-31","cited_by_count":3,"area":null},{"id":"2302.02369","title":"Deep Graph-Level Clustering Using Pseudo-Label-Guided Mutual Information Maximization Network","created":"2023-02-05","cited_by_count":3,"area":null},{"id":"2208.13427","title":"The PWLR Graph Representation: A Persistent Weisfeiler-Lehman scheme with Random Walks for Graph Classification","created":"2022-08-29","cited_by_count":2,"area":null},{"id":"2302.08621","title":"Distances for Markov Chains, and Their Differentiation","created":"2023-02-16","cited_by_count":2,"area":null},{"id":"2408.12659","title":"Disentangled Structural and Featural Representation for Task-Agnostic Graph Valuation","created":"2024-08-22","cited_by_count":2,"area":null},{"id":"2505.13087","title":"Graph Alignment for Benchmarking Graph Neural Networks and Learning Positional Encodings","created":"2025-05-19","cited_by_count":2,"area":null},{"id":"2506.02203","title":"Constrained Sliced Wasserstein Embedding","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2104.04787","title":"Smart Vectorizations for Single and Multiparameter Persistence","created":"2021-04-10","cited_by_count":1,"area":null},{"id":"2105.11016","title":"Revisiting 2D Convolutional Neural Networks for Graph-based Applications","created":"2021-05-23","cited_by_count":1,"area":null},{"id":"2110.02554","title":"A Regularized Wasserstein Framework for Graph Kernels","created":"2021-10-06","cited_by_count":1,"area":null},{"id":"2205.13846","title":"On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gaps","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2206.00979","title":"Multi-scale Wasserstein Shortest-path Graph Kernels for Graph Classification","created":"2022-06-02","cited_by_count":1,"area":null},{"id":"2208.04929","title":"Literature Review: Graph Kernels in Chemoinformatics","created":"2022-08-09","cited_by_count":1,"area":null},{"id":"2209.12727","title":"A Simple Way to Learn Metrics Between Attributed Graphs","created":"2022-09-26","cited_by_count":1,"area":null},{"id":"2303.03396","title":"AERK: Aligned Entropic Reproducing Kernels through Continuous-time Quantum Walks","created":"2023-03-04","cited_by_count":1,"area":null},{"id":"2305.07580","title":"Fisher Information Embedding for Node and Graph Learning","created":"2023-05-12","cited_by_count":1,"area":null},{"id":"2309.03616","title":"Filtration Surfaces for Dynamic Graph Classification","created":"2023-09-07","cited_by_count":1,"area":null},{"id":"2410.01778","title":"TopER: Topological Embeddings in Graph Representation Learning","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2410.15721","title":"Learning signals defined on graphs with optimal transport and Gaussian process regression","created":"2024-10-21","cited_by_count":1,"area":null},{"id":"2410.17579","title":"Bonsai: Gradient-free Graph Condensation for Node Classification","created":"2024-10-23","cited_by_count":1,"area":null},{"id":"2410.23748","title":"Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networks","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2411.00577","title":"WLPlan: Relational Features for Symbolic Planning","created":"2024-11-01","cited_by_count":1,"area":null},{"id":"2412.02181","title":"Generalizing Weisfeiler-Lehman Kernels to Subgraphs","created":"2024-12-03","cited_by_count":1,"area":null},{"id":"2503.15853","title":"Network Embedding Exploration Tool (NEExT)","created":"2025-03-20","cited_by_count":1,"area":null},{"id":"2505.00574","title":"Transition States Energies from Machine Learning: An Application to Reverse Water-Gas Shift on Single-Atom Alloys","created":"2025-05-01","cited_by_count":1,"area":null},{"id":"2505.12129","title":"Metric Graph Kernels via the Tropical Torelli Map","created":"2025-05-17","cited_by_count":1,"area":null},{"id":"2603.02025","title":"Revealing Combinatorial Reasoning of GNNs via Graph Concept Bottleneck Layer","created":"2026-03-02","cited_by_count":1,"area":"lr"},{"id":"2607.28259","title":"TopoFormer: Topology Meets Attention for Graph Learning","created":"2026-07-30","cited_by_count":1,"area":null},{"id":"2106.07501","title":"Balanced Coarsening for Multilevel Hypergraph Partitioning via Wasserstein Discrepancy","created":"2021-06-14","cited_by_count":0,"area":null},{"id":"2107.06262","title":"Learning Aesthetic Layouts via Visual Guidance","created":"2021-07-13","cited_by_count":0,"area":null},{"id":"2202.03884","title":"GraphDCA -- a Framework for Node Distribution Comparison in Real and Synthetic Graphs","created":"2022-02-08","cited_by_count":0,"area":null},{"id":"2205.15555","title":"Graph-level Neural Networks: Current Progress and Future Directions","created":"2022-05-31","cited_by_count":0,"area":null},{"id":"2210.00415","title":"Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies","created":"2022-10-02","cited_by_count":0,"area":null},{"id":"2212.05228","title":"QESK: Quantum-based Entropic Subtree Kernels for Graph Classification","created":"2022-12-10","cited_by_count":0,"area":null},{"id":"2306.10505","title":"Structure-Sensitive Graph Dictionary Embedding for Graph Classification","created":"2023-06-18","cited_by_count":0,"area":null},{"id":"2310.16123","title":"Anchor Space Optimal Transport as a Fast Solution to Multiple Optimal Transport Problems","created":"2023-10-24","cited_by_count":0,"area":null},{"id":"2311.13147","title":"Optimal Transport with Cyclic Symmetry","created":"2023-11-22","cited_by_count":0,"area":null},{"id":"2403.16130","title":"AKBR: Learning Adaptive Kernel-based Representations for Graph Classification","created":"2024-03-24","cited_by_count":0,"area":null},{"id":"2403.17995","title":"Semi-Supervised Image Captioning Considering Wasserstein Graph Matching","created":"2024-03-26","cited_by_count":0,"area":null},{"id":"2405.05545","title":"Deep Hierarchical Graph Alignment Kernels","created":"2024-05-09","cited_by_count":0,"area":null},{"id":"2406.10500","title":"A Spectral Framework for Evaluating Geodesic Distances Between Graphs","created":"2024-06-15","cited_by_count":0,"area":null},{"id":"2503.14357","title":"Wasserstein-based Kernel Principal Component Analysis for Clustering Applications","created":"2025-03-18","cited_by_count":0,"area":null},{"id":"2505.14005","title":"Towards Comprehensive and Prerequisite-Free Explainer for Graph Neural Networks","created":"2025-05-20","cited_by_count":0,"area":null},{"id":"2505.24642","title":"WILTing Trees: Interpreting the Distance Between MPNN Embeddings","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2506.09682","title":"Wasserstein Hypergraph Neural Network","created":"2025-06-11","cited_by_count":0,"area":null},{"id":"2507.15195","title":"Feature Construction Using Network Control Theory and Rank Encoding for Graph Machine Learning","created":"2025-07-21","cited_by_count":0,"area":null},{"id":"2511.21566","title":"A decoupled alignment kernel for peptide membrane permeability predictions","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2601.19718","title":"Rethinking Divisive Hierarchical Clustering from a Distributional Perspective","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.10708","title":"Interpretable Graph-Level Anomaly Detection via Contrast with Normal Prototypes","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2602.13634","title":"Optimization-Free Graph Embedding via Distributional Kernel for Community Detection","created":"2026-02-14","cited_by_count":0,"area":null},{"id":"2603.07521","title":"SketchGraphNet: A Memory-Efficient Hybrid Graph Transformer for Large-Scale Sketch Corpora Recognition","created":"2026-03-08","cited_by_count":0,"area":null},{"id":"2605.13932","title":"Learning to Select Source Domains: Proxy-Rewarded Policy Optimization for Molecular OOD Generalization","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2607.16245","title":"Learning Structural Manipulability in Gate-Level Netlists Using Graph Neural Networks","created":"2026-06-26","cited_by_count":0,"area":null}],"next_cursor":"100"}