{"list":"other","total":38,"rows":[{"id":"1706.03762","title":"Attention Is All You Need","created":"2017-06-12","cited_by_count":60361},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"2006.16236","title":"Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention","created":"2020-06-29","cited_by_count":2022},{"id":"2009.14794","title":"Rethinking Attention with Performers","created":"2020-09-30","cited_by_count":1601},{"id":"1703.06114","title":"Deep Sets","created":"2017-03-10","cited_by_count":1421},{"id":"1903.03894","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","created":"2019-03-10","cited_by_count":737},{"id":"2011.04573","title":"Parameterized Explainer for Graph Neural Network","created":"2020-11-09","cited_by_count":426},{"id":"2102.05152","title":"On Explainability of Graph Neural Networks via Subgraph Explorations","created":"2021-02-09","cited_by_count":281},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":184},{"id":"2307.15771","title":"The Hydra Effect: Emergent Self-repair in Language Model Computations","created":"2023-07-28","cited_by_count":156},{"id":"2010.00577","title":"Interpreting Graph Neural Networks for NLP With Differentiable Edge Masking","created":"2020-10-01","cited_by_count":153},{"id":"2403.17806","title":"Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanisms","created":"2024-03-26","cited_by_count":149},{"id":"2104.06643","title":"Generative Causal Explanations for Graph Neural Networks","created":"2021-04-14","cited_by_count":124},{"id":"2301.05062","title":"Tracr: Compiled Transformers as a Laboratory for Interpretability","created":"2023-01-12","cited_by_count":104},{"id":"2002.04138","title":"Explaining Explanations: Axiomatic Feature Interactions for Deep Networks","created":"2020-02-10","cited_by_count":103},{"id":"2305.10498","title":"Edge Directionality Improves Learning on Heterophilic Graphs","created":"2023-05-17","cited_by_count":90},{"id":"2411.06070","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","created":"2024-11-09","cited_by_count":85},{"id":"2310.04625","title":"Copy Suppression: Comprehensively Understanding an Attention Head","created":"2023-10-06","cited_by_count":76},{"id":"2302.14040","title":"Permutation Equivariant Neural Functionals","created":"2023-02-27","cited_by_count":70},{"id":"2104.03514","title":"Low-Complexity Probing via Finding Subnetworks","created":"2021-04-08","cited_by_count":64},{"id":"2406.16778","title":"Finding Transformer Circuits with Edge Pruning","created":"2024-06-24","cited_by_count":60},{"id":"2312.04501","title":"Graph Metanetworks for Processing Diverse Neural Architectures","created":"2023-12-07","cited_by_count":57},{"id":"2507.16991","title":"PyG 2.0: Scalable Learning on Real World Graphs","created":"2025-07-22","cited_by_count":52},{"id":"2406.09519","title":"Talking Heads: Understanding Inter-layer Communication in Transformer Language Models","created":"2024-06-13","cited_by_count":41},{"id":"2402.15390","title":"Explorations of Self-Repair in Language Models","created":"2024-02-23","cited_by_count":39},{"id":"2209.00546","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","created":"2022-09-01","cited_by_count":28},{"id":"2210.13148","title":"Transformers over Directed Acyclic Graphs","created":"2022-10-24","cited_by_count":23},{"id":"2202.10793","title":"PyTorch Geometric Signed Directed: A Software Package on Graph Neural Networks for Signed and Directed Graphs","created":"2022-02-22","cited_by_count":18},{"id":"2603.10090","title":"A Survey of Weight Space Learning: Understanding, Representation, and Generation","created":"2026-03-10","cited_by_count":18},{"id":"2506.14291","title":"Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models","created":"2025-06-17","cited_by_count":17},{"id":"2506.22712","title":"Generalized Linear Mode Connectivity for Transformers","created":"2025-06-28","cited_by_count":16},{"id":"2409.13714","title":"TracrBench: Generating Interpretability Testbeds with Large Language Models","created":"2024-09-07","cited_by_count":5},{"id":"2602.04768","title":"Billion-Scale Graph Foundation Models","created":"2026-02-04","cited_by_count":5},{"id":"2304.10074","title":"Improving Graph Neural Networks on Multi-node Tasks with the Labeling Trick","created":"2023-04-20","cited_by_count":4},{"id":"2411.00835","title":"Scalable Message Passing Neural Networks: No Need for Attention in Large Graph Representation Learning","created":"2024-10-29","cited_by_count":4},{"id":"2602.08857","title":"Discovering Interpretable Algorithms by Decompiling Transformers to RASP","created":"2026-02-09","cited_by_count":4},{"id":"2410.00061","title":"Neural Decompiling of Tracr Transformers","created":"2024-09-29","cited_by_count":2},{"id":"2608.00836","title":"Nonlinear Laplacians Improve Signed-Directed Graph Learning","created":"2026-08-01","cited_by_count":1}],"next_cursor":null}