Heterogeneous Sheaf Neural Networks

Alessio Borgi; Fabrizio Silvestri; Francesco Restuccia; Gabriele Onorato; Iulia Duta; Kristjan Tarantelli; Luke Braithwaite; Pietro Li\`o

arxiv: 2409.08036 · v2 · submitted 2024-09-12 · 💻 cs.LG

Heterogeneous Sheaf Neural Networks

Luke Braithwaite , Alessio Borgi , Gabriele Onorato , Kristjan Tarantelli , Iulia Duta , Francesco Restuccia , Fabrizio Silvestri , Pietro Li\`o This is my paper

Pith reviewed 2026-05-23 20:55 UTC · model grok-4.3

classification 💻 cs.LG

keywords heterogeneous graphscellular sheavesgraph neural networksgraph poolingnode classificationlink predictionrecommendation

0 comments

The pith

Cellular sheaves encode type-specific feature spaces on heterogeneous graphs to enable strong performance with up to 10x fewer parameters.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes HetSheaf as a way to handle graphs where nodes and edges come from multiple types and feature spaces. Instead of building specialized layers for each type, it uses cellular sheaves to store local feature spaces (stalks) and their interactions (restriction maps) directly in the representation. Type-conditioned predictors learn the restriction maps, while SheafPool aggregates node stalks into graph-level outputs that stay invariant under basis changes. Experiments show this matches or exceeds prior methods on node classification, graph classification, link prediction, and recommendation tasks.

Core claim

Cellular sheaves provide a topological structure that directly encodes type-specific stalks and learned restriction maps on heterogeneous graphs, allowing a family of sheaf predictors and the SheafPool operator to produce competitive results across multiple tasks while using substantially fewer parameters than architecture-specialized baselines.

What carries the argument

Cellular sheaves whose stalks and restriction maps are conditioned on node and edge types, together with the basis-invariant SheafPool operator for graph-level aggregation.

Load-bearing premise

Cellular sheaves can be placed on any heterogeneous graph so that the type-specific stalks and learned restriction maps together hold all relational information needed for the downstream tasks.

What would settle it

A heterogeneous graph dataset on which HetSheaf matches state-of-the-art accuracy only after the parameter count is increased to the same level as the specialized baselines, or on which the sheaf construction demonstrably loses type-specific relations.

Figures

Figures reproduced from arXiv: 2409.08036 by Alessio Borgi, Fabrizio Silvestri, Francesco Restuccia, Gabriele Onorato, Iulia Duta, Kristjan Tarantelli, Luke Braithwaite, Pietro Li\`o.

**Figure 1.** Figure 1: HETSHEAF: a sheaf-based framework for heterogeneous data. (a) In the standard meta-path approach for heterogeneous GNN, a series of domain-specific meta-paths are extracted from the original heterogeneous graph and then fed into an encoder to generate the latent representations. (b) This is in contrast to the HETSHEAF pipeline, which uses a sheaf to capture the underlying heterogeneity. First, the node fe… view at source ↗

read the original abstract

Heterogeneous graphs, whose nodes and edges may belong to different types and feature spaces, arise in a wide variety of real-world domains such as biology, chemistry and computer networks. Existing methods typically address this heterogeneity by modifying the model architecture itself, which often results in specialized and parameter-intensive designs. To address this issue, we propose HetSheaf, a framework that models heterogeneous relational data through cellular sheaves, which provide a principled topological framework for encoding type-specific local feature spaces and their interactions directly in the data representation. We also introduce a family of heterogeneous sheaf predictors that learn restriction maps conditioned on node and edge types. To enable graph-level predictions, we further propose SheafPool, a graph pooling mechanism that aggregates node representations in stalk space while remaining invariant to local changes of basis, ultimately enabling stalk-space graph-level representations for the first time. HetSheaf achieves strong predictive performance on standard heterogeneous graph benchmarks, over numerous tasks such as node/graph classification, link prediction and recommendation, while reducing by up to 10x the number of parameters with respect to state-of-the-art baselines.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

HetSheaf applies cellular sheaves to heterogeneous graphs with type-conditioned restriction maps and a new SheafPool operator, claiming parameter reductions on standard benchmarks.

read the letter

Colleague, The one thing to know is that this paper takes cellular sheaves and applies them to heterogeneous graphs by making the restriction maps depend on node and edge types, then adds SheafPool to get graph-level representations that stay invariant under basis changes. What stands out as new is the type-conditioned restriction maps and the stalk-space pooling operator. Earlier sheaf GNN work stayed with homogeneous settings, so this is a direct extension to handle multiple types without building separate layers for each. The paper does well by showing how the sheaf structure can encode the different feature spaces and their interactions in the data representation itself. This leads to the reported outcome of matching or exceeding baselines on node and graph classification, link prediction, and recommendation tasks, all while cutting parameters by as much as 10 times. If the experiments back this up, it points to a more unified way to deal with heterogeneity. On the soft spots, the abstract leaves out the actual equations for how the maps are learned and the experimental setup, so it is hard to judge whether the performance holds after proper controls or if the invariance property in SheafPool is as robust as claimed. The assumption that arbitrary heterogeneous graphs can be turned into sheaves without losing key relations is the key one to verify, but the stress-test note indicates no obvious counter-evidence from the material available. The soundness is rated low mainly because of missing details rather than any visible flaw in the logic. This work is aimed at researchers in graph machine learning who are open to topological methods. Someone looking for alternatives to specialized heterogeneous GNN architectures would find it relevant. It is worth bringing to a reading group to walk through the sheaf construction. I think it deserves peer review to get the full derivations and results checked by experts in the area. Best,

Referee Report

2 major / 2 minor

Summary. The manuscript introduces HetSheaf, a framework modeling heterogeneous graphs via cellular sheaves that encode type-specific stalks and interactions directly in the representation. It defines type-conditioned restriction maps for heterogeneous sheaf predictors and proposes the SheafPool operator to produce basis-invariant graph-level representations in stalk space. The central empirical claim is that HetSheaf matches or exceeds state-of-the-art performance on node/graph classification, link prediction, and recommendation benchmarks while using up to 10× fewer parameters.

Significance. If the reported gains and parameter reductions are reproducible, the work supplies a unified topological alternative to architecture-specialized heterogeneous GNNs. The stalk-space pooling mechanism is a concrete technical contribution that could extend to other sheaf-based models. The parameter-efficiency result, if load-bearing and consistently demonstrated, would be a notable practical advantage.

major comments (2)

[Methods] The central modeling claim—that type-specific stalks and learned restriction maps suffice to preserve all relational information without hand-crafted type embeddings—rests on the construction in the methods section; however, no explicit invariance or information-preservation argument (e.g., via a proposition relating the sheaf Laplacian to the heterogeneous adjacency) is supplied to rule out loss of cross-type structure.
[Experiments] Table reporting parameter counts and performance (presumably in the experimental section) claims up to 10× reduction, yet the manuscript provides no ablation isolating the contribution of the sheaf restriction maps versus the base GNN backbone; without this, it is unclear whether the efficiency gain is attributable to the proposed framework or to implementation choices.

minor comments (2)

[Methods] Notation for stalks, restriction maps, and the SheafPool operator should be introduced with a single consistent diagram or table early in the methods section to aid readability.
[Experiments] The abstract states results across “numerous tasks”; the experimental section should include a summary table listing all datasets, tasks, and exact metrics for each baseline to allow direct comparison.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive review and the recommendation for minor revision. We address each major comment below and describe the changes we will incorporate.

read point-by-point responses

Referee: [Methods] The central modeling claim—that type-specific stalks and learned restriction maps suffice to preserve all relational information without hand-crafted type embeddings—rests on the construction in the methods section; however, no explicit invariance or information-preservation argument (e.g., via a proposition relating the sheaf Laplacian to the heterogeneous adjacency) is supplied to rule out loss of cross-type structure.

Authors: We thank the referee for this observation. The type-conditioned restriction maps are constructed precisely to encode cross-type interactions within the stalks, so that the resulting sheaf Laplacian operates on a representation that already incorporates all relational structure. To make the preservation property explicit, we will add a short proposition in the revised methods section establishing that the heterogeneous sheaf Laplacian is information-preserving with respect to the typed adjacency under the given restriction maps. revision: yes
Referee: [Experiments] Table reporting parameter counts and performance (presumably in the experimental section) claims up to 10× reduction, yet the manuscript provides no ablation isolating the contribution of the sheaf restriction maps versus the base GNN backbone; without this, it is unclear whether the efficiency gain is attributable to the proposed framework or to implementation choices.

Authors: We agree that an ablation isolating the role of the learned restriction maps would strengthen the experimental claims. The reported efficiency arises from replacing type-specific architectural components with a single sheaf predictor; nevertheless, we will add an ablation in the revised experimental section that compares the full HetSheaf model against (i) the same backbone with fixed (non-learned) restriction maps and (ii) the unmodified base GNN, thereby clarifying the contribution of the type-conditioned maps. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper presents HetSheaf as a new modeling framework using cellular sheaves on heterogeneous graphs, with type-conditioned restriction maps and SheafPool for pooling. All central claims concern empirical performance gains and parameter reduction on benchmarks; no derivation chain, equations, or fitted parameters are shown that reduce by construction to inputs. No self-citation load-bearing steps or ansatz smuggling appear in the supplied material. The construction is presented as an independent architectural choice whose validity is tested externally via experiments, making the result self-contained against benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

Abstract-only; the ledger is populated from the high-level description only. No explicit free parameters, axioms or invented entities are quantified in the provided text.

axioms (1)

domain assumption Cellular sheaves provide a principled topological framework for encoding type-specific local feature spaces and their interactions directly in the data representation.
Stated as the modeling choice that replaces architecture-level heterogeneity handling.

invented entities (1)

HetSheaf framework and SheafPool operator no independent evidence
purpose: To model heterogeneous relational data and produce basis-invariant graph-level representations
Newly proposed constructs whose independent evidence is not supplied in the abstract.

pith-pipeline@v0.9.0 · 5740 in / 1264 out tokens · 27177 ms · 2026-05-23T20:55:03.164442+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We propose using cellular sheaves to model the heterogeneity in the graph’s underlying topology... Fu⊴e:=(u,v) = Φ(xu, xv, ϕ(u), ϕ(v), ψ(e))
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The sheaf Laplacian of a sheaf (G, F) is defined as LF := δ⊤δ

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Dynamic Sheaf Diffusion Networks with Adaptive Local Structure for Heterogeneous Spatio-Temporal Graph Learning
cs.LG 2026-04 unverdicted novelty 7.0

ST-Sheaf GNN uses time-evolving sheaf restriction maps to model adaptive local structure on spatio-temporal graphs, mitigating oversmoothing and reaching state-of-the-art forecasting accuracy.

Reference graph

Works this paper leans on

54 extracted references · 54 canonical work pages · cited by 1 Pith paper · 7 internal anchors

[1]

On the bottleneck of graph neural networks and its practical impli- cations

Uri Alon and Eran Yahav. On the bottleneck of graph neural networks and its practical impli- cations. In International Conference on Learning Representations, 2021

work page 2021
[2]

Sheaf Neural Networks with Connection Laplacians

Federico Barbero, Cristian Bodnar, Haitz S ´aez de Oc ´ariz Borde, Michael Bronstein, Petar Veliˇckovi´c, and Pietro Li `o. Sheaf Neural Networks with Connection Laplacians. In Pro- ceedings of Topological, Algebraic, and Geometric Learning Workshops 2022 , pages 28–36. PMLR, November 2022

work page 2022
[3]

Sheaf Atten- tion Networks

Federico Barbero, Cristian Bodnar, Haitz S ´aez de Oc´ariz Borde, and Pietro Lio. Sheaf Atten- tion Networks. In NeurIPS 2022 Workshop on Symmetry and Geometry in Neural Representa- tions, November 2022

work page 2022
[4]

Bronstein

Cristian Bodnar, Francesco Di Giovanni, Benjamin Paul Chamberlain, Pietro Lio, and Michael M. Bronstein. Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs. In NeurIPS 2022, May 2022

work page 2022
[5]

A Note on Over-Smoothing for Graph Neural Networks, June 2020

Chen Cai and Yusu Wang. A Note on Over-Smoothing for Graph Neural Networks, June 2020. arXiv:2006.13318

work page arXiv 2020
[6]

Represen- tation Learning for Attributed Multiplex Heterogeneous Network

Yukuo Cen, Xu Zou, Jianwei Zhang, Hongxia Yang, Jingren Zhou, and Jie Tang. Represen- tation Learning for Attributed Multiplex Heterogeneous Network. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD ’19, pages 1358–1368, New York, NY , USA, July 2019. Association for Computing Machinery. ISBN 978-1-4...

work page 2019
[7]

Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi

Ben Chamberlain, James Rowbottom, Maria I. Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi. GRAND: Graph Neural Diffusion. In Proceedings of the 38th International Conference on Machine Learning, pages 1407–1418. PMLR, July 2021

work page 2021
[8]

Principal neighbourhood aggregation for graph nets

Gabriele Corso, Luca Cavalleri, Dominique Beaini, Pietro Li `o, and Petar Veliˇckovi´c. Principal neighbourhood aggregation for graph nets. In Advances in Neural Information Processing Systems, 2020

work page 2020
[9]

Sheaves, Cosheaves and Applications

Justin Curry. Sheaves, Cosheaves and Applications, December 2014. arXiv:1303.3255

work page internal anchor Pith review Pith/arXiv arXiv 2014
[10]

Convolutional Neural Net- works on Graphs with Fast Localized Spectral Filtering

Micha ¨el Defferrard, Xavier Bresson, and Pierre Vandergheynst. Convolutional Neural Net- works on Graphs with Fast Localized Spectral Filtering. In Advances in Neural Information Processing Systems, volume 29. Curran Associates, Inc., 2016

work page 2016
[11]

Chawla, and Ananthram Swami

Yuxiao Dong, Nitesh V . Chawla, and Ananthram Swami. metapath2vec: Scalable Represen- tation Learning for Heterogeneous Networks. In Proceedings of the 23rd ACM SIGKDD In- ternational Conference on Knowledge Discovery and Data Mining, KDD ’17, pages 135–144, New York, NY , USA, August 2017. Association for Computing Machinery. ISBN 978-1-4503- 4887-4

work page 2017
[12]

Sheaf Hypergraph Networks

Iulia Duta, Giulia Cassar `a, Fabrizio Silvestri, and Pietro Lio. Sheaf Hypergraph Networks. In Thirty-seventh Conference on Neural Information Processing Systems, NeurIPS 2023, Novem- ber 2023

work page 2023
[13]

Graph Neural Networks for Social Recommendation

Wenqi Fan, Yao Ma, Qing Li, Yuan He, Eric Zhao, Jiliang Tang, and Dawei Yin. Graph Neural Networks for Social Recommendation. In The World Wide Web Conference, pages 417–426, San Francisco CA USA, May 2019. ACM. ISBN 978-1-4503-6674-8

work page 2019
[14]

Fast Graph Representation Learning with PyTorch Geometric

Matthias Fey and Jan Eric Lenssen. Fast Graph Representation Learning with PyTorch Geo- metric, April 2019. arXiv:1903.02428

work page internal anchor Pith review Pith/arXiv arXiv 2019
[15]

Protein Interface Prediction us- ing Graph Convolutional Networks

Alex Fout, Jonathon Byrd, Basir Shariat, and Asa Ben-Hur. Protein Interface Prediction us- ing Graph Convolutional Networks. In Advances in Neural Information Processing Systems , volume 30. Curran Associates, Inc., 2017. 11

work page 2017
[16]

MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding

Xinyu Fu, Jiani Zhang, Ziqiao Meng, and Irwin King. MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding. In Proceedings of The Web Conference 2020, pages 2331–2341, April 2020

work page 2020
[17]

Neural Message Passing for Quantum Chemistry

Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. Neural Message Passing for Quantum Chemistry, June 2017. arXiv:1704.01212

work page internal anchor Pith review Pith/arXiv arXiv 2017
[18]

Attention Based Spatial-Temporal Graph Convolutional Networks for Traffic Flow Forecasting.Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):922–929, July 2019

Shengnan Guo, Youfang Lin, Ning Feng, Chao Song, and Huaiyu Wan. Attention Based Spatial-Temporal Graph Convolutional Networks for Traffic Flow Forecasting.Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):922–929, July 2019. ISSN 2374-3468

work page 2019
[19]

Topological deep learning: Going beyond graph data,

Mustafa Hajij, Ghada Zamzmi, Theodore Papamarkou, Nina Miolane, Aldo Guzm ´an-S´aenz, Karthikeyan Natesan Ramamurthy, Tolga Birdal, Tamal K. Dey, Soham Mukherjee, Shreyas N. Samaga, Neal Livesay, Robin Walters, Paul Rosen, and Michael T. Schaub. Topological Deep Learning: Going Beyond Graph Data, May 2023. arXiv:2206.00606

work page arXiv 2023
[20]

Hamilton

William L. Hamilton. Graph Representation Learning. Synthesis Lectures on Artificial Intel- ligence and Machine Learning. Springer International Publishing, Cham, 2020. ISBN 978-3- 031-00460-5

work page 2020
[21]

Opinion Dynamics on Discourse Sheaves, May 2020

Jakob Hansen and Robert Ghrist. Opinion Dynamics on Discourse Sheaves, May 2020. arXiv:2005.12798

work page arXiv 2020
[22]

Sheaf-based Positional Encodings for Graph Neural Networks

Yu He, Cristian Bodnar, and Pietro Lio. Sheaf-based Positional Encodings for Graph Neural Networks. In NeurIPS 2023 Workshop on Symmetry and Geometry in Neural Representations, November 2023

work page 2023
[23]

GPT-GNN: Gen- erative Pre-Training of Graph Neural Networks

Ziniu Hu, Yuxiao Dong, Kuansan Wang, Kai-Wei Chang, and Yizhou Sun. GPT-GNN: Gen- erative Pre-Training of Graph Neural Networks. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , KDD ’20, pages 1857– 1867, New York, NY , USA, August 2020. Association for Computing Machinery. ISBN 978- 1-4503-7998-4

work page 2020
[24]

Heterogeneous Graph Transformer, March 2020

Ziniu Hu, Yuxiao Dong, Kuansan Wang, and Yizhou Sun. Heterogeneous Graph Transformer, March 2020. arXiv:2003.01332

work page arXiv 2020
[25]

Kipf and Max Welling

Thomas N. Kipf and Max Welling. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR 2016, November 2016

work page 2016
[26]

Encoding Social Information with Graph Convolutional Net- works forPolitical Perspective Detection in News Media

Chang Li and Dan Goldwasser. Encoding Social Information with Graph Convolutional Net- works forPolitical Perspective Detection in News Media. In Anna Korhonen, David Traum, and Llu´ıs M`arquez, editors, Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 2594–2604, Florence, Italy, July 2019. Association for Com...

work page 2019
[27]

Gated Graph Sequence Neural Networks

Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel. Gated Graph Sequence Neural Networks, September 2017. arXiv:1511.05493

work page internal anchor Pith review Pith/arXiv arXiv 2017
[28]

Are we really making much progress? Revisiting, benchmarking and refining heterogeneous graph neural networks

Qingsong Lv, Ming Ding, Qiang Liu, Yuxiang Chen, Wenzheng Feng, Siming He, Chang Zhou, Jianguo Jiang, Yuxiao Dong, and Jie Tang. Are we really making much progress? Revisiting, benchmarking and refining heterogeneous graph neural networks. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , KDD ’21, pages 1150–1160, New...

work page 2021
[29]

Efficient householder transformation in pytorch, 2021

Anton Obukhov. Efficient householder transformation in pytorch, 2021. URL www.github. com/toshas/torch-householder. Version: 1.0.1, DOI: 10.5281/zenodo.5068733

work page doi:10.5281/zenodo.5068733 2021
[30]

Architectures of Topological Deep Learning: A Survey on Topological Neural Networks, August 2023

Mathilde Papillon, Sophia Sanborn, Mustafa Hajij, and Nina Miolane. Architectures of Topological Deep Learning: A Survey on Topological Neural Networks, August 2023. arXiv:2304.10031

work page arXiv 2023
[31]

Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems, March 2024

Antonio Purificato, Giulia Cassar `a, Federico Siciliano, Pietro Li `o, and Fabrizio Silvestri. Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems, March 2024. arXiv:2304.09097

work page arXiv 2024
[32]

DeepInf: Social Influence Prediction with Deep Learning

Jiezhong Qiu, Jian Tang, Hao Ma, Yuxiao Dong, Kuansan Wang, and Jie Tang. DeepInf: Social Influence Prediction with Deep Learning. In Proceedings of the 24th ACM SIGKDD 12 International Conference on Knowledge Discovery & Data Mining , KDD ’18, pages 2110– 2119, New York, NY , USA, July 2018. Association for Computing Machinery. ISBN 978-1- 4503-5552-0

work page 2018
[33]

Sheaf theory through examples

Daniel Rosiak. Sheaf theory through examples. MIT Press, Cambridge, Massachusetts, 1st ed. edition, 2022. ISBN 978-0-262-36237-5

work page 2022
[34]

Modeling Relational Data with Graph Convolutional Networks

Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling. Modeling Relational Data with Graph Convolutional Networks, October 2017. arXiv:1703.06103

work page internal anchor Pith review Pith/arXiv arXiv 2017
[35]

Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling

Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling. Modeling Relational Data with Graph Convolutional Networks. In Aldo Gangemi, Roberto Navigli, Maria-Esther Vidal, Pascal Hitzler, Rapha¨el Troncy, Laura Hollink, Anna Tordai, and Mehwish Alam, editors, The Semantic Web, pages 593–607, Cham, 2018. Springer...

work page 2018
[36]

A Cellular Description of the Derived Category of a Stratified Space

Allen Dudley Shepard. A Cellular Description of the Derived Category of a Stratified Space . PhD thesis, Brown University, 1985

work page 1985
[37]

Jasper Snoek, Hugo Larochelle, and Ryan P. Adams. Practical Bayesian Optimization of Ma- chine Learning Algorithms, August 2012. arXiv:1206.2944

work page internal anchor Pith review Pith/arXiv arXiv 2012
[38]

Mining Heterogeneous Information Networks: Principles and Methodologies

Yizhou Sun and Jiawei Han. Mining Heterogeneous Information Networks: Principles and Methodologies. Synthesis Lectures on Data Mining and Knowledge Discovery. Springer Inter- national Publishing, Cham, 2012. ISBN 978-3-031-01902-9

work page 2012
[39]

Yu, and Tianyi Wu

Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. PathSim: meta path-based top-K similarity search in heterogeneous information networks. Proc. VLDB Endow., 4(11): 992–1003, August 2011. ISSN 2150-8097

work page 2011
[40]

Attention is All you Need

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is All you Need. In Advances in Neural Infor- mation Processing Systems, volume 30. Curran Associates, Inc., 2017

work page 2017
[41]

Graph Attention Networks

Petar Veli ˇckovi´c, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li `o, and Yoshua Bengio. Graph Attention Networks. In ICLR 2018, February 2018

work page 2018
[42]

Hamilton, Pietro Li`o, Yoshua Bengio, and R

Petar Veli ˇckovi´c, William Fedus, William L. Hamilton, Pietro Li`o, Yoshua Bengio, and R. De- von Hjelm. Deep Graph Infomax. In International Conference on Learning Representations, September 2018

work page 2018
[43]

Yu, and Yanfang Ye

Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Peng Cui, P. Yu, and Yanfang Ye. Heterogeneous Graph Attention Network, March 2019. arXiv:1903.07293

work page arXiv 2019
[44]

Het- erogeneous Graph Attention Network

Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Yanfang Ye, Peng Cui, and Philip S Yu. Het- erogeneous Graph Attention Network. In The World Wide Web Conference, WWW ’19, pages 2022–2032, New York, NY , USA, May 2019. Association for Computing Machinery. ISBN 978-1-4503-6674-8

work page 2022
[45]

Representation Learning on Graphs with Jumping Knowledge Networks

Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. Representation Learning on Graphs with Jumping Knowledge Networks. In Proceedings of the 35th International Conference on Machine Learning , pages 5453–5462. PMLR, July 2018

work page 2018
[46]

Embedding Entities and Relations for Learning and Inference in Knowledge Bases

Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. Embedding Entities and Relations for Learning and Inference in Knowledge Bases, August 2015. arXiv:1412.6575

work page internal anchor Pith review Pith/arXiv arXiv 2015
[47]

MultiSage: Empowering GCN with Contextualized Multi-Embeddings on Web- Scale Multipartite Networks

Carl Yang, Aditya Pal, Andrew Zhai, Nikil Pancha, Jiawei Han, Charles Rosenberg, and Jure Leskovec. MultiSage: Empowering GCN with Contextualized Multi-Embeddings on Web- Scale Multipartite Networks. In Proceedings of the 26th ACM SIGKDD International Confer- ence on Knowledge Discovery & Data Mining , KDD ’20, pages 2434–2443, New York, NY , USA, August ...

work page 2020
[48]

Heterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark.IEEE Trans

Carl Yang, Yuxin Xiao, Yu Zhang, Yizhou Sun, and Jiawei Han. Heterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark.IEEE Trans. on Knowl. and Data Eng., 34(10):4854–4873, October 2022. ISSN 1041-4347. 13

work page 2022
[49]

Session-Based Recommendation with Graph Neural Networks for Repeat Consumption

Gang Yang, Xiaofeng Zhang, and Yueping Li. Session-Based Recommendation with Graph Neural Networks for Repeat Consumption. In Proceedings of the 2020 9th International Con- ference on Computing and Pattern Recognition, ICCPR ’20, pages 519–524, New York, NY , USA, January 2021. Association for Computing Machinery. ISBN 978-1-4503-8783-5

work page 2020
[50]

Graph Transformer Networks

Seongjun Yun, Minbyul Jeong, Raehyun Kim, Jaewoo Kang, and Hyunwoo J Kim. Graph Transformer Networks. In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

work page 2019
[51]

Chuxu Zhang, Dongjin Song, Chao Huang, Ananthram Swami, and Nitesh V . Chawla. Het- erogeneous Graph Neural Network. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , KDD ’19, pages 793–803, New York, NY , USA, July 2019. Association for Computing Machinery. ISBN 978-1-4503-6201-6

work page 2019
[52]

Space4HGNN: A Novel, Modularized and Repro- ducible Platform to Evaluate Heterogeneous Graph Neural Network

Tianyu Zhao, Cheng Yang, Yibo Li, Quan Gan, Zhenyi Wang, Fengqi Liang, Huan Zhao, Yingxia Shao, Xiao Wang, and Chuan Shi. Space4HGNN: A Novel, Modularized and Repro- ducible Platform to Evaluate Heterogeneous Graph Neural Network. InProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’22, ...

work page 2022
[53]

SlotGAT: Slot-based Message Passing for Heterogeneous Graphs

Ziang Zhou, Jieming Shi, Renchi Yang, Yuanhang Zou, and Qing Li. SlotGAT: Slot-based Message Passing for Heterogeneous Graphs. In Proceedings of the 40th International Confer- ence on Machine Learning, pages 42644–42657. PMLR, July 2023

work page 2023
[54]

Relation Structure- Aware Heterogeneous Graph Neural Network

Shichao Zhu, Chuan Zhou, Shirui Pan, Xingquan Zhu, and Bin Wang. Relation Structure- Aware Heterogeneous Graph Neural Network. In 2019 IEEE International Conference on Data Mining (ICDM), pages 1534–1539, November 2019. A Appendix A.1 Experimental Details A.1.1 Datasets Table 5: Statistics of benchmark datasets. Node classification # Nodes # Node types # ...

work page 2019

[1] [1]

On the bottleneck of graph neural networks and its practical impli- cations

Uri Alon and Eran Yahav. On the bottleneck of graph neural networks and its practical impli- cations. In International Conference on Learning Representations, 2021

work page 2021

[2] [2]

Sheaf Neural Networks with Connection Laplacians

Federico Barbero, Cristian Bodnar, Haitz S ´aez de Oc ´ariz Borde, Michael Bronstein, Petar Veliˇckovi´c, and Pietro Li `o. Sheaf Neural Networks with Connection Laplacians. In Pro- ceedings of Topological, Algebraic, and Geometric Learning Workshops 2022 , pages 28–36. PMLR, November 2022

work page 2022

[3] [3]

Sheaf Atten- tion Networks

Federico Barbero, Cristian Bodnar, Haitz S ´aez de Oc´ariz Borde, and Pietro Lio. Sheaf Atten- tion Networks. In NeurIPS 2022 Workshop on Symmetry and Geometry in Neural Representa- tions, November 2022

work page 2022

[4] [4]

Bronstein

Cristian Bodnar, Francesco Di Giovanni, Benjamin Paul Chamberlain, Pietro Lio, and Michael M. Bronstein. Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs. In NeurIPS 2022, May 2022

work page 2022

[5] [5]

A Note on Over-Smoothing for Graph Neural Networks, June 2020

Chen Cai and Yusu Wang. A Note on Over-Smoothing for Graph Neural Networks, June 2020. arXiv:2006.13318

work page arXiv 2020

[6] [6]

Represen- tation Learning for Attributed Multiplex Heterogeneous Network

Yukuo Cen, Xu Zou, Jianwei Zhang, Hongxia Yang, Jingren Zhou, and Jie Tang. Represen- tation Learning for Attributed Multiplex Heterogeneous Network. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD ’19, pages 1358–1368, New York, NY , USA, July 2019. Association for Computing Machinery. ISBN 978-1-4...

work page 2019

[7] [7]

Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi

Ben Chamberlain, James Rowbottom, Maria I. Gorinova, Michael Bronstein, Stefan Webb, and Emanuele Rossi. GRAND: Graph Neural Diffusion. In Proceedings of the 38th International Conference on Machine Learning, pages 1407–1418. PMLR, July 2021

work page 2021

[8] [8]

Principal neighbourhood aggregation for graph nets

Gabriele Corso, Luca Cavalleri, Dominique Beaini, Pietro Li `o, and Petar Veliˇckovi´c. Principal neighbourhood aggregation for graph nets. In Advances in Neural Information Processing Systems, 2020

work page 2020

[9] [9]

Sheaves, Cosheaves and Applications

Justin Curry. Sheaves, Cosheaves and Applications, December 2014. arXiv:1303.3255

work page internal anchor Pith review Pith/arXiv arXiv 2014

[10] [10]

Convolutional Neural Net- works on Graphs with Fast Localized Spectral Filtering

Micha ¨el Defferrard, Xavier Bresson, and Pierre Vandergheynst. Convolutional Neural Net- works on Graphs with Fast Localized Spectral Filtering. In Advances in Neural Information Processing Systems, volume 29. Curran Associates, Inc., 2016

work page 2016

[11] [11]

Chawla, and Ananthram Swami

Yuxiao Dong, Nitesh V . Chawla, and Ananthram Swami. metapath2vec: Scalable Represen- tation Learning for Heterogeneous Networks. In Proceedings of the 23rd ACM SIGKDD In- ternational Conference on Knowledge Discovery and Data Mining, KDD ’17, pages 135–144, New York, NY , USA, August 2017. Association for Computing Machinery. ISBN 978-1-4503- 4887-4

work page 2017

[12] [12]

Sheaf Hypergraph Networks

Iulia Duta, Giulia Cassar `a, Fabrizio Silvestri, and Pietro Lio. Sheaf Hypergraph Networks. In Thirty-seventh Conference on Neural Information Processing Systems, NeurIPS 2023, Novem- ber 2023

work page 2023

[13] [13]

Graph Neural Networks for Social Recommendation

Wenqi Fan, Yao Ma, Qing Li, Yuan He, Eric Zhao, Jiliang Tang, and Dawei Yin. Graph Neural Networks for Social Recommendation. In The World Wide Web Conference, pages 417–426, San Francisco CA USA, May 2019. ACM. ISBN 978-1-4503-6674-8

work page 2019

[14] [14]

Fast Graph Representation Learning with PyTorch Geometric

Matthias Fey and Jan Eric Lenssen. Fast Graph Representation Learning with PyTorch Geo- metric, April 2019. arXiv:1903.02428

work page internal anchor Pith review Pith/arXiv arXiv 2019

[15] [15]

Protein Interface Prediction us- ing Graph Convolutional Networks

Alex Fout, Jonathon Byrd, Basir Shariat, and Asa Ben-Hur. Protein Interface Prediction us- ing Graph Convolutional Networks. In Advances in Neural Information Processing Systems , volume 30. Curran Associates, Inc., 2017. 11

work page 2017

[16] [16]

MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding

Xinyu Fu, Jiani Zhang, Ziqiao Meng, and Irwin King. MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding. In Proceedings of The Web Conference 2020, pages 2331–2341, April 2020

work page 2020

[17] [17]

Neural Message Passing for Quantum Chemistry

Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. Neural Message Passing for Quantum Chemistry, June 2017. arXiv:1704.01212

work page internal anchor Pith review Pith/arXiv arXiv 2017

[18] [18]

Attention Based Spatial-Temporal Graph Convolutional Networks for Traffic Flow Forecasting.Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):922–929, July 2019

Shengnan Guo, Youfang Lin, Ning Feng, Chao Song, and Huaiyu Wan. Attention Based Spatial-Temporal Graph Convolutional Networks for Traffic Flow Forecasting.Proceedings of the AAAI Conference on Artificial Intelligence, 33(01):922–929, July 2019. ISSN 2374-3468

work page 2019

[19] [19]

Topological deep learning: Going beyond graph data,

Mustafa Hajij, Ghada Zamzmi, Theodore Papamarkou, Nina Miolane, Aldo Guzm ´an-S´aenz, Karthikeyan Natesan Ramamurthy, Tolga Birdal, Tamal K. Dey, Soham Mukherjee, Shreyas N. Samaga, Neal Livesay, Robin Walters, Paul Rosen, and Michael T. Schaub. Topological Deep Learning: Going Beyond Graph Data, May 2023. arXiv:2206.00606

work page arXiv 2023

[20] [20]

Hamilton

William L. Hamilton. Graph Representation Learning. Synthesis Lectures on Artificial Intel- ligence and Machine Learning. Springer International Publishing, Cham, 2020. ISBN 978-3- 031-00460-5

work page 2020

[21] [21]

Opinion Dynamics on Discourse Sheaves, May 2020

Jakob Hansen and Robert Ghrist. Opinion Dynamics on Discourse Sheaves, May 2020. arXiv:2005.12798

work page arXiv 2020

[22] [22]

Sheaf-based Positional Encodings for Graph Neural Networks

Yu He, Cristian Bodnar, and Pietro Lio. Sheaf-based Positional Encodings for Graph Neural Networks. In NeurIPS 2023 Workshop on Symmetry and Geometry in Neural Representations, November 2023

work page 2023

[23] [23]

GPT-GNN: Gen- erative Pre-Training of Graph Neural Networks

Ziniu Hu, Yuxiao Dong, Kuansan Wang, Kai-Wei Chang, and Yizhou Sun. GPT-GNN: Gen- erative Pre-Training of Graph Neural Networks. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , KDD ’20, pages 1857– 1867, New York, NY , USA, August 2020. Association for Computing Machinery. ISBN 978- 1-4503-7998-4

work page 2020

[24] [24]

Heterogeneous Graph Transformer, March 2020

Ziniu Hu, Yuxiao Dong, Kuansan Wang, and Yizhou Sun. Heterogeneous Graph Transformer, March 2020. arXiv:2003.01332

work page arXiv 2020

[25] [25]

Kipf and Max Welling

Thomas N. Kipf and Max Welling. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR 2016, November 2016

work page 2016

[26] [26]

Encoding Social Information with Graph Convolutional Net- works forPolitical Perspective Detection in News Media

Chang Li and Dan Goldwasser. Encoding Social Information with Graph Convolutional Net- works forPolitical Perspective Detection in News Media. In Anna Korhonen, David Traum, and Llu´ıs M`arquez, editors, Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 2594–2604, Florence, Italy, July 2019. Association for Com...

work page 2019

[27] [27]

Gated Graph Sequence Neural Networks

Yujia Li, Daniel Tarlow, Marc Brockschmidt, and Richard Zemel. Gated Graph Sequence Neural Networks, September 2017. arXiv:1511.05493

work page internal anchor Pith review Pith/arXiv arXiv 2017

[28] [28]

Are we really making much progress? Revisiting, benchmarking and refining heterogeneous graph neural networks

Qingsong Lv, Ming Ding, Qiang Liu, Yuxiang Chen, Wenzheng Feng, Siming He, Chang Zhou, Jianguo Jiang, Yuxiao Dong, and Jie Tang. Are we really making much progress? Revisiting, benchmarking and refining heterogeneous graph neural networks. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , KDD ’21, pages 1150–1160, New...

work page 2021

[29] [29]

Efficient householder transformation in pytorch, 2021

Anton Obukhov. Efficient householder transformation in pytorch, 2021. URL www.github. com/toshas/torch-householder. Version: 1.0.1, DOI: 10.5281/zenodo.5068733

work page doi:10.5281/zenodo.5068733 2021

[30] [30]

Architectures of Topological Deep Learning: A Survey on Topological Neural Networks, August 2023

Mathilde Papillon, Sophia Sanborn, Mustafa Hajij, and Nina Miolane. Architectures of Topological Deep Learning: A Survey on Topological Neural Networks, August 2023. arXiv:2304.10031

work page arXiv 2023

[31] [31]

Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems, March 2024

Antonio Purificato, Giulia Cassar `a, Federico Siciliano, Pietro Li `o, and Fabrizio Silvestri. Sheaf4Rec: Sheaf Neural Networks for Graph-based Recommender Systems, March 2024. arXiv:2304.09097

work page arXiv 2024

[32] [32]

DeepInf: Social Influence Prediction with Deep Learning

Jiezhong Qiu, Jian Tang, Hao Ma, Yuxiao Dong, Kuansan Wang, and Jie Tang. DeepInf: Social Influence Prediction with Deep Learning. In Proceedings of the 24th ACM SIGKDD 12 International Conference on Knowledge Discovery & Data Mining , KDD ’18, pages 2110– 2119, New York, NY , USA, July 2018. Association for Computing Machinery. ISBN 978-1- 4503-5552-0

work page 2018

[33] [33]

Sheaf theory through examples

Daniel Rosiak. Sheaf theory through examples. MIT Press, Cambridge, Massachusetts, 1st ed. edition, 2022. ISBN 978-0-262-36237-5

work page 2022

[34] [34]

Modeling Relational Data with Graph Convolutional Networks

Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling. Modeling Relational Data with Graph Convolutional Networks, October 2017. arXiv:1703.06103

work page internal anchor Pith review Pith/arXiv arXiv 2017

[35] [35]

Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling

Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling. Modeling Relational Data with Graph Convolutional Networks. In Aldo Gangemi, Roberto Navigli, Maria-Esther Vidal, Pascal Hitzler, Rapha¨el Troncy, Laura Hollink, Anna Tordai, and Mehwish Alam, editors, The Semantic Web, pages 593–607, Cham, 2018. Springer...

work page 2018

[36] [36]

A Cellular Description of the Derived Category of a Stratified Space

Allen Dudley Shepard. A Cellular Description of the Derived Category of a Stratified Space . PhD thesis, Brown University, 1985

work page 1985

[37] [37]

Jasper Snoek, Hugo Larochelle, and Ryan P. Adams. Practical Bayesian Optimization of Ma- chine Learning Algorithms, August 2012. arXiv:1206.2944

work page internal anchor Pith review Pith/arXiv arXiv 2012

[38] [38]

Mining Heterogeneous Information Networks: Principles and Methodologies

Yizhou Sun and Jiawei Han. Mining Heterogeneous Information Networks: Principles and Methodologies. Synthesis Lectures on Data Mining and Knowledge Discovery. Springer Inter- national Publishing, Cham, 2012. ISBN 978-3-031-01902-9

work page 2012

[39] [39]

Yu, and Tianyi Wu

Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, and Tianyi Wu. PathSim: meta path-based top-K similarity search in heterogeneous information networks. Proc. VLDB Endow., 4(11): 992–1003, August 2011. ISSN 2150-8097

work page 2011

[40] [40]

Attention is All you Need

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is All you Need. In Advances in Neural Infor- mation Processing Systems, volume 30. Curran Associates, Inc., 2017

work page 2017

[41] [41]

Graph Attention Networks

Petar Veli ˇckovi´c, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li `o, and Yoshua Bengio. Graph Attention Networks. In ICLR 2018, February 2018

work page 2018

[42] [42]

Hamilton, Pietro Li`o, Yoshua Bengio, and R

Petar Veli ˇckovi´c, William Fedus, William L. Hamilton, Pietro Li`o, Yoshua Bengio, and R. De- von Hjelm. Deep Graph Infomax. In International Conference on Learning Representations, September 2018

work page 2018

[43] [43]

Yu, and Yanfang Ye

Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Peng Cui, P. Yu, and Yanfang Ye. Heterogeneous Graph Attention Network, March 2019. arXiv:1903.07293

work page arXiv 2019

[44] [44]

Het- erogeneous Graph Attention Network

Xiao Wang, Houye Ji, Chuan Shi, Bai Wang, Yanfang Ye, Peng Cui, and Philip S Yu. Het- erogeneous Graph Attention Network. In The World Wide Web Conference, WWW ’19, pages 2022–2032, New York, NY , USA, May 2019. Association for Computing Machinery. ISBN 978-1-4503-6674-8

work page 2022

[45] [45]

Representation Learning on Graphs with Jumping Knowledge Networks

Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. Representation Learning on Graphs with Jumping Knowledge Networks. In Proceedings of the 35th International Conference on Machine Learning , pages 5453–5462. PMLR, July 2018

work page 2018

[46] [46]

Embedding Entities and Relations for Learning and Inference in Knowledge Bases

Bishan Yang, Wen-tau Yih, Xiaodong He, Jianfeng Gao, and Li Deng. Embedding Entities and Relations for Learning and Inference in Knowledge Bases, August 2015. arXiv:1412.6575

work page internal anchor Pith review Pith/arXiv arXiv 2015

[47] [47]

MultiSage: Empowering GCN with Contextualized Multi-Embeddings on Web- Scale Multipartite Networks

Carl Yang, Aditya Pal, Andrew Zhai, Nikil Pancha, Jiawei Han, Charles Rosenberg, and Jure Leskovec. MultiSage: Empowering GCN with Contextualized Multi-Embeddings on Web- Scale Multipartite Networks. In Proceedings of the 26th ACM SIGKDD International Confer- ence on Knowledge Discovery & Data Mining , KDD ’20, pages 2434–2443, New York, NY , USA, August ...

work page 2020

[48] [48]

Heterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark.IEEE Trans

Carl Yang, Yuxin Xiao, Yu Zhang, Yizhou Sun, and Jiawei Han. Heterogeneous Network Representation Learning: A Unified Framework With Survey and Benchmark.IEEE Trans. on Knowl. and Data Eng., 34(10):4854–4873, October 2022. ISSN 1041-4347. 13

work page 2022

[49] [49]

Session-Based Recommendation with Graph Neural Networks for Repeat Consumption

Gang Yang, Xiaofeng Zhang, and Yueping Li. Session-Based Recommendation with Graph Neural Networks for Repeat Consumption. In Proceedings of the 2020 9th International Con- ference on Computing and Pattern Recognition, ICCPR ’20, pages 519–524, New York, NY , USA, January 2021. Association for Computing Machinery. ISBN 978-1-4503-8783-5

work page 2020

[50] [50]

Graph Transformer Networks

Seongjun Yun, Minbyul Jeong, Raehyun Kim, Jaewoo Kang, and Hyunwoo J Kim. Graph Transformer Networks. In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

work page 2019

[51] [51]

Chuxu Zhang, Dongjin Song, Chao Huang, Ananthram Swami, and Nitesh V . Chawla. Het- erogeneous Graph Neural Network. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , KDD ’19, pages 793–803, New York, NY , USA, July 2019. Association for Computing Machinery. ISBN 978-1-4503-6201-6

work page 2019

[52] [52]

Space4HGNN: A Novel, Modularized and Repro- ducible Platform to Evaluate Heterogeneous Graph Neural Network

Tianyu Zhao, Cheng Yang, Yibo Li, Quan Gan, Zhenyi Wang, Fengqi Liang, Huan Zhao, Yingxia Shao, Xiao Wang, and Chuan Shi. Space4HGNN: A Novel, Modularized and Repro- ducible Platform to Evaluate Heterogeneous Graph Neural Network. InProceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR ’22, ...

work page 2022

[53] [53]

SlotGAT: Slot-based Message Passing for Heterogeneous Graphs

Ziang Zhou, Jieming Shi, Renchi Yang, Yuanhang Zou, and Qing Li. SlotGAT: Slot-based Message Passing for Heterogeneous Graphs. In Proceedings of the 40th International Confer- ence on Machine Learning, pages 42644–42657. PMLR, July 2023

work page 2023

[54] [54]

Relation Structure- Aware Heterogeneous Graph Neural Network

Shichao Zhu, Chuan Zhou, Shirui Pan, Xingquan Zhu, and Bin Wang. Relation Structure- Aware Heterogeneous Graph Neural Network. In 2019 IEEE International Conference on Data Mining (ICDM), pages 1534–1539, November 2019. A Appendix A.1 Experimental Details A.1.1 Datasets Table 5: Statistics of benchmark datasets. Node classification # Nodes # Node types # ...

work page 2019