{"total":15,"rows":[{"id":"2402.02239","title":"Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein","created":"2024-02-03","cited_by_count":12,"area":null},{"id":"2405.18127","title":"Graph Coarsening with Message-Passing Guarantees","created":"2024-05-28","cited_by_count":9,"area":null},{"id":"2403.08147","title":"Representing Molecules as Random Walks Over Interpretable Grammars","created":"2024-03-13","cited_by_count":7,"area":null},{"id":"2605.08689","title":"Structure-Centric Graph Foundation Model via Geometric Bases","created":"2026-05-09","cited_by_count":5,"area":null},{"id":"2506.11743","title":"Taxonomy of reduction matrices for Graph Coarsening","created":"2025-06-13","cited_by_count":3,"area":null},{"id":"2505.14033","title":"Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening","created":"2025-05-20","cited_by_count":2,"area":null},{"id":"2506.19224","title":"GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing","created":"2025-06-24","cited_by_count":2,"area":null},{"id":"2605.13021","title":"Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2310.03398","title":"Interpolating between Clustering and Dimensionality Reduction with Gromov-Wasserstein","created":"2023-10-05","cited_by_count":0,"area":null},{"id":"2510.16704","title":"Connecting Domains and Contrasting Samples: A Ladder for Domain Generalization","created":"2025-10-19","cited_by_count":0,"area":null},{"id":"2603.29148","title":"Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification","created":"2026-03-31","cited_by_count":0,"area":null},{"id":"2605.28488","title":"Bridging Maximum Likelihood and Optimal Transport for Efficient Inference and Model Selection in Stochastic Block Models","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2607.06646","title":"Diffusion enabled Optimal Transport distances for graph matching","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2607.21885","title":"Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement","created":"2026-07-24","cited_by_count":0,"area":null},{"id":"2608.11016","title":"Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}