Original: MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian
Revised: MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian

Original: Abstract
Revised: Abstract

Original: Signed and directed networks are ubiquitous in real-world applications.
Revised: Signed and directed networks are ubiquitous in real-world applications.

Original: However, there has been relatively little work proposing spectral graph neural networks (GNNs) for such networks.
Revised: However, there has been relatively little work proposing spectral graph neural networks (GNNs) for such networks.

Original: Here we introduce a signed directed Laplacian matrix, which we call the magnetic signed Laplacian, as a natural generalization of both the signed Laplacian on signed graphs and the magnetic Laplacian on directed graphs.
Revised: Here we introduce a signed directed Laplacian matrix, which we call the magnetic signed Laplacian, as a natural generalization of both the signed Laplacian on signed graphs and the magnetic Laplacian on directed graphs.

Original: We then use this matrix to construct a novel efficient spectral GNN architecture and conduct extensive experiments on both node clustering and link prediction tasks.
Revised: We then use this matrix to construct a novel efficient spectral GNN architecture and conduct extensive experiments on both node clustering and link prediction tasks.

Original: In these experiments, we consider tasks related to signed information, tasks related to directional information, and tasks related to both signed and directional information.
Revised: In these experiments, we consider tasks related to signed information, tasks related to directional information, and tasks related to both signed and directional information.

Original: We demonstrate that our proposed spectral GNN is effective for incorporating both signed and directional information, and attains leading performance on a wide range of data sets.
Revised: We demonstrate that our proposed spectral GNN is effective for incorporating both signed and directional information, and attains leading performance on a wide range of data sets.

Original: Additionally, we provide a novel synthetic network model, which we refer to as the signed directed stochastic block model, and a number of novel real-world data sets based on lead-lag relationships in financial time series.
Revised: Additionally, we provide a novel synthetic network model, which we refer to as the signed directed stochastic block model, and a number of novel real-world data sets based on lead-lag relationships in financial time series.

Original:  Introduction
Revised:  Introduction

Original: Graph Neural Networks (GNNs) have emerged as a powerful tool for extracting information from graph-structured data and have achieved state-of-the-art performance on a variety of machine learning tasks.
Revised: Graph Neural Networks (GNNs) have emerged as a powerful tool for extracting information from graph-structured data and have achieved state-of-the-art performance on a variety of machine learning tasks.

Original: However, compared to research on constructing GNNs for unsigned and undirected graphs, and graphs with multiple types of edges, GNNs for graphs where the edges have a natural notion of sign, direction, or both, have received relatively little attention.
Revised: However, compared to research on constructing GNNs for unsigned and undirected graphs, and graphs with multiple types of edges, GNNs for graphs where the edges have a natural notion of sign, direction, or both, have received relatively little attention.

Original: There is a demand for such tools because many important and interesting phenomena are naturally modeled as signed and/or directed graphs, i e., graphs in which objects may have either positive or negative relationships, and/or in which such relationships are not necessarily symmetric [1].
Revised: There is a demand for such tools because many important and interesting phenomena are naturally modeled as signed and/or directed graphs, i e., graphs in which objects may have either positive or negative relationships and/or in which such relationships are not necessarily symmetric [1].

Original: For example, in the analysis of social networks, positive and negative edges could model friendship or enmity, and directional information could model the influence of one person on another [2, 3].
Revised: For example, in the analysis of social networks, positive and negative edges could model friendship or enmity, and directional information could model the influence of one person on another [2, 3].

Original: Signed/directed networks also arise when analyzing time-series data with lead-lag relationships [4], detecting influential groups in social networks [5], and computing rankings from pairwise comparisons [6].
Revised: Signed/directed networks also arise when analyzing time-series data with lead-lag relationships [4], detecting influential groups in social networks [5], and computing rankings from pairwise comparisons [6].

Original: Additionally, signed and directed networks are a natural model for group conflict analysis [7], modeling the interaction network of the agents during a rumor spreading process [8], and maximizing positive influence while formulating opinions [9].
Revised: Additionally, signed and directed networks are a natural model for group conflict analysis [7], modeling the interaction network of the agents during a rumor spreading process [8], and maximizing positive influence while formulating opinions [9].

Original: In general, most GNNs are either spectral or spatial.
Revised: In general, most GNNs are either spectral or spatial.

Original: Spatial methods typically define convolution on graphs as a localized aggregation whereas spectral methods rely on the eigen-decomposition of a suitable graph Laplacian.
Revised: Spatial methods typically define convolution on graphs as a localized aggregation whereas spectral methods rely on the eigen-decomposition of a suitable graph Laplacian.

Original: Our goal is to introduce a novel Laplacian and an associated GNN for  signed directed graphs.
Revised: Our goal is to introduce a novel Laplacian and an associated GNN for He et signed directed graphs.

Original: While several spatial GNNs exist, such as SDGNN [3], SiGAT [10], SNEA [11], and SSSNET [12] for signed (and possibly directed) networks, this is one of the first works to propose a spectral GNN for such networks.
Revised: While several spatial GNNs exist, such as SDGNN [3], SiGAT [10], SNEA [11], and SSSNET [12] for signed (and possibly directed) networks, this is one of the first works to propose a spectral GNN for such networks.

Original: We devote special attention to the concurrent preprint
Revised: We devote special attention to the concurrent preprint

Original: SigMaNet [13] which also constructs a spectral GNN based on a different Laplacian.
Revised: SigMaNet [13] which also constructs a spectral GNN based on a different Laplacian.

Original: A principal challenge in extending traditional spectral GNNs to this setting is to define a proper notion of the signed, directed graph Laplacian.
Revised: A principal challenge in extending traditional spectral GNNs to this setting is to define a proper notion of the signed, directed graph Laplacian.

Original: Such a Laplacian should be positive semidefinite, have a bounded spectrum when properly normalized, and encode information about both the sign and direction of each edge.
Revised: Such a Laplacian should be positive semidefinite, have a bounded spectrum when properly normalized, and encode information about both the sign and direction of each edge.

Original: Here, we unify the magnetic Laplacian, which has been used in [14] to construct a GNN on an (unsigned) directed graph, with a signed Laplacian which has been used for a variety of data science tasks on (undirected) signed graphs [15–18].
Revised: Here, we unify the magnetic Laplacian, which has been used in [14] to construct a GNN on an (unsigned) directed graph, with a signed Laplacian which has been used for a variety of data science tasks on (undirected) signed graphs [15–18].

Original: Importantly, our proposed matrix, which we refer to as the magnetic signed Laplacian , reduces to either the magnetic Laplacian or the signed Laplacian when the graph is directed, but not signed, or signed, but not directed.
Revised: Importantly, our proposed matrix, which we refer to as the magnetic signed Laplacian , reduces to either the magnetic Laplacian or the signed Laplacian when the graph is directed, but not signed, or signed, but not directed.

Original: Although this magnetic signed Laplacian is fairly straightforward to obtain, it is novel and surprisingly powerful: We show that our proposed M agnetic S igned GNN (MSGNN) is effective for a variety of node clustering and link prediction tasks.
Revised: Although this magnetic signed Laplacian is fairly straightforward to obtain, it is novel and surprisingly powerful: We show that our proposed M agnetic S igned GNN (MSGNN) is effective for a variety of node clustering and link prediction tasks.

Original: Specifically, we consider several variations of the link prediction task, some of which prioritize signed information over directional information, some of which prioritize directional information over signed information, while others emphasize the method’s ability to extract both signed and directional information simultaneously.
Revised: Specifically, we consider several variations of the link prediction task, some of which prioritize signed information over directional information, some of which prioritize directional information over signed information, while others emphasize the method’s ability to extract both signed and directional information simultaneously.

Original: In addition to testing MSGNN on established data sets, we also devise a novel synthetic model which we call the Signed Directed Stochastic Block Model (SDSBM) , which generalizes both the (undirected)
Revised: In addition to testing MSGNN on established data sets, we also devise a novel synthetic model which we call the Signed Directed Stochastic Block Model (SDSBM) , which generalizes both the (undirected)

Original: Signed Stochastic Block Model from [12] and the (unsigned) Directed Stochastic Block Model from [5].
Revised: Signed Stochastic Block Model from [12] and the (unsigned) Directed Stochastic Block Model from [5].

Original: Analogous to these previous models, our SDSBM can be defined by a meta-graph structure and additional parameters describing density and noise levels.
Revised: Analogous to these previous models, our SDSBM can be defined by a meta-graph structure and additional parameters describing density and noise levels.

Original: We also introduce a number of signed directed networks for link prediction tasks using lead-lag relationships in real-world financial time series.
Revised: We also introduce a number of signed directed networks for link prediction tasks using lead-lag relationships in real-world financial time series.

Original: Main Contributions.
Revised: Main Contributions.

Original: The main contributions of our work are:
Revised: The main contributions of our work are:

Original: We devise a novel matrix called the magnetic signed Laplacian, which can naturally be applied to signed and directed networks.
Revised: We devise a novel matrix called the magnetic signed Laplacian, which can naturally be applied to signed and directed networks.

Original: The magnetic signed Laplacian is Hermitian, positive semidefinite, and the eigenvalues of its normalized counterpart lie in [0 , 2] .
Revised: The magnetic signed Laplacian is Hermitian, positive semidefinite, and the eigenvalues of its normalized counterpart lie in [0 , 2] .

Original: Our proposed Laplacian matrix and its counterpart reduce to existing Laplacians when the network is unsigned and/or undirected.
Revised: Our proposed Laplacian matrix and its counterpart reduce to existing Laplacians when the network is unsigned and/or undirected.

Original: We propose an efficient spectral graph neural network architecture, MSGNN, based on this magnetic signed Laplacian, which attains leading performance on extensive node clustering and link prediction tasks, including novel tasks that consider edge sign and directionality jointly.
Revised: We propose an efficient spectral graph neural network architecture, MSGNN, based on this magnetic signed Laplacian, which attains leading performance on extensive node clustering and link prediction tasks, including novel tasks that consider edge sign and directionality jointly.

Original: To the best of our knowledge, this is the first work to evaluate GNNs on tasks that are related to both edge sign and directionality.3.
Revised: To the best of our knowledge, this is the first work to evaluate GNNs on tasks that are related to both edge sign and directionality.3.

Original: We introduce a novel synthetic model for signed and directed networks, called Signed Directed Stochastic Block Model (SDSBM), and also contribute a number of new real-world data sets constructed from lead-lag relationships of financial time series data.
Revised: We introduce a novel synthetic model for signed and directed networks, called Signed Directed Stochastic Block Model (SDSBM), and also contribute a number of new real-world data sets constructed from lead-lag relationships of financial time series data.

Original:  Related Work
Revised:  Related Work

Original: In this section, we review related work constructing neural networks for directed graphs and signed graphs.
Revised: In this section, we review related work constructing neural networks for directed graphs and signed graphs.

Original: We refer the reader to [1] for more background information.
Revised: We refer the reader to [1] for more background information.

Original: Several works have aimed to define neural networks on directed graphs by constructing various directed graph Laplacians and defining convolution as multiplication in the associated eigenbasis.
Revised: Several works have aimed to define neural networks on directed graphs by constructing various directed graph Laplacians and defining convolution as multiplication in the associated eigenbasis.

Original: [19] defines a directed graph Laplacian by generalizing identities involving the undirected graph
Revised: [19] defines a directed graph Laplacian by generalizing identities involving the undirected graph

Original: Laplacian and the stationary distribution of a random walk.
Revised: Laplacian and the stationary distribution of a random walk.

Original: [20] uses a similar idea, but with PageRank in place of a random walk.
Revised: [20] uses a similar idea, but with PageRank in place of a random walk.

Original: [21] constructs three different first- and second-order symmetric adjacency matrices and uses these adjacency matrices to define associated Laplacians.
Revised: [21] constructs three different first- and second-order symmetric adjacency matrices and uses these adjacency matrices to define associated Laplacians.

Original: Similarly, [22] uses several different graph Laplacians based on various graph motifs.
Revised: Similarly, [22] uses several different graph Laplacians based on various graph motifs.

Original: Quite closely related to our work, [14] constructs a graph neural network using the magnetic Laplacian.
Revised: Quite closely related to our work, [14] constructs a graph neural network using the magnetic Laplacian.

Original: Indeed, in the case where all edge weights are positive, our GNN exactly reduces to the one proposed in [14].
Revised: Indeed, in the case where all edge weights are positive, our GNN exactly reduces to the one proposed in [14].

Original: Importantly, unlike the other directed graph Laplacians mentioned above, the magnetic
Revised: Importantly, unlike the other directed graph Laplacians mentioned above, the magnetic

Original: Laplacian is a complex, Hermitian matrix rather than a real, symmetric matrix.
Revised: Laplacian is a complex, Hermitian matrix rather than a real, symmetric matrix.

Original: We also note [5], which constructs a GNN for node clustering on directed graphs based on flow imbalance.
Revised: We also note [5], which constructs a GNN for node clustering on directed graphs based on flow imbalance.

Original: All of the above works are restricted to unsigned graphs, i.e., graphs with positive edge weights.
Revised: All of the above works are restricted to unsigned graphs, i.e., graphs with positive edge weights.

Original: However, there are also a number of neural networks introduced for signed (and possibly also directed) graphs, mostly focusing on the task of link sign prediction, i.e., predicting whether a link between two nodes will be positive or negative.
Revised: However, there are also a number of neural networks introduced for signed (and possibly also directed) graphs, mostly focusing on the task of link sign prediction, i.e., predicting whether a link between two nodes will be positive or negative.

Original: SGCN by [23] is one of the first graph neural network methods to be applicable to signed networks, using an approach based on balance theory [24].
Revised: SGCN by [23] is one of the first graph neural network methods to be applicable to signed networks, using an approach based on balance theory [24].

Original: However, its design is mainly aimed at undirected graphs.
Revised: However, its design is mainly aimed at undirected graphs.

Original: SiGAT [10] utilizes a graph attention mechanism based on [25] to learn node embeddings for signed, directed graphs, using a novel motif-based GNN architecture based on balance theory and status theory [26].
Revised: SiGAT [10] utilizes a graph attention mechanism based on [25] to learn node embeddings for signed, directed graphs, using a novel motif-based GNN architecture based on balance theory and status theory [26].

Original: Subsequently, SDGNN by [3] builds upon this work by increasing its efficiency and proposing a new objective function.
Revised: Subsequently, SDGNN by [3] builds upon this work by increasing its efficiency and proposing a new objective function.

Original: In a similar vein, SNEA [11] proposes a signed graph neural network for link sign prediction based on a novel objective function.
Revised: In a similar vein, SNEA [11] proposes a signed graph neural network for link sign prediction based on a novel objective function.

Original: In a different line of work, [12] proposes SSSNET, a GNN not based on balance theory designed for semi-supervised node clustering in signed (and possibly directed) graphs.
Revised: In a different line of work, [12] proposes SSSNET, a GNN not based on balance theory designed for semi-supervised node clustering in signed (and possibly directed) graphs.

Original: A concurrent preprint, SigMaNet [13], proposes a signed magnetic Laplacian to construct a spectral
Revised: A concurrent preprint, SigMaNet [13], proposes a signed magnetic Laplacian to construct a spectral

Original: GNN.
Revised: GNN.

Original: Additionally, several GNNs [28–30] have been introduced for multi-relational graphs, i.e., graphs with different types of edges.
Revised: Additionally, several GNNs [28–30] have been introduced for multi-relational graphs, i.e., graphs with different types of edges.

Original: In such networks, the number of learnable parameters typically increases linearly with the number of edge types.
Revised: In such networks, the number of learnable parameters typically increases linearly with the number of edge types.

Original: Signed graphs, at least if the graph is unweighted or the weighting function w only takes finitely many values, can be thought of as special cases of multi-relational graphs.
Revised: Signed graphs, at least if the graph is unweighted or the weighting function w only takes finitely many values, can be thought of as special cases of multi-relational graphs.

Original: However, in the context of (possibly weighted) signed graphs, there is an implicit relationship between the different edge types, namely that a negative edge is interpreted as the opposite of a positive edge and that edges with large weights are deemed more important than edges with small weights.
Revised: However, in the context of (possibly weighted) signed graphs, there is an implicit relationship between the different edge types, namely that a negative edge is interpreted as the opposite of a positive edge and that edges with large weights are deemed more important than edges with small weights.

Original: These relationships will allow us to construct a network with significantly fewer trainable parameters than if we were considering an arbitrary multi-relational graph.
Revised: These relationships will allow us to construct a network with significantly fewer trainable parameters than if we were considering an arbitrary multi-relational graph.

Original:  Proposed Method 3.1 Problem Formulation
Revised:  Proposed Method 3.1 Problem Formulation

Original: Let G =
Revised: Let G =

Original: ( V , E , w, X V ) denote a signed, and possibly directed, weighted graph with node attributes, where V is the set of nodes (or vertices), E is the set of (directed) edges (or links), and w : E → ( −∞ , ∞ ) \ { 0 } is the weighting function.
Revised: ( V , E , w, X V ) denote a signed, and possibly directed, weighted graph with node attributes, where V is the set of nodes (or vertices), E is the set of (directed) edges (or links), and w : E → ( −∞ , ∞ ) \ { 0 } is the weighting function.

Original: Let E + = { e ∈ E : w ( e ) > 0 } denote the set of positive edges and let E − = { e ∈ E : w ( e ) < 0 } denote the set of negative edges so that E = E + ∪ E − .
Revised: Let E + = { e ∈ E : w ( e ) > 0 } denote the set of positive edges and let E − = { e ∈ E : w ( e ) < 0 } denote the set of negative edges so that E = E + ∪ E − .

Original: Here, we do allow self-loops but not multiple edges; if v i , v j ∈ V , there is at most one edge e ∈ E from v i to v j .
Revised: Here, we do allow self-loops but not multiple edges; if v i , v j ∈ V , there is at most one edge e ∈ E from v i to v j .

Original: Let n = |V| , and let d in be the number of attributes at each node, so that X V is an n × d in matrix whose rows are the attributes of each node.
Revised: Let n = |V| , and let d in be the number of attributes at each node, so that X V is an n × d in matrix whose rows are the attributes of each node.

Original: We let A =
Revised: We let A =

Original: ( A ij ) i,j ∈V denote the weighted, signed adjacency matrix where A i,j = w i,j if ( v i , v j ) ∈ E , and A i,j = 0 otherwise.
Revised: ( A ij ) i,j ∈V denote the weighted, signed adjacency matrix where A i,j = w i,j if ( v i , v j ) ∈ E , and A i,j = 0 otherwise.

Original: 3.2 Magnetic Signed Laplacian
Revised: 3.2 Magnetic Signed Laplacian

Original: In this section, we define Hermitian matrices L ( q ) U and L ( q ) N which we refer to as the unnormalized and normalized magnetic signed Laplacian matrices, respectively.
Revised: In this section, we define Hermitian matrices L ( q ) U and L ( q ) N which we refer to as the unnormalized and normalized magnetic signed Laplacian matrices, respectively.

Original: We first define a symmetrized adjacency matrix and an absolute degree matrix by
Revised: We first define a symmetrized adjacency matrix and an absolute degree matrix by

Original: [Equation]
Revised: [Equation]

Original: with ˜ D
Revised: with ˜ D

Original: i,j = 0 for i ̸
Revised: i,j = 0 for i ̸

Original: =
Revised: =

Original: j .
Revised: j .

Original: Importantly, the use of absolute values ensures that the entries of ˜ D are non-negative.
Revised: Importantly, the use of absolute values ensures that the entries of ˜ D are non-negative.

Original: Furthermore, it ensures that all ˜ D
Revised: Furthermore, it ensures that all ˜ D

Original: i,i will be strictly positive if the graph is connected.
Revised: i,i will be strictly positive if the graph is connected.

Original: This is in contrast to the construction in [13] which will give a node degree zero if it has an equal number of positive and negative neighbors (for unweighted networks).
Revised: This is in contrast to the construction in [13] which will give a node degree zero if it has an equal number of positive and negative neighbors (for unweighted networks).

Original: To capture directional information, we next define a phase matrix Θ ( q ) by Θ ( q ) i,j := 2 πq ( A i,j − A j,i ) , where q ∈ R is the so-called “charge parameter.
Revised: To capture directional information, we next define a phase matrix Θ ( q ) by Θ ( q ) i,j := 2 πq ( A i,j − A j,i ) , where q ∈ R is the so-called “charge parameter.

Original: " In our experiments, for simplicity, we set q = 0 when the task at hand is unrelated to directionality, or when the underlying graph is undirected, and we set q = q 0 :
Revised: " In our experiments, for simplicity, we set q = 0 when the task at hand is unrelated to directionality, or when the underlying graph is undirected, and we set q = q 0 :

Original: = 1 / [2 max i,j ( A i,j − A j,i )] (so that Θ ( q ) has entries ∈ [0 , π ] ) for all the other tasks (except in an ablation study on the role of q ).
Revised: = 1 / [2 max i,j ( A i,j − A j,i )] (so that Θ ( q ) has entries ∈ [0 , π ] ) for all the other tasks (except in an ablation study on the role of q ).

Original: With ⊙ denoting elementwise multiplication, and i denoting the imaginary unit, we now construct a complex Hermitian matrix H ( q ) by
Revised: With ⊙ denoting elementwise multiplication, and i denoting the imaginary unit, we now construct a complex Hermitian matrix H ( q ) by

Original: [Equation]
Revised: [Equation]

Original: where exp( i Θ ( q ) ) is defined elementwise by exp( i Θ ( q ) )
Revised: where exp( i Θ ( q ) ) is defined elementwise by exp( i Θ ( q ) )

Original: i,j := exp( i Θ ( q ) i,j ) .
Revised: i,j := exp( i Θ ( q ) i,j ) .

Original: Note that H ( q ) is Hermitian, as ˜ A is symmetric and Θ ( q ) is skew-symmetric.
Revised: Note that H ( q ) is Hermitian, as ˜ A is symmetric and Θ ( q ) is skew-symmetric.

Original: In particular, when q = 0 , we have H (0) =
Revised: In particular, when q = 0 , we have H (0) =

Original: ˜ A .
Revised: ˜ A .

Original: Therefore, setting q = 0 is equivalent to making the input graph symmetric and discarding directional information.
Revised: Therefore, setting q = 0 is equivalent to making the input graph symmetric and discarding directional information.

Original: In general, however, H ( q ) captures information about a link’s sign, through ˜ A , and about its direction, through Θ ( q ) .
Revised: In general, however, H ( q ) captures information about a link’s sign, through ˜ A , and about its direction, through Θ ( q ) .

Original: We observe that flipping the direction of an edge, i.e., replacing a positive or negative link from v i to v j with a link of the same sign from v j to v i corresponds to complex conjugation of H ( q ) i,j (assuming either that there is not already a link from v j to v i or that we also flip the direction of that link if there is one).
Revised: We observe that flipping the direction of an edge, i.e., replacing a positive or negative link from v i to v j with a link of the same sign from v j to v i corresponds to complex conjugation of H ( q ) i,j (assuming either that there is not already a link from v j to v i or that we also flip the direction of that link if there is one).

Original: We also note that if q = 0 . 25 , A i,j = ± 1 , and A j,i = 0 , we have
Revised: We also note that if q = 0 . 25 , A i,j = ± 1 , and A j,i = 0 , we have

Original: [Equation]
Revised: [Equation]

Original: Thus, a unit-weight edge from v i to v j is treated as the opposite of a unit-weight edge from v j to v i .
Revised: Thus, a unit-weight edge from v i to v j is treated as the opposite of a unit-weight edge from v j to v i .

Original: Given H ( q ) , we next define the unnormalized magnetic signed Laplacian by
Revised: Given H ( q ) , we next define the unnormalized magnetic signed Laplacian by

Original: [Equation]
Revised: [Equation]

Original: and also define the normalized magnetic signed Laplacian by
Revised: and also define the normalized magnetic signed Laplacian by

Original: [Equation]
Revised: [Equation]

Original: When the graph G is directed, but not signed, L ( q ) U and L ( q ) N reduce to the magnetic Laplacians utilized in works such as [14, 31, 32] and [33].
Revised: When the graph G is directed, but not signed, L ( q ) U and L ( q ) N reduce to the magnetic Laplacians utilized in works such as [14, 31, 32] and [33].

Original: Similarly, when G is signed, but not directed, L ( q ) U and L ( q ) N reduce to the signed Laplacian matrices considered in e.g., [15, 18] and [34].
Revised: Similarly, when G is signed, but not directed, L ( q ) U and L ( q ) N reduce to the signed Laplacian matrices considered in e.g., [15, 18] and [34].

Original: Additionally, when the graph is neither signed nor directed, they reduce to the standard normalized and unnormalized graph
Revised: Additionally, when the graph is neither signed nor directed, they reduce to the standard normalized and unnormalized graph

Original: Laplacians [35].
Revised: Laplacians [35].

Original: The following theorems show that L ( q ) U and L ( q ) N satisfy properties analogous to the traditional graph Laplacians.
Revised: The following theorems show that L ( q ) U and L ( q ) N satisfy properties analogous to the traditional graph Laplacians.

Original: The proofs are in Appendix A.
Revised: The proofs are in Appendix A.

Original: Theorem 1.
Revised: Theorem 1.

Original: For any signed directed graph G defined in Sec. 3.1, ∀ q ∈ R , both the unnormalized magnetic signed Laplacian L ( q ) U and its normalized counterpart L ( q ) N are positive semidefinite.
Revised: For any signed directed graph G defined in Sec. 3.1, ∀ q ∈ R , both the unnormalized magnetic signed Laplacian L ( q ) U and its normalized counterpart L ( q ) N are positive semidefinite.

Original: Theorem 2.
Revised: Theorem 2.

Original: For any signed directed graph G defined in Sec. 3.1, ∀ q ∈ R , the eigenvalues of the normalized magnetic signed Laplacian L ( q ) N are contained in the interval [0 , 2] .
Revised: For any signed directed graph G defined in Sec. 3.1, ∀ q ∈ R , the eigenvalues of the normalized magnetic signed Laplacian L ( q ) N are contained in the interval [0 , 2] .

Original: By construction, L ( q ) U and L ( q ) N are Hermitian, and Theorem 1 shows they are positive semidefinite.
Revised: By construction, L ( q ) U and L ( q ) N are Hermitian, and Theorem 1 shows they are positive semidefinite.

Original: In particular, they are diagonalizable by an orthonormal basis of complex eigenvectors u 1 , . .
Revised: In particular, they are diagonalizable by an orthonormal basis of complex eigenvectors u 1 , . .

Original: , u n associated to real, nonnegative eigenvalues λ 1 ≤ . . .
Revised: , u n associated to real, nonnegative eigenvalues λ 1 ≤ . . .

Original: ≤ λ n = λ max .
Revised: ≤ λ n = λ max .

Original: Thus, similar to the traditional normalized Laplacian, we may factor L ( q ) N = UΛU † , where U is an n × n matrix whose k -th column is u k , for 1 ≤ k ≤ n , Λ is a diagonal matrix with Λ k,k = λ k , and U † is the conjugate transpose of
Revised: Thus, similar to the traditional normalized Laplacian, we may factor L ( q ) N = UΛU † , where U is an n × n matrix whose k -th column is u k , for 1 ≤ k ≤ n , Λ is a diagonal matrix with Λ k,k = λ k , and U † is the conjugate transpose of

Original: U .
Revised: U .

Original: A similar formula holds for L ( q ) U .
Revised: A similar formula holds for L ( q ) U .

Original: We conclude this subsection with a comparison to SigMaNet, proposed in the concurrent preprint [13].
Revised: We conclude this subsection with a comparison to SigMaNet, proposed in the concurrent preprint [13].

Original: SigMaNet also constructs a GNN based on a signed magnetic Laplacian, which is different from the magnetic signed Laplacian proposed here.
Revised: SigMaNet also constructs a GNN based on a signed magnetic Laplacian, which is different from the magnetic signed Laplacian proposed here.

Original: The claimed advantage of SigMaNet is that it does not require the tuning of a charge parameter q and is invariant to, e.g., doubling the weight of every edge.
Revised: The claimed advantage of SigMaNet is that it does not require the tuning of a charge parameter q and is invariant to, e.g., doubling the weight of every edge.

Original: In our work, for the sake of simplicity, we usually set q = 0 .
Revised: In our work, for the sake of simplicity, we usually set q = 0 .

Original: 25 , except for when the graph is undirected (in which case we set q = 0 ).
Revised: 25 , except for when the graph is undirected (in which case we set q = 0 ).

Original: However, a user may choose to also tune q through a standard cross-validation procedure as in [14].
Revised: However, a user may choose to also tune q through a standard cross-validation procedure as in [14].

Original: Moreover, one can readily address the latter issue by normalizing the adjacency matrix via a preprocessing step (e.g., [36]).
Revised: Moreover, one can readily address the latter issue by normalizing the adjacency matrix via a preprocessing step (e.g., [36]).

Original: In contrast to our magnetic signed Laplacian, in the case where the graph is not signed but is weighted and directed, the matrix proposed in [13] does not reduce to the magnetic Laplacian considered in [14].
Revised: In contrast to our magnetic signed Laplacian, in the case where the graph is not signed but is weighted and directed, the matrix proposed in [13] does not reduce to the magnetic Laplacian considered in [14].

Original: For example, denoting the graph adjacency matrix by A , consider the case where 0 <
Revised: For example, denoting the graph adjacency matrix by A , consider the case where 0 <

Original: A j,i <
Revised: A j,i <

Original: A i,j .
Revised: A i,j .

Original: Let m =
Revised: Let m =

Original: ( A i,j + A j,i ) , δ =
Revised: ( A i,j + A j,i ) , δ =

Original: A i,j − A j,i , and let i denote the imaginary unit.
Revised: A i,j − A j,i , and let i denote the imaginary unit.

Original: Then the ( i, j ) -th entry of the matrix L σ proposed in [13] is given by L σi,j = m i , whereas the corresponding entry of the unnormalized magnetic Laplacian is given by ( L ( q ) U ) i,j = m exp(

Revised: Then the ( i, j ) -th entry of the matrix L σ proposed in [13] is given by L σi,j = m i , whereas the corresponding entry of the unnormalized magnetic Laplacian is given by ( L ( q ) U ) i,j = m exp(

Original: π i qδ ) .
Revised: π i qδ ) .

Original: Moreover, while SigMaNet is in principle well-defined on signed and directed graphs, the experiments in [13] are restricted to tasks where only signed or directional information is important (but not both).
Revised: Moreover, while SigMaNet is in principle well-defined on signed and directed graphs, the experiments in [13] are restricted to tasks where only signed or directional information is important (but not both).

Original: In our experiments, we find that our proposed method outperforms SigMaNet on a variety of tasks on signed and/or directed networks.
Revised: In our experiments, we find that our proposed method outperforms SigMaNet on a variety of tasks on signed and/or directed networks.

Original: Moreover, we observe that the signed magnetic Laplacian L σ proposed in [13] has an undesirable property when the graph is unweighted — a node is assigned to have degree zero if it has an equal number of positive and negative connections.
Revised: Moreover, we observe that the signed magnetic Laplacian L σ proposed in [13] has an undesirable property when the graph is unweighted — a node is assigned to have degree zero if it has an equal number of positive and negative connections.

Original: Our proposed Laplacian does not suffer from this issue.
Revised: Our proposed Laplacian does not suffer from this issue.

Original: 3.3 Spectral Convolution via the Magnetic Signed Laplacian
Revised: 3.3 Spectral Convolution via the Magnetic Signed Laplacian

Original: In this section, we show how to use a Hermitian, positive semidefinite matrix L such as the normalized or unnormalized magnetic signed Laplacian introduced in Sec. 3.2, to define convolution on a signed directed graph.
Revised: In this section, we show how to use a Hermitian, positive semidefinite matrix L such as the normalized or unnormalized magnetic signed Laplacian introduced in Sec. 3.2, to define convolution on a signed directed graph.

Original: This method is similar to the ones proposed for unsigned (possibly directed) graphs in, e.g., [37–39] and [14], but we provide details in order to keep our work reasonably self-contained.
Revised: This method is similar to the ones proposed for unsigned (possibly directed) graphs in, e.g., [37–39] and [14], but we provide details in order to keep our work reasonably self-contained.

Original: Given L , let u 1 . .
Revised: Given L , let u 1 . .

Original: , u n be an orthonormal basis of eigenvectors such that Lu k
Revised: , u n be an orthonormal basis of eigenvectors such that Lu k

Original: = λ k u k , and let U be an n × n matrix whose k -th column is u k , for 1 ≤ k ≤ n .
Revised: = λ k u k , and let U be an n × n matrix whose k -th column is u k , for 1 ≤ k ≤ n .

Original: For a signal x : V → C , we define its Fourier transform (cid:98) x ∈ C n by (cid:98) x ( k ) =
Revised: For a signal x : V → C , we define its Fourier transform (cid:98) x ∈ C n by (cid:98) x ( k ) =

Original: ⟨ x , u k ⟩ := u † k x , and equivalently, (cid:98) x
Revised: ⟨ x , u k ⟩ := u † k x , and equivalently, (cid:98) x

Original: = U † x .
Revised: = U † x .

Original: Since U is unitary, we readily obtain the Fourier inversion formula
Revised: Since U is unitary, we readily obtain the Fourier inversion formula

Original: [Equation]
Revised: [Equation]

Original: Analogous to the well-known convolution theorem in Euclidean domains, we define the convolution of x with a filter y as multiplication in the Fourier domain, i.e., (cid:91)
Revised: Analogous to the well-known convolution theorem in Euclidean domains, we define the convolution of x with a filter y as multiplication in the Fourier domain, i.e., (cid:91)

Original: y ∗ x ( k ) =
Revised: y ∗ x ( k ) =

Original: (cid:98) y
Revised: (cid:98) y

Original: ( k ) (cid:98) x ( k ) .
Revised: ( k ) (cid:98) x ( k ) .

Original: By (3), this implies y ∗ x = U Diag ( (cid:98) y ) (cid:98) x
Revised: By (3), this implies y ∗ x = U Diag ( (cid:98) y ) (cid:98) x

Original: = ( U Diag ( (cid:98) y )
Revised: = ( U Diag ( (cid:98) y )

Original: U † ) x , where Diag ( z ) denotes a diagonal matrix with the vector z on its diagonal.
Revised: U † ) x , where Diag ( z ) denotes a diagonal matrix with the vector z on its diagonal.

Original: Therefore, we say that Y is a generalized convolution matrix if
Revised: Therefore, we say that Y is a generalized convolution matrix if

Original: [Equation]
Revised: [Equation]

Original: for a diagonal matrix Σ .
Revised: for a diagonal matrix Σ .

Original: This is a natural generalization of the class of convolutions used in [40].
Revised: This is a natural generalization of the class of convolutions used in [40].

Original: A main purpose of using a graph filter as in (4) is to reduce the number of parameters while maintaining permutation invariance.
Revised: A main purpose of using a graph filter as in (4) is to reduce the number of parameters while maintaining permutation invariance.

Original: Some potential drawbacks exist when defining a convolution via (4).
Revised: Some potential drawbacks exist when defining a convolution via (4).

Original: First, it requires one to compute the eigen-decomposition of L which is expensive for large graphs.
Revised: First, it requires one to compute the eigen-decomposition of L which is expensive for large graphs.

Original: Second, the number of trainable parameters equals the size of the graph (the number of nodes), rendering
Revised: Second, the number of trainable parameters equals the size of the graph (the number of nodes), rendering

Original: GNNs constructed via (4) prone to overfitting.
Revised: GNNs constructed via (4) prone to overfitting.

Original: To remedy these issues, we follow [38] (see also [37]) and observe that spectral convolution may also be implemented in the spatial domain via polynomials of L by setting Σ equal to a polynomial of Λ .
Revised: To remedy these issues, we follow [38] (see also [37]) and observe that spectral convolution may also be implemented in the spatial domain via polynomials of L by setting Σ equal to a polynomial of Λ .

Original: This reduces the number of trainable parameters from the size of the graph to the degree of the polynomial and also enhances robustness to perturbations [41].
Revised: This reduces the number of trainable parameters from the size of the graph to the degree of the polynomial and also enhances robustness to perturbations [41].

Original: As in [38], we let (cid:101) Λ = 2 λ max Λ −
Revised: As in [38], we let (cid:101) Λ = 2 λ max Λ −

Original: I denote the normalized eigenvalue matrix (with entries in [ − 1 , 1] ) and choose Σ = (cid:80) K k
Revised: I denote the normalized eigenvalue matrix (with entries in [ − 1 , 1] ) and choose Σ = (cid:80) Kk

Original: =

Revised: =

Original: θ k T k
Revised: θ k T k

Original: ( (cid:101) Λ ) , for some θ 1 , . .
Revised: ( (cid:101) Λ ) , for some θ 1 , . .

Original: , θ k ∈ R where for 0 ≤ k ≤ K , T k is the
Revised: , θ k ∈ R where for 0 ≤ k ≤ K , T k is the

Original: Chebyshev polynomials defined by T 0 ( x ) = 1 , T 1 ( x ) = x, and T k ( x ) = 2 xT k − 1 ( x ) + T k − 2 ( x ) for k ≥ 2 .
Revised: Chebyshev polynomials defined by T 0 ( x ) = 1 , T 1 ( x ) = x, and T k ( x ) = 2 xT k − 1 ( x ) + T k − 2 ( x ) for k ≥ 2 .

Original: Since U is unitary, we have ( U (cid:101) ΛU † ) k
Revised: Since U is unitary, we have ( U (cid:101) ΛU † ) k

Original: = U (cid:101) Λ k U † , and thus, letting (cid:101)
Revised: = U (cid:101) Λ k U † , and thus, letting (cid:101)

Original: L := 2 λ max L − I , we have
Revised: L := 2 λ max L − I , we have

Original: [Equation]
Revised: [Equation]

Original: This is the class of convolutional filters we will use in our experiments.
Revised: This is the class of convolutional filters we will use in our experiments.

Original: However, one could also imitate Sec.
Revised: However, one could also imitate Sec.

Original: 3.1 on [14] to produce a class of filters based on [39] rather than [38].
Revised: 3.1 on [14] to produce a class of filters based on [39] rather than [38].

Original: It is important to note that (cid:101) L is constructed so that, in (5), ( Yx ) i depends on all nodes within K -hops from v i on the undirected, unsigned counterpart of G , i.e. the graph whose adjacency matrix is given by A ′ i,j = 12 ( | A i,j | + | A j,i | ) .
Revised: It is important to note that (cid:101) L is constructed so that, in (5), ( Yx ) i depends on all nodes within K -hops from v i on the undirected, unsigned counterpart of G , i.e. the graph whose adjacency matrix is given by A ′ i,j = 12 ( | A i,j | + | A j,i | ) .

Original: Therefore, this notion of convolution does not favor “outgoing neighbors" { v j ∈ V : ( v i , v j ) ∈ E} over “incoming neighbors" { v j ∈ V : ( v j , v i ) ∈ E} (or vice versa).
Revised: Therefore, this notion of convolution does not favor “outgoing neighbors" { v j ∈ V : ( v i , v j ) ∈ E} over “incoming neighbors" { v j ∈ V : ( v j , v i ) ∈ E} (or vice versa).

Original: This is important since for a given node v i , both sets may contain different, useful information.
Revised: This is important since for a given node v i , both sets may contain different, useful information.

Original: Furthermore, since the phase matrix Θ ( q ) encodes an outgoing edge and an incoming edge differently, the filter matrix Y is also able to aggregate information from these two sets in different ways.
Revised: Furthermore, since the phase matrix Θ ( q ) encodes an outgoing edge and an incoming edge differently, the filter matrix Y is also able to aggregate information from these two sets in different ways.

Original: Regarding computational complexity, we note that while the matrix exp( i Θ ( q ) ) is dense in theory, in practice, one only needs to compute a small fraction of its entries corresponding to the nonzero entries of ˜ A (which is sparse for most real-world data sets).
Revised: Regarding computational complexity, we note that while the matrix exp( i Θ ( q ) ) is dense in theory, in practice, one only needs to compute a small fraction of its entries corresponding to the nonzero entries of ˜ A (which is sparse for most real-world data sets).

Original: Thus, the computational complexity of the convolution proposed here is equivalent to that of its undirected, unsigned counterparts.
Revised: Thus, the computational complexity of the convolution proposed here is equivalent to that of its undirected, unsigned counterparts.

Original: 3.4 The MSGNN architecture
Revised: 3.4 The MSGNN architecture

Original: We now define our network, MSGNN.
Revised: We now define our network, MSGNN.

Original: Let X (0) be an n × F 0 input matrix with columns x (0)1 , . . .
Revised: Let X (0) be an n × F 0 input matrix with columns x (0)1 , . . .

Original: x (0) F 0 , and L denote the number of convolution layers.
Revised: x (0) F 0 , and L denote the number of convolution layers.

Original: As in [14], we use a complex version of the Rectified
Revised: As in [14], we use a complex version of the Rectified

Original: Linear Unit defined by σ ( z )
Revised: Linear Unit defined by σ ( z )

Original: =
Revised: =

Original: z , if − π/ 2 ≤ arg( z ) < π/ 2 , and σ ( z ) = 

Revised: z , if − π/ 2 ≤ arg( z ) < π/ 2 , and σ ( z ) =

Original: otherwise, where arg( · ) is the complex argument of z ∈ C .
Revised: otherwise, where arg( · ) is the complex argument of z ∈ C .

Original: Let F ℓ be the number of channels in the ℓ -th layer.
Revised: Let F ℓ be the number of channels in the ℓ -th layer.

Original: For 1 ≤ ℓ ≤ L , 1 ≤ i ≤ F ℓ , and 1 ≤ j ≤ F ℓ − 1 , let Y ( ℓ ) ij be a convolution matrix defined by (4) or (5).
Revised: For 1 ≤ ℓ ≤ L , 1 ≤ i ≤ F ℓ , and 1 ≤ j ≤ F ℓ − 1 , let Y ( ℓ ) ij be a convolution matrix defined by (4) or (5).

Original: Given the ( ℓ − 1) -st layer hidden representation matrix X ( ℓ − 1) , we define X ( ℓ ) columnwise by
Revised: Given the ( ℓ − 1) -st layer hidden representation matrix X ( ℓ − 1) , we define X ( ℓ ) columnwise by

Original: [Equation]
Revised: [Equation]

Original: where b ( ℓ ) j is a bias vector with equal real and imaginary parts, Real ( b ( ℓ ) j ) =
Revised: where b ( ℓ ) j is a bias vector with equal real and imaginary parts, Real ( b ( ℓ ) j ) =

Original: Imag ( b ( ℓ ) j ) .
Revised: Imag ( b ( ℓ ) j ) .

Original: In matrix form we write X ( ℓ ) =
Revised: In matrix form we write X ( ℓ ) =

Original: Z ( ℓ ) (cid:0) X ( ℓ − 1) (cid:1) , where Z ( ℓ ) is a hidden layer of the form (6).
Revised: Z ( ℓ ) (cid:0) X ( ℓ − 1) (cid:1) , where Z ( ℓ ) is a hidden layer of the form (6).

Original: In our experiments, we utilize convolutions of the form (5) with L =
Revised: In our experiments, we utilize convolutions of the form (5) with L =

Original: L ( q ) N and set K = 1 , in which case we obtain
Revised: L ( q ) N and set K = 1 , in which case we obtain

Original: [Equation]
Revised: [Equation]

Original: where W ( ℓ ) self and W ( ℓ ) neigh are learned weight matrices corresponding to the filter weights of different channels and B ( ℓ ) =
Revised: where W ( ℓ ) self and W ( ℓ ) neigh are learned weight matrices corresponding to the filter weights of different channels and B ( ℓ ) =

Original: ( b ( ℓ ) 1 , . . .
Revised: ( b ( ℓ ) 1 , . . .

Original: , b ( ℓ ) F ℓ ) .
Revised: , b ( ℓ ) F ℓ ) .

Original: After the convolutional layers, we unwind the complex matrix
Revised: After the convolutional layers, we unwind the complex matrix

Original: X ( L ) into a real-valued n × 2 F L matrix.
Revised: X ( L ) into a real-valued n × 2 F L matrix.

Original: For node clustering, we then apply a fully connected layer followed by the softmax function.
Revised: For node clustering, we then apply a fully connected layer followed by the softmax function.

Original: By default, we set L = 2 , in which case, our network is given by
Revised: By default, we set L = 2 , in which case, our network is given by

Original: [Equation]
Revised: [Equation]

Original:  For link prediction, we apply the same method, except we concatenate rows corresponding to pairs of nodes after the unwind layer before applying the linear layer and softmax.
Revised: unwind [Equation] For link prediction, we apply the same method, except we concatenate rows corresponding to pairs of nodes after the unwind layer before applying the linear layer and softmax.

Original:  Experiments 4.1 Tasks and Evaluation Metrics
Revised:  Experiments 4.1 Tasks and Evaluation Metrics

Original: Node Clustering.
Revised: Node Clustering.

Original: In the node clustering task, one aims to partition the nodes of the graph into the disjoint union of C sets C 0 , . . .
Revised: In the node clustering task, one aims to partition the nodes of the graph into the disjoint union of C sets C 0 , . . .

Original: , C C − 1 .
Revised: , C C − 1 .

Original: Typically in an unsigned, undirected network, one aims to choose the C
Revised: Typically in an unsigned, undirected network, one aims to choose the C

Original: i ’s so that there are many links within each cluster and comparably few links between clusters, in which case nodes within each cluster are similar due to dense connections.
Revised: i ’s so that there are many links within each cluster and comparably few links between clusters, in which case nodes within each cluster are similar due to dense connections.

Original: In general, however, similarity could be defined differently [42].
Revised: In general, however, similarity could be defined differently [42].

Original: In a signed graph, clusters can be formed by grouping together nodes with positive links and separating nodes with negative links (see [12]).
Revised: In a signed graph, clusters can be formed by grouping together nodes with positive links and separating nodes with negative links (see [12]).

Original: In a directed graph, clusters can be determined by a directed flow on the network (see [5]).
Revised: In a directed graph, clusters can be determined by a directed flow on the network (see [5]).

Original: More generally, we can define clusters based on an underlying meta-graph, where meta-nodes, each of which corresponds to a cluster in the network, can be distinguished based on either signed or directional information (e.g., flow imbalance [5]).
Revised: More generally, we can define clusters based on an underlying meta-graph, where meta-nodes, each of which corresponds to a cluster in the network, can be distinguished based on either signed or directional information (e.g., flow imbalance [5]).

Original: This general meta-graph idea motivates our introduction of a novel synthetic network model, which we will define in Sec.
Revised: This general meta-graph idea motivates our introduction of a novel synthetic network model, which we will define in Sec.

Original: 4.2, driven by both link sign and directionality.
Revised: 4.2, driven by both link sign and directionality.

Original: All of our node clustering experiments are done in the semi-supervised setting, where one selects a fraction of the nodes in each cluster as seed nodes, with known cluster membership labels.
Revised: All of our node clustering experiments are done in the semi-supervised setting, where one selects a fraction of the nodes in each cluster as seed nodes, with known cluster membership labels.

Original: In all of our node clustering tasks, we measure our performance using the Adjusted Rand Index (ARI) [43].
Revised: In all of our node clustering tasks, we measure our performance using the Adjusted Rand Index (ARI) [43].

Original: Link Prediction.
Revised: Link Prediction.

Original: On undirected, unsigned graphs, link prediction is simply the task of predicting whether or not there is a link between a pair of nodes.
Revised: On undirected, unsigned graphs, link prediction is simply the task of predicting whether or not there is a link between a pair of nodes.

Original: Here, we consider five different variations of the link prediction task for signed and/or directed networks.
Revised: Here, we consider five different variations of the link prediction task for signed and/or directed networks.

Original: In our first task, link sign prediction (SP), one assumes that there is a link from v i to v j and aims to predict whether that link is positive or negative, i.e., whether ( v i , v j ) ∈ E +
Revised: In our first task, link sign prediction (SP), one assumes that there is a link from v i to v j and aims to predict whether that link is positive or negative, i.e., whether ( v i , v j ) ∈ E +

Original: or ( v i , v j ) ∈ E − .
Revised: or ( v i , v j ) ∈ E − .

Original: Our second task, direction prediction (DP), one aims to predict whether ( v i ,
Revised: Our second task, direction prediction (DP), one aims to predict whether ( v i ,

Original: v j ) ∈ E or ( v j , v i ) ∈ E under the assumption that exactly one of these two conditions holds.
Revised: v j ) ∈ E or ( v j , v i ) ∈ E under the assumption that exactly one of these two conditions holds.

Original: We also consider three-, four-, and five-class prediction problems.
Revised: We also consider three-, four-, and five-class prediction problems.

Original: In the three-class problem (3C), the possibilities are ( v i , v j ) ∈ E , ( v j , v i ) ∈ E , or that neither ( v i , v j ) nor ( v j , v i ) are in E .
Revised: In the three-class problem (3C), the possibilities are ( v i , v j ) ∈ E , ( v j , v i ) ∈ E , or that neither ( v i , v j ) nor ( v j , v i ) are in E .

Original: For the four-class problem (4C), the possibilities are ( v i , v j ) ∈ E + , ( v i , v
Revised: For the four-class problem (4C), the possibilities are ( v i , v j ) ∈ E + , ( v i , v

Original: j ) ∈ E − , ( v j , v i )
Revised: j ) ∈ E − , ( v j , v i )

Original: ∈ E
Revised: ∈ E

Original: + , and ( v j , v i )
Revised: + , and ( v j , v i )

Original: ∈ E − .
Revised: ∈ E − .

Original: For the five-class problem (5C), we also add in the possibility that neither ( v i , v j ) nor ( v j , v i ) are in E .
Revised: For the five-class problem (5C), we also add in the possibility that neither ( v i , v j ) nor ( v j , v i ) are in E .

Original: For all tasks, we evaluate the performance with classification accuracy.
Revised: For all tasks, we evaluate the performance with classification accuracy.

Original: Notably, while (SP), (DP), and (3C) only require a method to be able to extract signed or directed information, the tasks (4C) and (5C) require it to be able to effectively process both sign and directional information.
Revised: Notably, while (SP), (DP), and (3C) only require a method to be able to extract signed or directed information, the tasks (4C) and (5C) require it to be able to effectively process both sign and directional information.

Original: Also, we discard those edges that satisfy more than one condition in the possibilities for training and evaluation, but these edges are kept in the input network which is observed during training.
Revised: Also, we discard those edges that satisfy more than one condition in the possibilities for training and evaluation, but these edges are kept in the input network which is observed during training.

Original: 4.2 Synthetic Data for Node Clustering
Revised: 4.2 Synthetic Data for Node Clustering

Original: Established Synthetic Models.
Revised: Established Synthetic Models.

Original: We conduct experiments on the Signed Stochastic Block Models (SSBMs) and polarized SSBMs (POL-SSBMs) introduced in [12], which are signed but undirected.
Revised: We conduct experiments on the Signed Stochastic Block Models (SSBMs) and polarized SSBMs (POL-SSBMs) introduced in [12], which are signed but undirected.

Original: In the SSBM( n, C, p, ρ, η ) model, n represents the number of nodes, C is the number of clusters, p is the probability that there is a link (of either sign) between two nodes, ρ is the approximate ratio between the largest cluster size and the smallest cluster size, and η is the probability that an edge will have the “wrong" sign, i.e., that an intra-cluster edge will be negative or an inter-cluster edge will be positive.
Revised: In the SSBM( n, C, p, ρ, η ) model, n represents the number of nodes, C is the number of clusters, p is the probability that there is a link (of either sign) between two nodes, ρ is the approximate ratio between the largest cluster size and the smallest cluster size, and η is the probability that an edge will have the “wrong" sign, i.e., that an intra-cluster edge will be negative or an inter-cluster edge will be positive.

Original: P OL -SSBM
Revised: P OL -SSBM

Original: ( n, r, p, ρ, η, N ) is a hierarchical variation of the SSBM model consisting of r communities, each of which is itself an SSBM.
Revised: ( n, r, p, ρ, η, N ) is a hierarchical variation of the SSBM model consisting of r communities, each of which is itself an SSBM.

Original: We refer the reader to [12] for details of both models.
Revised: We refer the reader to [12] for details of both models.

Original: A novel Synthetic Model: Signed Directed Stochastic Block Model (SDSBM).
Revised: A novel Synthetic Model: Signed Directed Stochastic Block Model (SDSBM).

Original: Given a metagraph adjacency matrix F = ( F k,l ) k,l =0 ,...,C − 1 , an edge sparsity level p , a number of nodes n , and a sign flip noise level parameter 0 ≤ η ≤ 0 . 5 , we defined a SDSBM model, denoted by SDSBM ( F , n, p, ρ, η ), as follows: (1) Assign block sizes n 0 ≤ n 1 ≤ · · · ≤ n C − 1 based on a parameter ρ ≥ 1 , which approximately represents the ratio between the size of largest block and the size of the smallest block, using the same method as in [12].
Revised: Given a metagraph adjacency matrix F = ( F k,l ) k,l =0 ,...,C − 1 , an edge sparsity level p , a number of nodes n , and a sign flip noise level parameter 0 ≤ η ≤ 0 . 5 , we defined a SDSBM model, denoted by SDSBM ( F , n, p, ρ, η ), as follows: (1) Assign block sizes n 0 ≤ n 1 ≤ · · · ≤ n C − 1 based on a parameter ρ ≥ 1 , which approximately represents the ratio between the size of largest block and the size of the smallest block, using the same method as in [12].

Original: (2) Assign each node to one of the C blocks, so that each block C i has size n i .
Revised: (2) Assign each node to one of the C blocks, so that each block C i has size n i .

Original: (3) For nodes v i ∈ C k , and v j ∈ C l , independently sample an edge from v i to v j with probability p · | F k,l | .
Revised: (3) For nodes v i ∈ C k , and v j ∈ C l , independently sample an edge from v i to v j with probability p · | F k,l | .

Original: Give this edge weight 1 if F k,l ≥ 0 and weight − 1 if F k,l < 0 .
Revised: Give this edge weight 1 if F k,l ≥ 0 and weight − 1 if F k,l < 0 .

Original: Flip the sign of all the edges in the generated graph with sign-flip probability η .
Revised: Flip the sign of all the edges in the generated graph with sign-flip probability η .

Original: In our experiments, we use two sets of specific meta-graph structures { F 1 ( γ ) } , { F 2 ( γ ) } , with three and four clusters, respectively, where 0 ≤ γ ≤ 0 .
Revised: In our experiments, we use two sets of specific meta-graph structures { F 1 ( γ ) } , { F 2 ( γ ) } , with three and four clusters, respectively, where 0 ≤ γ ≤ 0 .

Original: 5 is the directional noise level.
Revised: 5 is the directional noise level.

Original: Specifically, we are interested in SDSBM ( F 1 ( γ ) , n, p, ρ, η ) and SDSBM ( F 2 ( γ ) , n, p, ρ, η ) models with varying γ where
Revised: Specifically, we are interested in SDSBM ( F 1 ( γ ) , n, p, ρ, η ) and SDSBM ( F 2 ( γ ) , n, p, ρ, η ) models with varying γ where

Original: F 1 ( γ ) =
Revised: F 1 ( γ ) =

Original: (cid:34) 

Revised: (cid:34)

Original: .γ
Revised: .γ

Original: − γ 1 − γ 0 .− 

Revised: − γ 1 − γ 0 .−

Original: .− 1 + γ − 0 .0 .(cid:35)
Revised: .− 1 + γ − 0 .0 .(cid:35)

Original: , F 2 ( γ ) =   0 .γ
Revised: , F 2 ( γ ) =   0 .γ

Original: − γ − γ 1 − γ 0 .− 

Revised: − γ − γ 1 − γ 0 .−

Original: .−
Revised: .−

Original: γ − 1 + γ − 0 .0 .−
Revised: γ − 1 + γ − 0 .0 .−

Original: γ − 1 + γ − 1 + γ − 1 + γ 0 .
Revised: γ − 1 + γ − 1 + γ − 1 + γ 0 .

Original:  .
Revised:  .

Original: 𝐶𝐶𝐶𝐶𝐶𝐶+- legend (
Revised: 𝐶𝐶𝐶𝐶𝐶𝐶+- legend (

Original: [Figure]
Revised: [Figure]

Original: F 1 .
Revised: F 1 .

Original: 𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶+- legend (
Revised: 𝐶𝐶𝐶𝐶𝐶𝐶𝐶𝐶+- legend (

Original: [Figure]
Revised: [Figure]

Original: To better understand the above SDSBM models, toy examples are provided.
Revised: To better understand the above SDSBM models, toy examples are provided.

Original: We consider the following toy examples for our proposed synthetic data in Figure 1, which models groups of athletes and sports fans on social media.
Revised: We consider the following toy examples for our proposed synthetic data in Figure 1, which models groups of athletes and sports fans on social media.

Original: Here, signed, directed edges represent positive or negative mentions.
Revised: Here, signed, directed edges represent positive or negative mentions.

Original: In
Revised: In

Original: Figure 1(a)
Revised: Figure 1(a)

Original: , C 0 are the players of a sports team, C 1 is a group of their fans who typically say positive things about the players, and C 2 is a group of fans of a rival team, who typically say negative things about the players.
Revised: , C 0 are the players of a sports team, C 1 is a group of their fans who typically say positive things about the players, and C 2 is a group of fans of a rival team, who typically say negative things about the players.

Original: Since they are fans of rival teams, the members of C 1 and C 2 both say negative things about each other.
Revised: Since they are fans of rival teams, the members of C 1 and C 2 both say negative things about each other.

Original: In general, fans mention the players more than players mention fans, which leads to net flow imbalance.
Revised: In general, fans mention the players more than players mention fans, which leads to net flow imbalance.

Original: In Figure 1(b), we add in C 3 , a group of fans of a third, less important team.
Revised: In Figure 1(b), we add in C 3 , a group of fans of a third, less important team.

Original: This group dislikes the other two teams and disseminates negative content about C 0 , C 1 , and C 2 .
Revised: This group dislikes the other two teams and disseminates negative content about C 0 , C 1 , and C 2 .

Original: However, since this third team is quite unimportant, no one comments anything back.
Revised: However, since this third team is quite unimportant, no one comments anything back.

Original: Notably, in both examples, as the expected edge density is identical both within and across clusters, discarding either signed or directional information will ruin the clustering structure.
Revised: Notably, in both examples, as the expected edge density is identical both within and across clusters, discarding either signed or directional information will ruin the clustering structure.

Original: For instance, in both examples, if we discard directional information, then C 0 will look identical to C 1 in the resulting meta-graph.
Revised: For instance, in both examples, if we discard directional information, then C 0 will look identical to C 1 in the resulting meta-graph.

Original: On the other hand, if we discard signed information, C 1 will look identical to C 2 .
Revised: On the other hand, if we discard signed information, C 1 will look identical to C 2 .

Original: We also note that the SDSBM model proposed here is a generalization of both the SSBM model from [12] and the Directed Stochastic Block Model from [5] when we have suitable meta-graph structures.
Revised: We also note that the SDSBM model proposed here is a generalization of both the SSBM model from [12] and the Directed Stochastic Block Model from [5] when we have suitable meta-graph structures.

Original: 4.3 Real-World Data for Link Prediction
Revised: 4.3 Real-World Data for Link Prediction

Original: Standard Real-World Data Sets.
Revised: Standard Real-World Data Sets.

Original: We consider four standard real-world signed and directed data sets.
Revised: We consider four standard real-world signed and directed data sets.

Original: BitCoin-Alpha and BitCoin-OTC [2] describe bitcoin trading.
Revised: BitCoin-Alpha and BitCoin-OTC [2] describe bitcoin trading.

Original: Slashdot [44] is related to a technology news website, and Epinions [45] describes consumer reviews.
Revised: Slashdot [44] is related to a technology news website, and Epinions [45] describes consumer reviews.

Original: These networks range in size from 3783 to 131580 nodes.
Revised: These networks range in size from 3783 to 131580 nodes.

Original: Only Slashdot and Epinions are unweighted ( | w i,j | = 1 , ∀ ( v i , v j ) ∈ E ).
Revised: Only Slashdot and Epinions are unweighted ( | w i,j | = 1 , ∀ ( v i , v j ) ∈ E ).

Original: Novel Financial Data Sets from Stock Returns.
Revised: Novel Financial Data Sets from Stock Returns.

Original: Using financial time series data, we build signed directed networks where the weighted edges encode lead-lag relationships inherent in the financial market, for each year in the interval 2000-2020.
Revised: Using financial time series data, we build signed directed networks where the weighted edges encode lead-lag relationships inherent in the financial market, for each year in the interval 2000-2020.

Original: The lead-lag matrices are built from time series of daily price returns.
Revised: The lead-lag matrices are built from time series of daily price returns.

Original: 3 We refer to these networks as our Fi ancial L ead- L ag (FiLL) data sets.
Revised: 3 We refer to these networks as our Fi ancial L ead- L ag (FiLL) data sets.

Original: For each year in the data set, we build a signed directed graph ( FiLL-pvCLCL ) based on the price return ofstocks at market close times on consecutive days.
Revised: For each year in the data set, we build a signed directed graph ( FiLL-pvCLCL ) based on the price return ofstocks at market close times on consecutive days.

Original: We also build another graph ( FiLL-OPCL ), based on the price return of 430 stocks from market open to close.
Revised: We also build another graph ( FiLL-OPCL ), based on the price return of 430 stocks from market open to close.

Original: The difference between 444 versusstems from the non-availability of certain open and close prices on some days for certain stocks.
Revised: The difference between 444 versusstems from the non-availability of certain open and close prices on some days for certain stocks.

Original: The lead-lag metric that is captured by the entry
Revised: The lead-lag metric that is captured by the entry

Original: A i,j in each network encodes a measure that quantifies the extent to which stock v
Revised: A i,j in each network encodes a measure that quantifies the extent to which stock v

Original: i leads stock v j , and is obtained by computing the linear regression coefficient when regressing the time series (of length 245) of daily returns of stock v i against the lag-one version of the time series (of length 245) of the daily returns of stock v j .
Revised: i leads stock v j , and is obtained by computing the linear regression coefficient when regressing the time series (of length 245) of daily returns of stock v i against the lag-one version of the time series (of length 245) of the daily returns of stock v j .

Original: Specifically, we use the beta coefficient of the corresponding simple linear regression, to serve as the one-day lead-lag metric.
Revised: Specifically, we use the beta coefficient of the corresponding simple linear regression, to serve as the one-day lead-lag metric.

Original: The resulting matrix is asymmetric and signed, rendering it amenable to a signed, directed network interpretation.
Revised: The resulting matrix is asymmetric and signed, rendering it amenable to a signed, directed network interpretation.

Original: The initial matrix is dense, with nonzero entries outside the main diagonal, since we do not consider the own auto-correlation of each stock.
Revised: The initial matrix is dense, with nonzero entries outside the main diagonal, since we do not consider the own auto-correlation of each stock.

Original: Note that an alternative approach to building the directed network could be based on Granger causality [46, 47], or other measures that quantify the lead-lag between a pair of time series, potentially while accounting for nonlinearity, such as second-order log signatures from rough paths theory as in [4].
Revised: Note that an alternative approach to building the directed network could be based on Granger causality [46, 47], or other measures that quantify the lead-lag between a pair of time series, potentially while accounting for nonlinearity, such as second-order log signatures from rough paths theory as in [4].

Original: Next, we sparsify each network, keeping only 20% of the edges with the largest magnitudes.
Revised: Next, we sparsify each network, keeping only 20% of the edges with the largest magnitudes.

Original: We also report the average results across the all the yearly data sets (a total of 42 networks) where the data set is denoted by FiLL (avg.) .
Revised: We also report the average results across the all the yearly data sets (a total of 42 networks) where the data set is denoted by FiLL (avg.) .

Original: To facilitate future research using these data sets as benchmarks, both the dense lead-lag matrices and their sparsified counterparts have been made publicly available.
Revised: To facilitate future research using these data sets as benchmarks, both the dense lead-lag matrices and their sparsified counterparts have been made publicly available.

Original: 4.4 Experimental Results
Revised: 4.4 Experimental Results

Original: We compare MSGNN against representative GNNs which are described in Section 2.
Revised: We compare MSGNN against representative GNNs which are described in Section 2.

Original: The six methods we consider are
Revised: The six methods we consider are

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: SNEA [11], (5) SSSNET [12], and (6) SigMaNet [13].
Revised: SNEA [11], (5) SSSNET [12], and (6) SigMaNet [13].

Original: For all link prediction tasks, comparisons are carried out on all baselines; for the node clustering tasks, we only compare MSGNN against SSSNET and SigMaNet as adapting the other methods to this task is nontrivial.
Revised: For all link prediction tasks, comparisons are carried out on all baselines; for the node clustering tasks, we only compare MSGNN against SSSNET and SigMaNet as adapting the other methods to this task is nontrivial.

Original: In all of our experiments, we use the normalized Magnetic signed Laplacian, L qN , unless otherwise stated.
Revised: In all of our experiments, we use the normalized Magnetic signed Laplacian, L qN , unless otherwise stated.

Original: Implementation details are provided in Appendix B, along with a runtime comparison which shows that MSGNN is generally the fastest method, see
Revised: Implementation details are provided in Appendix B, along with a runtime comparison which shows that MSGNN is generally the fastest method, see

Original: Table 2 in Appendix B. Extended results are in Appendix C and D. Code and preprocessed data are available at https://github.com/SherylHYX/MSGNN and have been included in the open-source library PyTorch Geometric Signed Directed [1].
Revised: Table 2 in Appendix B. Extended results are in Appendix C and D. Code and preprocessed data are available at https://github.com/SherylHYX/MSGNN and have been included in the open-source library PyTorch Geometric Signed Directed [1].

Original: [Figure]
Revised: [Figure]

Original: γ )
Revised: γ )

Original: [Figure]
Revised: [Figure]

Original: n
Revised: n

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: ρ = 1 .
Revised: ρ = 1 .

Original: [Figure]
Revised: [Figure]

Original: η = 0 )
Revised: η = 0 )

Original: [Figure]
Revised: [Figure]

Original: Figure 2 compares the node clustering performance of MSGNN with two other signed GNNs on synthetic data, and against variants of MSGNN on SDSBMs.
Revised: Figure 2 compares the node clustering performance of MSGNN with two other signed GNNs on synthetic data, and against variants of MSGNN on SDSBMs.

Original: For signed, undirected networks q does not has an effect, and hence we only report one MSGNN variant.
Revised: For signed, undirected networks q does not has an effect, and hence we only report one MSGNN variant.

Original: Error bars are given by one standard error.
Revised: Error bars are given by one standard error.

Original: We conclude that MSGNN outperforms SigMaNet on all data sets and is competitive with SSSNET.
Revised: We conclude that MSGNN outperforms SigMaNet on all data sets and is competitive with SSSNET.

Original: On the majority of data sets, MSGNN achieves leading performance, whereas on some signed undirected networks (SSBM and Pol-SSBM) it is slightly outperformed by SSSNET.
Revised: On the majority of data sets, MSGNN achieves leading performance, whereas on some signed undirected networks (SSBM and Pol-SSBM) it is slightly outperformed by SSSNET.

Original: On these relatively small data sets, MSGNN and SSSNET have comparable runtime and are faster than
Revised: On these relatively small data sets, MSGNN and SSSNET have comparable runtime and are faster than

Original: SigMaNet.
Revised: SigMaNet.

Original: Comparing the MSGNN variants, we conclude that the directional information in these
Revised: Comparing the MSGNN variants, we conclude that the directional information in these

Original: SDSBM models plays a vital role since MSGNN usually performs better with nonzero q .
Revised: SDSBM models plays a vital role since MSGNN usually performs better with nonzero q .

Original: 4.4.2 Link Prediction
Revised: 4.4.2 Link Prediction

Original: Our results for link prediction in Table 1 indicate that MSGNN is the top performing method, achieving the highest accuracy in all 25 cases.
Revised: Our results for link prediction in Table 1 indicate that MSGNN is the top performing method, achieving the highest accuracy in all 25 cases.

Original: SNEA is among the best performing methods, but is the least efficient in speed due to its use of graph attention, see runtime comparison in Appendix B.
Revised: SNEA is among the best performing methods, but is the least efficient in speed due to its use of graph attention, see runtime comparison in Appendix B.

Original: Specifically, the “avg."
Revised: Specifically, the “avg."

Original: results for the novel financial data sets first average the accuracy values across all individual networks (a total of 42 networks), then report the mean and standard deviation over the five runs.
Revised: results for the novel financial data sets first average the accuracy values across all individual networks (a total of 42 networks), then report the mean and standard deviation over the five runs.

Original: Results for individual FiLL networks are reported in Appendix D. Note that ± 0 . 

Revised: Results for individual FiLL networks are reported in Appendix D. Note that ± 0 .

Original: in the result tables indicates that the standard deviation is less than 0.05%.
Revised: in the result tables indicates that the standard deviation is less than 0.05%.

Original: 4.4.3 Ablation Study and Discussion
Revised: 4.4.3 Ablation Study and Discussion

Original: Table 3 in Appendix C compares different variants of MSGNN on the link prediction tasks, with respect to (1) whether we set q = 0 or use a value q = q 0 :
Revised: Table 3 in Appendix C compares different variants of MSGNN on the link prediction tasks, with respect to (1) whether we set q = 0 or use a value q = q 0 :

Original: = 1 / [2 max i,j ( A i,j − A j,i )] ) which strongly emphaszies directional information; (2) whether to include sign in input node features (if
Revised: = 1 / [2 max i,j ( A i,j − A j,i )] ) which strongly emphaszies directional information; (2) whether to include sign in input node features (if

Original: False, then only in- and out-degrees are computed like in [14] regardless of edge signs, otherwise features are constructed based on the positive and negative subgraphs separately); and (3) whether we take edge weights into account (if False, we view all edge weights as having magnitude one).
Revised: False, then only in- and out-degrees are computed like in [14] regardless of edge signs, otherwise features are constructed based on the positive and negative subgraphs separately); and (3) whether we take edge weights into account (if False, we view all edge weights as having magnitude one).

Original: Taking the standard errors into account, we find that incorporating directionality into the Laplacian matrix (i.e., having nonzero q ) typically leads to slightly better performance in the directionality-related tasks (DP, 3C, 4C, 5C).
Revised: Taking the standard errors into account, we find that incorporating directionality into the Laplacian matrix (i.e., having nonzero q ) typically leads to slightly better performance in the directionality-related tasks (DP, 3C, 4C, 5C).

Original: Although, for FiLL , the q = q 0 values are within one standard deviation of the q = 0 ones for (T,T).
Revised: Although, for FiLL , the q = q 0 values are within one standard deviation of the q = 0 ones for (T,T).

Original: The only example where q = 0 is clearly better is Epinions with (T,T) and
Revised: The only example where q = 0 is clearly better is Epinions with (T,T) and

Original: [Table]
Revised: [Table]

Original: task 4C.
Revised: task 4C.

Original: Hence, recommending q = q 0 is sensible.
Revised: Hence, recommending q = q 0 is sensible.

Original: A further comparison of the role of q is provided in Table 4 and shows that nonzero q values usually deliver superior performance.
Revised: A further comparison of the role of q is provided in Table 4 and shows that nonzero q values usually deliver superior performance.

Original: Moreover, signed features are in general helpful for tasks involving sign prediction.
Revised: Moreover, signed features are in general helpful for tasks involving sign prediction.

Original: For constructing weighted features we see no significant difference in simply summing up entries in the adjacency matrix compared to summing the absolute values of the entries.
Revised: For constructing weighted features we see no significant difference in simply summing up entries in the adjacency matrix compared to summing the absolute values of the entries.

Original: Besides, calculating degrees regardless of edge weight magnitudes could be helpful for the first four data sets but not for FiLL .
Revised: Besides, calculating degrees regardless of edge weight magnitudes could be helpful for the first four data sets but not for FiLL .

Original: In the first four data sets the standard errors are much larger than the averages of the sums of the features, whereas in the FiLL data sets, the standard errors are much smaller than the average, see Table 17.
Revised: In the first four data sets the standard errors are much larger than the averages of the sums of the features, whereas in the FiLL data sets, the standard errors are much smaller than the average, see Table 17.

Original: Hence this feature may not show enough variability in the FiLL data sets to be very informative.
Revised: Hence this feature may not show enough variability in the FiLL data sets to be very informative.

Original: Treating negative edge weights as the negation of positive ones is also not helpful (by not having separate degree features for the positive and negative subgraphs), which may explain why SigMaNet performs poorly in most scenarios due to its undesirable property.
Revised: Treating negative edge weights as the negation of positive ones is also not helpful (by not having separate degree features for the positive and negative subgraphs), which may explain why SigMaNet performs poorly in most scenarios due to its undesirable property.

Original: Surprisingly often, including only signed information but not weighted features does well.
Revised: Surprisingly often, including only signed information but not weighted features does well.

Original: To conclude, constructing features based on the positive and negative subgraphs separately is helpful, and including directional information is generally beneficial.
Revised: To conclude, constructing features based on the positive and negative subgraphs separately is helpful, and including directional information is generally beneficial.

Original: More discussions on using instead the unnormalized Laplacian, or including more layers, and exploration of some properties of our proposed Laplacian, are provided in Appendix C.
Revised: More discussions on using instead the unnormalized Laplacian, or including more layers, and exploration of some properties of our proposed Laplacian, are provided in Appendix C.

Original:  Conclusion and Outlook
Revised:  Conclusion and Outlook

Original: In this paper, we propose a spectral GNN based on a novel magnetic signed Laplacian matrix, introduce a novel synthetic network model and new real-world data sets, and conduct experiments on node clustering and link prediction tasks that are not restricted to considering either link sign or directionality alone.
Revised: In this paper, we propose a spectral GNN based on a novel magnetic signed Laplacian matrix, introduce a novel synthetic network model and new real-world data sets, and conduct experiments on node clustering and link prediction tasks that are not restricted to considering either link sign or directionality alone.

Original: MSGNN performs as well or better than leading GNNs, while being considerably faster on real-world data sets.
Revised: MSGNN performs as well or better than leading GNNs, while being considerably faster on real-world data sets.

Original: Future plans include investigating more properties of the proposed
Revised: Future plans include investigating more properties of the proposed

Original: Laplacian, and an extension to temporal/dynamic graphs, where node features and/or edge information could evolve over time [48, 49].
Revised: Laplacian, and an extension to temporal/dynamic graphs, where node features and/or edge information could evolve over time [48, 49].

Original: We are also interested in extending our work to being able to encode nontrivial edge features, to develop objectives which explicitly handle heterogeneous edge densities throughout the graph, and to extend our approach to hypergraphs and other complex network structures.
Revised: We are also interested in extending our work to being able to encode nontrivial edge features, to develop objectives which explicitly handle heterogeneous edge densities throughout the graph, and to extend our approach to hypergraphs and other complex network structures.

Original: Author Contributions
Revised: Author Contributions

Original: YH: Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Methodology, Project administration, Software, Visualization, Writing – original draft; MP: Conceptualization, Formal analysis, Methodology, Project administration, Writing – review & editing; GR: Conceptualization, Formal analysis, Funding acquisition, Methodology, Project administration, Supervision, 
Revised: Y.H.: Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Methodology, Project administration, Software, Visualization, Writing – original draft; M.P.: Conceptualization, Formal analysis, Methodology, Project administration, Writing – review & editing; G.R.: Conceptualization, Formal analysis, Funding acquisition, Methodology, Project administration, Supervision, Validation, Writing – review & editing; M

Original: Validation, Writing – review & editing; MC: Conceptualization, Data curation, Formal analysis, Funding acquisition, Methodology, Project administration, Resources, Supervision, Writing – review & editing.
Revised: C.: Conceptualization, Data curation, Formal analysis, Funding acquisition, Methodology, Project administration, Resources, Supervision, Writing – review & editing.

Original: Acknowledgements
Revised: Acknowledgements

Original: YH is supported by a Clarendon scholarship.
Revised: Y.H. is supported by a Clarendon scholarship.

Original: GR is funded in part by EPSRC grants EP/T018445/ and EP/R018472/1.
Revised: G.R. is supported in part by EPSRC grants EP/T018445/1, EP/W037211/1 and EP/R018472/1.

Original: MC acknowledges support from the EPSRC grant EP/N510129/1  at The Alan Turing Institute.
Revised: M C. acknowledges support from the EPSRC grants EP/N510129/1 and EP/W037211/1 at The Alan Turing Institute.

Original: A Proof of Theorems A.1 Proof of Theorem
Revised: A Proof of Theorems A.1 Proof of Theorem

Original: Proof.
Revised: Proof.

Original: Let x ∈ C n .
Revised: Let x ∈ C n .

Original: Since L ( q ) U is Hermitian, we have Imag ( x † L ( q ) U x ) = 0 .
Revised: Since L ( q ) U is Hermitian, we have Imag ( x † L ( q ) U x ) = 0 .

Original: Next, we note by the triangle inequality that ˜ D i,i = 12 (cid:80) nj =1 ( | A i,j | + | A j,i | ) ≥ (cid:80) nj =1 | ˜
Revised: Next, we note by the triangle inequality that ˜ D i,i = 12 (cid:80) nj =1 ( | A i,j | + | A j,i | ) ≥ (cid:80) nj =1 | ˜

Original: A i,j | .
Revised: A i,j | .

Original: Therefore, we may use the fact that ˜ A is symmetric to obtain
Revised: Therefore, we may use the fact that ˜ A is symmetric to obtain

Original: [Equation]
Revised: [Equation]

Original: Thus, L ( q ) U is positive semidefinite.
Revised: Thus, L ( q ) U is positive semidefinite.

Original: For the normalized magnetic Laplacian, one may verify (cid:16) ˜
Revised: For the normalized magnetic Laplacian, one may verify (cid:16) ˜

Original: [Equation]
Revised: [Equation]

Original: ˜ D − 1 / 2 , and hence
Revised: ˜ D − 1 / 2 , and hence

Original: [Equation]
Revised: [Equation]

Original: Thus, letting y =
Revised: Thus, letting y =

Original: ˜ D − 1 / 2 x , the fact that ˜ D is diagonal implies
Revised: ˜ D − 1 / 2 x , the fact that ˜ D is diagonal implies

Original: [Equation]
Revised: [Equation]

Original: A.2 Proof of Theorem
Revised: A.2 Proof of Theorem

Original: Proof.
Revised: Proof.

Original: By Theorem 1, it suffices to show that the lead eigenvalue, λ n , is less than or equal to 2.
Revised: By Theorem 1, it suffices to show that the lead eigenvalue, λ n , is less than or equal to 2.

Original: The
Revised: The

Original: Courant-Fischer theorem shows that
Revised: Courant-Fischer theorem shows that

Original: [Equation]
Revised: [Equation]

Original: Therefore, using (7) and setting y =
Revised: Therefore, using (7) and setting y =

Original: ˜ D − 1 / 2 x , we have
Revised: ˜ D − 1 / 2 x , we have

Original: [Equation]
Revised: [Equation]

Original: First, we observe that since ˜ D is diagonal, we have y † ˜
Revised: First, we observe that since ˜ D is diagonal, we have y † ˜

Original: Dy
Revised: Dy

Original: = n (cid:88) i,j = ˜
Revised: = n (cid:88) i,j = ˜

Original: D
Revised: D

Original: i,j y i y j = n (cid:88) i = ˜
Revised: i,j y i y j = n (cid:88) i = ˜

Original: D
Revised: D

Original: i
Revised: i

Original: [Equation]
Revised: [Equation]

Original: i | y
Revised: i | y

Original: ( i ) |
Revised: ( i ) |

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: n (cid:88)
Revised: n (cid:88)

Original: i,j = ( | A i,j | + | A j,i | )
Revised: i,j = ( | A i,j | + | A j,i | )

Original: | y
Revised: | y

Original: ( i )
Revised: ( i )

Original: | 2 .
Revised: | 2 .

Original: [Table]
Revised: [Table]

Original: The triangle inequality implies that | ˜
Revised: The triangle inequality implies that | ˜

Original: A i,j | ≤ 12 ( | A
Revised: A i,j | ≤ 12 ( | A

Original: i,j | + | A j,i | ) .
Revised: i,j | + | A j,i | ) .

Original: Therefore, we may repeatedly expand the sums and interchange the roles of i and j to obtain
Revised: Therefore, we may repeatedly expand the sums and interchange the roles of i and j to obtain

Original: [Equation]
Revised: [Equation]

Original: B Implementation Details
Revised: B Implementation Details

Original: Experiments were conducted on two compute nodes, each with 8 Nvidia Tesla T4, 96 Intel Xeon
Revised: Experiments were conducted on two compute nodes, each with 8 Nvidia Tesla T4, 96 Intel Xeon

Original: Platinum 8259CL CPUs @
Revised: Platinum 8259CL CPUs @

Original: 2.50GHz and 378 GB RAM.
Revised: 2.50GHz and 378 GB RAM.

Original: Table 2 reports total runtime after data preprocessing (in seconds) on link tasks for competing methods.
Revised: Table 2 reports total runtime after data preprocessing (in seconds) on link tasks for competing methods.

Original: We conclude that for large graphs
Revised: We conclude that for large graphs

Original: SNEA is the least efficient method in terms of speed due to the attention mechanism employed, followed by SDGNN, which needs to count motifs.
Revised: SNEA is the least efficient method in terms of speed due to the attention mechanism employed, followed by SDGNN, which needs to count motifs.

Original: MSGNN is generally the fastest.
Revised: MSGNN is generally the fastest.

Original: Averaged results are reported with error bars representing one standard deviation in the figures, and plus/minus one standard deviation in the tables.
Revised: Averaged results are reported with error bars representing one standard deviation in the figures, and plus/minus one standard deviation in the tables.

Original: For all the experiments, we use Adam [50] as our optimizer with a learning rate of 0.01 and employ ℓ 2 regularization with weight decay parameter 5 · 10 − 4 to avoid overfitting.
Revised: For all the experiments, we use Adam [50] as our optimizer with a learning rate of 0.01 and employ ℓ 2 regularization with weight decay parameter 5 · 10 − 4 to avoid overfitting.

Original: We use the open-source library PyTorch Geometric Signed Directed [1] for data loading, node and edge splitting, node feature preparation, and implementation of some baselines.
Revised: We use the open-source library PyTorch Geometric Signed Directed [1] for data loading, node and edge splitting, node feature preparation, and implementation of some baselines.

Original: For SSSNET [12], we use hidden size 16, 2 hops, and τ = 0 .
Revised: For SSSNET [12], we use hidden size 16, 2 hops, and τ = 0 .

Original: 5 , and we adapt the architecture so
Revised: 5 , and we adapt the architecture so

Original: that
Revised: that

Original: SSSNET is suitable for link prediction tasks.
Revised: SSSNET is suitable for link prediction tasks.

Original: For SigMaNet [13], we use the code and parameter settings from https://anonymous.4open.science/r/SigMaNet .
Revised: For SigMaNet [13], we use the code and parameter settings from https://anonymous.4open.science/r/SigMaNet .

Original: We set the number of layers to two for all methods.
Revised: We set the number of layers to two for all methods.

Original: B.1 Node Clustering
Revised: B.1 Node Clustering

Original: We conduct semi-supervised node clustering, with 10% of all nodes from each cluster as test nodes, 10% as validation nodes to select the model, and the remaining 80% as training nodes (10% of which are seed nodes).
Revised: We conduct semi-supervised node clustering, with 10% of all nodes from each cluster as test nodes, 10% as validation nodes to select the model, and the remaining 80% as training nodes (10% of which are seed nodes).

Original: For each of the synthetic models, we first generate five different networks, each with two different data splits, then conduct experiments on them and report average performance over these 10 runs.
Revised: For each of the synthetic models, we first generate five different networks, each with two different data splits, then conduct experiments on them and report average performance over these 10 runs.

Original: To train the GNNs on the signed undirected data sets (SSBMs and POL-SSBMs), we use the semi-supervised loss function L 1 =
Revised: To train the GNNs on the signed undirected data sets (SSBMs and POL-SSBMs), we use the semi-supervised loss function L 1 =

Original: L PBNC + γ s ( L CE + γ t L triplet ) as in [12], with the same hyperparameter setting γ s = 50 , γ t = 0 .
Revised: L PBNC + γ s ( L CE + γ t L triplet ) as in [12], with the same hyperparameter setting γ s = 50 , γ t = 0 .

Original: 1 , where L PBNC is the self-supervised probablistic balanced normalized cut loss function penalizing unexpected signs.
Revised: 1 , where L PBNC is the self-supervised probablistic balanced normalized cut loss function penalizing unexpected signs.

Original: For these signed undirected graphs, we use validation ARI for early stopping.
Revised: For these signed undirected graphs, we use validation ARI for early stopping.

Original: For the SDSBMs, our loss function is the sum of L 1 and the imbalance loss function L sortvol_sum from [5] (absolute edge weights as input), i.e., L 2 =
Revised: For the SDSBMs, our loss function is the sum of L 1 and the imbalance loss function L sortvol_sum from [5] (absolute edge weights as input), i.e., L 2 =

Original: L sortvol_sum + L 1 , and we use the self-supervised part of the validation loss ( L PBNC + L sortvol_sum ) for early stopping.
Revised: L sortvol_sum + L 1 , and we use the self-supervised part of the validation loss ( L PBNC + L sortvol_sum ) for early stopping.

Original: We further restrict the GNNs to be trained on the subgraph induced by only the training nodes while applying the training loss function.
Revised: We further restrict the GNNs to be trained on the subgraph induced by only the training nodes while applying the training loss function.

Original: For MSGNN on SDSBMs, we set q = 0 .
Revised: For MSGNN on SDSBMs, we set q = 0 .

Original: 25 to emphasize directionality.
Revised: 25 to emphasize directionality.

Original: The input node feature matrix X V for undirected signed networks in our experiments is generated by stacking the eigenvectors corresponding to the largest C eigenvalues of a regularized version of the symmetrized adjacency matrix ˜ A .
Revised: The input node feature matrix X V for undirected signed networks in our experiments is generated by stacking the eigenvectors corresponding to the largest C eigenvalues of a regularized version of the symmetrized adjacency matrix ˜ A .

Original: For signed, directed networks, we calculate the inand out-degrees based on both signs to obtain a four-dimensional feature vector for each node.
Revised: For signed, directed networks, we calculate the inand out-degrees based on both signs to obtain a four-dimensional feature vector for each node.

Original: We train all GNNs for the node clustering task for at most 1000 epochs with a 200-epoch early-stopping scheme.
Revised: We train all GNNs for the node clustering task for at most 1000 epochs with a 200-epoch early-stopping scheme.

Original: B.2 Link Prediction
Revised: B.2 Link Prediction

Original: We train all GNNs for each link prediction task for 300 epochs.
Revised: We train all GNNs for each link prediction task for 300 epochs.

Original: We use the proposed loss functions from their original papers for SGCN [23], SNEA [11], SiGAT [10], and SDGNN [3], and we use cross-entropy loss L CE for SigMaNet [13], SSSNET [12] and MSGNN.
Revised: We use the proposed loss functions from their original papers for SGCN [23], SNEA [11], SiGAT [10], and SDGNN [3], and we use cross-entropy loss L CE for SigMaNet [13], SSSNET [12] and MSGNN.

Original: For all link prediction experiments, we sample 20% edges as test edges, and use the rest of the edges for training.
Revised: For all link prediction experiments, we sample 20% edges as test edges, and use the rest of the edges for training.

Original: Five splits were generated randomly for each input graph.
Revised: Five splits were generated randomly for each input graph.

Original: We calculate the in- and out-degrees based on both signs from the observed input graph (removing test edges) to obtain a four-dimensional feature vector for each node for training SigMaNet [13], SSSNET [12], and MSGNN, and we use the default settings from [1] for SGCN [23], SNEA [11], SiGAT [10], and SDGNN [3].
Revised: We calculate the in- and out-degrees based on both signs from the observed input graph (removing test edges) to obtain a four-dimensional feature vector for each node for training SigMaNet [13], SSSNET [12], and MSGNN, and we use the default settings from [1] for SGCN [23], SNEA [11], SiGAT [10], and SDGNN [3].

Original: C Ablation Study and Discussion
Revised: C Ablation Study and Discussion

Original: Table 3 compares different variants of MSGNN on the link prediction tasks (Table 10 reports runtime), with respect to whether we use a traditional signed Laplacian that is initially designed for undirected networks (in which case we have q = 0 ) and a magnetic signed Laplacian, with q = q 0 :
Revised: Table 3 compares different variants of MSGNN on the link prediction tasks (Table 10 reports runtime), with respect to whether we use a traditional signed Laplacian that is initially designed for undirected networks (in which case we have q = 0 ) and a magnetic signed Laplacian, with q = q 0 :

Original: = 1 / [2 max i,j ( A i,j − A j,i )] , which strongly emphasizes directionality.
Revised: = 1 / [2 max i,j ( A i,j − A j,i )] , which strongly emphasizes directionality.

Original: We also assess whether to include sign in input node features, and whether we take edge weights into account.
Revised: We also assess whether to include sign in input node features, and whether we take edge weights into account.

Original: Note that, by default, the degree calculated given signed edge weights are net degrees, meaning that we sum the edge weights up without taking absolute values, which means that -

Revised: Note that, by default, the degree calculated given signed edge weights are net degrees, meaning that we sum the edge weights up without taking absolute values, which means that -

Original: and 1 would cancel out during calculation.
Revised: and 1 would cancel out during calculation.

Original: The features that sum up absolute values of edge weights are denoted with T’ in the table.
Revised: The features that sum up absolute values of edge weights are denoted with T’ in the table.

Original: Taking the standard error into account, we find no significant difference between the two options T and T ′ as weight features when signed features are not considered.
Revised: Taking the standard error into account, we find no significant difference between the two options T and T ′ as weight features when signed features are not considered.

Original: We provide a toy example here to help better understand what the tuples mean.
Revised: We provide a toy example here to help better understand what the tuples mean.

Original: Consider a signed directed graph with adjacency matrix
Revised: Consider a signed directed graph with adjacency matrix

Original: [Table]
Revised: [Table]

Original: 
Revised: 

Original: [Table]
Revised: [Table]

Original: Corresponding to our tuple definition, we have, for the node corresponding to the first row and first column, [2 , 3] for (F,F), [0 , 3 . 4] for (F,T), [6 , 3 . 6] for (F,T‘), [1 , 2 , 1 , 1] for (T,F), and [3 , 3 . 5 , 3 , 0 . 1] for (T,T).
Revised: Corresponding to our tuple definition, we have, for the node corresponding to the first row and first column, [2 , 3] for (F,F), [0 , 3 . 4] for (F,T), [6 , 3 . 6] for (F,T‘), [1 , 2 , 1 , 1] for (T,F), and [3 , 3 . 5 , 3 , 0 . 1] for (T,T).

Original: To see the effect of using edge weights as input instead of treating all weights as having unitmagnitude, we report the main results as well as ablation study results correspondingly in Tables 5, and 7, and their runtimes are reported in Tables 12,13 and 14.
Revised: To see the effect of using edge weights as input instead of treating all weights as having unitmagnitude, we report the main results as well as ablation study results correspondingly in Tables 5, and 7, and their runtimes are reported in Tables 12,13 and 14.

Original: We conclude that using unit-magnitude weights could be either beneficial or harmful depending on the data set and task at hand.
Revised: We conclude that using unit-magnitude weights could be either beneficial or harmful depending on the data set and task at hand.

Original: However, in general, edge weights are important for FiLL but might not be helpful for the bitcoin data sets.
Revised: However, in general, edge weights are important for FiLL but might not be helpful for the bitcoin data sets.

Original: Besides, we could draw similar conclusions as in Sec.
Revised: Besides, we could draw similar conclusions as in Sec.

Original: 4.4.3 for the influence of input features as well as the q value.
Revised: 4.4.3 for the influence of input features as well as the q value.

Original: Table 8 compares tue performance of MSGNN with and without symmetric normalization (i.e., whether we use L ( q ) U or L ( q ) N ) and Table 9 shows how MSGNN’s performance varies with the number of layers.
Revised: Table 8 compares tue performance of MSGNN with and without symmetric normalization (i.e., whether we use L ( q ) U or L ( q ) N ) and Table 9 shows how MSGNN’s performance varies with the number of layers.

Original: The corresponding runtimes are reported in Tables 15 and 16, respectively.
Revised: The corresponding runtimes are reported in Tables 15 and 16, respectively.

Original: In general, we see that there are not significant differences in performance between normalizing and not normalizing; and in the vast majority of cases these differences are less than one standard deviation.
Revised: In general, we see that there are not significant differences in performance between normalizing and not normalizing; and in the vast majority of cases these differences are less than one standard deviation.

Original: We also note that in most cases, adding slightly more layers (from 2 to 4) yields a modest increase in performance.
Revised: We also note that in most cases, adding slightly more layers (from 2 to 4) yields a modest increase in performance.

Original: However, we again note that these increases in performance are typically quite small and often less than one standard deviation.
Revised: However, we again note that these increases in performance are typically quite small and often less than one standard deviation.

Original: When we further increase the number of layers (up to 10), performance of MSGNN begin to drop slightly.
Revised: When we further increase the number of layers (up to 10), performance of MSGNN begin to drop slightly.

Original: Overall, we do not see much evidence of severe oversmoothing.
Revised: Overall, we do not see much evidence of severe oversmoothing.

Original: However, there does not seem to be significant advantages to very deep networks.
Revised: However, there does not seem to be significant advantages to very deep networks.

Original: Therefore, in our experiments, to be both effective in performance and efficient in computational expense we stick to two layers.
Revised: Therefore, in our experiments, to be both effective in performance and efficient in computational expense we stick to two layers.

Original: (See Tables 15 and 16 for runtime comparison.)
Revised: (See Tables 15 and 16 for runtime comparison.)

Original: It is of interest to explore the behavior of our proposed magnetic signed Laplacian matrix further.
Revised: It is of interest to explore the behavior of our proposed magnetic signed Laplacian matrix further.

Original: Hence here we assess its capability of separating clusters based on its top eigenvectors.
Revised: Hence here we assess its capability of separating clusters based on its top eigenvectors.

Original: Figuresand 4 show the top eigenvector of our proposed magnetic signed Laplacian matrix with q = 0 .and
Revised: Figuresand 4 show the top eigenvector of our proposed magnetic signed Laplacian matrix with q = 0 .and

Original: symmetric normalization, where the x-axis denotes the real parts and the y-axis denotes the imaginary parts, for the two synthetic SDSBM models F 1 ( γ ) and F 1 ( γ ) from Subsection 4.2.
Revised: symmetric normalization, where the x-axis denotes the real parts and the y-axis denotes the imaginary parts, for the two synthetic SDSBM models F 1 ( γ ) and F 1 ( γ ) from Subsection 4.2.

Original: Our
Revised: Our

Original: Laplacian clearly picks up a signal using the top eigenvector, but does not detect all four clusters.
Revised: Laplacian clearly picks up a signal using the top eigenvector, but does not detect all four clusters.

Original: Including information beyond the top eigenvector Figure 5 reports ARI values when we apply Kmeans algorithm to the stacked top eigenvectors for clustering.
Revised: Including information beyond the top eigenvector Figure 5 reports ARI values when we apply Kmeans algorithm to the stacked top eigenvectors for clustering.

Original: Specifically, for F 1 with three clusters,
Revised: Specifically, for F 1 with three clusters,

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: we stack the real and imaginary parts of the top 3 + 1 = 4 eigenvectors as input features for K-means, while for F 2 we employ the top 4 + 1 = 5 eigenvectors.
Revised: we stack the real and imaginary parts of the top 3 + 1 = 4 eigenvectors as input features for K-means, while for F 2 we employ the top 4 + 1 = 5 eigenvectors.

Original: We conclude that the top eigenvectors of our proposed magnetic signed Laplacian can separate some of the clusters while it confuses a pair
Revised: We conclude that the top eigenvectors of our proposed magnetic signed Laplacian can separate some of the clusters while it confuses a pair

Original: [Table]
Revised: [Table]

Original: and that the separation ability decreases as we increase the noise level ( γ and/or η ).
Revised: and that the separation ability decreases as we increase the noise level ( γ and/or η ).

Original: In particular, simply using K-means on the top eigenvectors is not competitive compared to the performance of MSGNN after training.
Revised: In particular, simply using K-means on the top eigenvectors is not competitive compared to the performance of MSGNN after training.

Original: Table 17 reports input feature sum statistics on real-world data sets: m 1 and s 1 denote the average and one standard error of the sum of input features for each node corresponding to the (T, F) tuple in
Revised: Table 17 reports input feature sum statistics on real-world data sets: m 1 and s 1 denote the average and one standard error of the sum of input features for each node corresponding to the (T, F) tuple in

Original: Table 3, respectively, while m 2 and s 2 correspond to (T,T).
Revised: Table 3, respectively, while m 2 and s 2 correspond to (T,T).

Original: We conclude that in the first four data sets the standard errors are much larger than the averages of the sums of the features, whereas in the FiLL data sets, the standard errors are much smaller than the average, see Table 17.
Revised: We conclude that in the first four data sets the standard errors are much larger than the averages of the sums of the features, whereas in the FiLL data sets, the standard errors are much smaller than the average, see Table 17.

Original: Hence in the FiLL data sets these features may not show enough variability around the average to be very informative.
Revised: Hence in the FiLL data sets these features may not show enough variability around the average to be very informative.

Original: [Table]
Revised: [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: D Experimental Results on Individual Years for FiLL
Revised: D Experimental Results on Individual Years for FiLL

Original: Table 18, 19, 20 and 21 provide full experimental results on financial data sets for individual years for the main experiments
Revised: Table 18, 19, 20 and 21 provide full experimental results on financial data sets for individual years for the main experiments

Original: [Table]
Revised: [Table]

Original: while Table 22, 23, 24, 25, 26, 27, 28 and 29 contain individual results for the years for the ablation study.
Revised: while Table 22, 23, 24, 25, 26, 27, 28 and 29 contain individual results for the years for the ablation study.

Original: [Table]
Revised: [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: 61 5C
Revised: 61 5C

Original: Slashdot
Revised: Slashdot

Original: SP        610 DP        604 3C        708 4C        617 5C
Revised: SP        610 DP        604 3C        708 4C        617 5C

Original: Epinions
Revised: Epinions

Original: SP        987 DP        984 3C        1127 4C        986 5C
Revised: SP        987 DP        984 3C        1127 4C        986 5C

Original: FiLL (avg.)
Revised: FiLL (avg.)

Original: SP        72 DP        72 3C        78 4C        71 5C
Revised: SP        72 DP        72 3C        78 4C        71 5C

Original: [Table]
Revised: [Table]

Original: FiLL-pvCLCL (2004) 26.
Revised: FiLL-pvCLCL (2004) 26.

Original: 19.810 FiLL-OPCL (2004) 24.
Revised: 19.810 FiLL-OPCL (2004) 24.

Original: 20.921 FiLL-pvCLCL (2005) 26.
Revised: 20.921 FiLL-pvCLCL (2005) 26.

Original: 19.988 FiLL-OPCL (2005) 23.
Revised: 19.988 FiLL-OPCL (2005) 23.

Original: 24.206 FiLL-pvCLCL (2006) 28.
Revised: 24.206 FiLL-pvCLCL (2006) 28.

Original: 15.837 FiLL-OPCL (2006) 26.
Revised: 15.837 FiLL-OPCL (2006) 26.

Original: 19.626 FiLL-pvCLCL (2007) 33.
Revised: 19.626 FiLL-pvCLCL (2007) 33.

Original: 9.510 FiLL-OPCL (2007) 30.
Revised: 9.510 FiLL-OPCL (2007) 30.

Original: 11.904 FiLL-pvCLCL (2008) 45.
Revised: 11.904 FiLL-pvCLCL (2008) 45.

Original: 5.604 FiLL-OPCL (2008) 42.
Revised: 5.604 FiLL-OPCL (2008) 42.

Original: 6.401 FiLL-pvCLCL (2009) 43.
Revised: 6.401 FiLL-pvCLCL (2009) 43.

Original: 5.697 FiLL-OPCL (2009) 36.
Revised: 5.697 FiLL-OPCL (2009) 36.

Original: 8.853 FiLL-pvCLCL (2010) 25.
Revised: 8.853 FiLL-pvCLCL (2010) 25.

Original: 12.461 FiLL-OPCL (2010) 26.
Revised: 12.461 FiLL-OPCL (2010) 26.

Original: 13.309 FiLL-pvCLCL (2011) 41.
Revised: 13.309 FiLL-pvCLCL (2011) 41.

Original: 5.671 FiLL-OPCL (2011) 36.
Revised: 5.671 FiLL-OPCL (2011) 36.

Original: 6.582 FiLL-pvCLCL (2012) 29.
Revised: 6.582 FiLL-pvCLCL (2012) 29.

Original: 13.496 FiLL-OPCL (2012) 26.
Revised: 13.496 FiLL-OPCL (2012) 26.

Original: 17.576 FiLL-pvCLCL (2013) 26.
Revised: 17.576 FiLL-pvCLCL (2013) 26.

Original: 13.407 FiLL-OPCL (2013) 25.
Revised: 13.407 FiLL-OPCL (2013) 25.

Original: 13.123 FiLL-pvCLCL (2014) 25.
Revised: 13.123 FiLL-pvCLCL (2014) 25.

Original: 19.514 FiLL-OPCL (2014) 25.
Revised: 19.514 FiLL-OPCL (2014) 25.

Original: 16.668 FiLL-pvCLCL (2015) 25.
Revised: 16.668 FiLL-pvCLCL (2015) 25.

Original: 12.519 FiLL-OPCL (2015) 27.
Revised: 12.519 FiLL-OPCL (2015) 27.

Original: 11.325 FiLL-pvCLCL (2016) 30.
Revised: 11.325 FiLL-pvCLCL (2016) 30.

Original: 9.694 FiLL-OPCL (2016) 29.
Revised: 9.694 FiLL-OPCL (2016) 29.

Original: 9.233 FiLL-pvCLCL (2017) 28.
Revised: 9.233 FiLL-pvCLCL (2017) 28.

Original: 16.353 FiLL-OPCL (2017) 27.
Revised: 16.353 FiLL-OPCL (2017) 27.

Original: 18.012 FiLL-pvCLCL (2018) 25.
Revised: 18.012 FiLL-pvCLCL (2018) 25.

Original: 17.535 FiLL-OPCL (2018) 25.
Revised: 17.535 FiLL-OPCL (2018) 25.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: 14.611 FiLL-pvCLCL (2019) 28.
Revised: 14.611 FiLL-pvCLCL (2019) 28.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: 13.123 FiLL-OPCL (2019) 26.
Revised: 13.123 FiLL-OPCL (2019) 26.

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Table] [Table]
Revised: [Table] [Table]

Original: [Figure] [Figure]
Revised: [Figure] [Figure]

Original: p = 0 .
Revised: p = 0 .

Original: 1 , ρ = 1 . 5 , η ) with various γ and η values, where red, green, orange, and blue denote C 0 , C 1 ,
Revised: 1 , ρ = 1 . 5 , η ) with various γ and η values, where red, green, orange, and blue denote C 0 , C 1 ,

Original: C 2 , and C 3 , respectively.
Revised: C 2 , and C 3 , respectively.

Original: [Figure]
Revised: [Figure]