{"total":17,"rows":[{"id":"2102.01350","title":"Graph Coarsening with Neural Networks","created":"2021-02-02","cited_by_count":55,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2310.04470","title":"Hierarchical Multi-Marginal Optimal Transport for Network Alignment","created":"2023-10-06","cited_by_count":24,"area":null},{"id":"2203.14804","title":"Partially Does It: Towards Scene-Level FG-SBIR with Partial Input","created":"2022-03-28","cited_by_count":20,"area":null},{"id":"2107.01952","title":"Partition and Code: learning how to compress graphs","created":"2021-07-05","cited_by_count":10,"area":null},{"id":"2502.19334","title":"Joint Optimal Transport and Embedding for Network Alignment","created":"2025-02-26","cited_by_count":10,"area":null},{"id":"2402.04516","title":"Generalized Sobolev Transport for Probability Measures on a Graph","created":"2024-02-07","cited_by_count":9,"area":null},{"id":"2412.18857","title":"Computing Approximate Graph Edit Distance via Optimal Transport","created":"2024-12-25","cited_by_count":6,"area":null},{"id":"2405.14246","title":"GCondenser: Benchmarking Graph Condensation","created":"2024-05-23","cited_by_count":5,"area":null},{"id":"2106.07106","title":"Alignment and Comparison of Directed Networks via Transition Couplings of Random Walks","created":"2021-06-13","cited_by_count":2,"area":null},{"id":"2306.09613","title":"UTOPIA: Unconstrained Tracking Objects without Preliminary Examination via Cross-Domain Adaptation","created":"2023-06-16","cited_by_count":1,"area":null},{"id":"2310.11762","title":"A Quasi-Wasserstein Loss for Learning Graph Neural Networks","created":"2023-10-18","cited_by_count":1,"area":null},{"id":"2502.00737","title":"Scalable Sobolev IPM for Probability Measures on a Graph","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2205.09738","title":"AIGenC: An AI generalisation model via creativity","created":"2022-05-19","cited_by_count":0,"area":null},{"id":"2502.00739","title":"An Efficient Orlicz-Sobolev Approach for Transporting Unbalanced Measures on a Graph","created":"2025-02-02","cited_by_count":0,"area":null},{"id":"2510.25591","title":"Generalized Sobolev IPM for Graph-Based Measures","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2606.02047","title":"Convex Distance Operator Transport: A Convex and Geometry-Preserving Formulation","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}