{"list":"other","total":72,"rows":[{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1901.00596","title":"A Comprehensive Survey on Graph Neural Networks","created":"2019-01-03","cited_by_count":2919},{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1611.08097","title":"Geometric deep learning: going beyond Euclidean data","created":"2016-11-24","cited_by_count":1048},{"id":"1905.12265","title":"Strategies for Pre-training Graph Neural Networks","created":"2019-05-29","cited_by_count":971},{"id":"1810.02244","title":"Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks","created":"2018-10-04","cited_by_count":881},{"id":"1802.04364","title":"Junction Tree Variational Autoencoder for Molecular Graph Generation","created":"2018-02-12","cited_by_count":652},{"id":"1809.09401","title":"Hypergraph Neural Networks","created":"2018-09-25","cited_by_count":488},{"id":"1709.05584","title":"Representation Learning on Graphs: Methods and Applications","created":"2017-09-17","cited_by_count":457},{"id":"1812.04202","title":"Deep Learning on Graphs: A Survey","created":"2018-12-11","cited_by_count":393},{"id":"1909.03193","title":"KG-BERT: BERT for Knowledge Graph Completion","created":"2019-09-07","cited_by_count":324},{"id":"2006.09252","title":"Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting","created":"2020-06-16","cited_by_count":313},{"id":"1901.08150","title":"Hypergraph Convolution and Hypergraph Attention","created":"2019-01-23","cited_by_count":228},{"id":"2103.03212","title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","created":"2021-03-04","cited_by_count":221},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218},{"id":"2005.03675","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","created":"2020-05-07","cited_by_count":156},{"id":"2206.00606","title":"Topological Deep Learning: Going Beyond Graph Data","created":"2022-06-01","cited_by_count":97},{"id":"1702.06879","title":"Knowledge Graph Completion via Complex Tensor Factorization","created":"2017-02-22","cited_by_count":80},{"id":"1911.03903","title":"A Re-evaluation of Knowledge Graph Completion Methods","created":"2019-11-10","cited_by_count":73},{"id":"2010.00743","title":"Cell Complex Neural Networks","created":"2020-10-02","cited_by_count":67},{"id":"1711.03438","title":"Open-World Knowledge Graph Completion","created":"2017-11-09","cited_by_count":64},{"id":"2006.12179","title":"Hierarchical Inter-Message Passing for Learning on Molecular Graphs","created":"2020-06-22","cited_by_count":59},{"id":"2010.04558","title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","created":"2020-10-09","cited_by_count":54},{"id":"2010.10728","title":"Heterogeneous Hypergraph Embedding for Graph Classification","created":"2020-10-21","cited_by_count":52},{"id":"1905.08287","title":"Random Walks on Hypergraphs with Edge-Dependent Vertex Weights","created":"2019-05-20","cited_by_count":45},{"id":"2003.08001","title":"Realistic Re-evaluation of Knowledge Graph Completion Methods: An Experimental Study","created":"2020-03-18","cited_by_count":37},{"id":"2209.08179","title":"Cell Attention Networks","created":"2022-09-16","cited_by_count":35},{"id":"1910.09943","title":"Clustering in graphs and hypergraphs with categorical edge labels","created":"2019-10-22","cited_by_count":31},{"id":"2005.05537","title":"GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions","created":"2020-05-12","cited_by_count":29},{"id":"2205.09702","title":"Parallel and Distributed Graph Neural Networks: An In-Depth Concurrency Analysis","created":"2022-05-19","cited_by_count":29},{"id":"1611.05425","title":"ProjE: Embedding Projection for Knowledge Graph Completion","created":"2016-11-16","cited_by_count":26},{"id":"2001.10313","title":"Evolutionary dynamics of higher-order interactions in social networks","created":"2020-01-28","cited_by_count":26},{"id":"2007.12374","title":"A Survey on Graph Neural Networks for Knowledge Graph Completion","created":"2020-07-24","cited_by_count":26},{"id":"1610.06264","title":"Foundations of Modern Query Languages for Graph Databases","created":"2016-10-20","cited_by_count":22},{"id":"1910.09017","title":"Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries","created":"2019-10-20","cited_by_count":22},{"id":"2006.16377","title":"Hypergraph Random Walks, Laplacians, and Clustering","created":"2020-06-29","cited_by_count":20},{"id":"2104.07582","title":"SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems","created":"2021-04-15","cited_by_count":17},{"id":"1911.06523","title":"Random walks on hypergraphs","created":"2019-11-15","cited_by_count":16},{"id":"2009.07659","title":"RDF2Vec Light -- A Lightweight Approach for Knowledge Graph Embeddings","created":"2020-09-16","cited_by_count":16},{"id":"1712.01550","title":"G-CORE: A Core for Future Graph Query Languages","created":"2017-12-05","cited_by_count":13},{"id":"2203.16995","title":"Message Passing Neural Networks for Hypergraphs","created":"2022-03-31","cited_by_count":13},{"id":"1806.01799","title":"Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations","created":"2018-06-05","cited_by_count":12},{"id":"1912.12740","title":"Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems","created":"2019-12-29","cited_by_count":12},{"id":"1609.07008","title":"Scaling betweenness centrality using communication-efficient sparse matrix multiplication","created":"2016-09-22","cited_by_count":11},{"id":"1801.00036","title":"An introduction to Graph Data Management","created":"2017-12-29","cited_by_count":11},{"id":"2010.16012","title":"To Push or To Pull: On Reducing Communication and Synchronization in Graph Computations","created":"2020-10-30","cited_by_count":11},{"id":"1912.08950","title":"Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics","created":"2019-12-18","cited_by_count":10},{"id":"2103.03653","title":"GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra","created":"2021-03-05","cited_by_count":10},{"id":"2311.18526","title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers","created":"2023-11-30","cited_by_count":10},{"id":"2008.11321","title":"High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality","created":"2020-08-26","cited_by_count":8},{"id":"2010.09135","title":"Accelerating Irregular Computations with Hardware Transactional Memory and Active Messages","created":"2020-10-18","cited_by_count":7},{"id":"2010.14684","title":"Substream-Centric Maximum Matchings on FPGA","created":"2020-10-28","cited_by_count":7},{"id":"2109.09663","title":"Parallel Algorithms for Finding Large Cliques in Sparse Graphs","created":"2021-09-20","cited_by_count":7},{"id":"2208.11469","title":"ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations","created":"2022-08-24","cited_by_count":7},{"id":"2406.06022","title":"GraphStorm: all-in-one graph machine learning framework for industry applications","created":"2024-06-10","cited_by_count":7},{"id":"1606.02314","title":"NOUS: Construction and Querying of Dynamic Knowledge Graphs","created":"2016-06-07","cited_by_count":6},{"id":"1801.09303","title":"HONE: Higher-Order Network Embeddings","created":"2018-01-28","cited_by_count":6},{"id":"2010.15879","title":"Log(Graph): A Near-Optimal High-Performance Graph Representation","created":"2020-10-29","cited_by_count":6},{"id":"2001.07747","title":"Enabling Highly-Scalable Remote Memory Access Programming with MPI-3 One Sided","created":"2020-01-21","cited_by_count":5},{"id":"2202.13976","title":"Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching","created":"2022-02-28","cited_by_count":5},{"id":"2305.11162","title":"The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores","created":"2023-05-18","cited_by_count":5},{"id":"2308.12093","title":"Cached Operator Reordering: A Unified View for Fast GNN Training","created":"2023-08-23","cited_by_count":5},{"id":"1908.08590","title":"Network-Accelerated Non-Contiguous Memory Transfers","created":"2019-08-22","cited_by_count":4},{"id":"1507.04383","title":"Scaling Monte Carlo Tree Search on Intel Xeon Phi","created":"2015-07-15","cited_by_count":3},{"id":"1509.08443","title":"Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps","created":"2015-09-28","cited_by_count":3},{"id":"1604.04795","title":"KOGNAC: Efficient Encoding of Large Knowledge Graphs","created":"2016-04-16","cited_by_count":3},{"id":"2010.09852","title":"Evaluating the Cost of Atomic Operations on Modern Architectures","created":"2020-10-19","cited_by_count":3},{"id":"1805.09145","title":"RDF2Vec-based Classification of Ontology Alignment Changes","created":"2018-05-23","cited_by_count":2},{"id":"1810.10932","title":"A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching","created":"2018-10-25","cited_by_count":2},{"id":"1910.03679","title":"Performance Impact of Memory Channels on Sparse and Irregular Algorithms","created":"2019-10-08","cited_by_count":1}],"next_cursor":null}