{"total":17,"rows":[{"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":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","cited_by_count":57,"area":null},{"id":"2205.02261","title":"Group-Invariant Quantum Machine Learning","created":"2022-05-04","cited_by_count":56,"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":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37,"area":null},{"id":"2304.01575","title":"The expressive power of pooling in Graph Neural Networks","created":"2023-04-04","cited_by_count":35,"area":null},{"id":"2105.13099","title":"On the Universality of Graph Neural Networks on Large Random Graphs","created":"2021-05-27","cited_by_count":26,"area":null},{"id":"2209.12313","title":"Random graph matching at Otter's threshold via counting chandeliers","created":"2022-09-25","cited_by_count":25,"area":null},{"id":"2110.05000","title":"Exact Matching of Random Graphs with Constant Correlation","created":"2021-10-11","cited_by_count":23,"area":null},{"id":"2101.11783","title":"Random Graph Matching with Improved Noise Robustness","created":"2021-01-28","cited_by_count":16,"area":null},{"id":"2109.07016","title":"Graph Embedding via Diffusion-Wavelets-Based Node Feature Distribution Characterization","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2109.01494","title":"Computing Graph Descriptors on Edge Streams","created":"2021-09-02","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":"2105.06399","title":"Frequent Pattern Mining in Continuous-time Temporal Networks","created":"2021-05-12","cited_by_count":0,"area":null},{"id":"2106.14481","title":"Complexity-based partitioning of CSFI problem instances with Transformers","created":"2021-06-28","cited_by_count":0,"area":null},{"id":"2111.10183","title":"Computing Graph Edit Distance with Algorithms on Quantum Devices","created":"2021-11-19","cited_by_count":0,"area":null},{"id":"2307.13068","title":"Detection of Common Subtrees with Identical Label Distribution","created":"2023-07-24","cited_by_count":0,"area":null}],"next_cursor":null}