wanyu/IteraTeR_v2 huggingface dataset:
Original:  We propose Latent-Graph Convolutional Networks (L-GCNs), which can successfully propagate information from these edge labels to a latent adjacency tensor, after which further propagation and downstream tasks can be performed, such as node classification.
Revised:  We propose Latent-Graph Convolutional Networks (L-GCNs), which can successfully propagate information from these edge labels to a latent adjacency tensor, after which further downstream tasks can be performed, such as node classification.
Edit intent: clarity
Original:  We evaluate the performance of several variations of the model on two synthetic datasets simulating fraud in financial transaction networks, to ensure that the model must make use of edge labels in order to achieve good classification performance.
Revised:  We evaluate the performance of several variations of the model on two synthetic datasets simulating fraud in financial transaction networks, ensuring the model must make use of edge labels in order to achieve good classification performance.
Edit intent: coherence
Original:  We find that allowing for nonlinear interactions on a per-neighbor basis enhances performance significantly, while also showing promising results in an inductive setting  .
Revised:  We find that allowing for nonlinear interactions on a per-neighbor basis boosts performance significantly, while also showing promising results in an inductive setting .
Edit intent: clarity
Original:  We find that allowing for nonlinear interactions on a per-neighbor basis enhances performance significantly, while also showing promising results in an inductive setting  .
Revised:  We find that allowing for nonlinear interactions on a per-neighbor basis enhances performance significantly, while showing promising results in an inductive setting .
Edit intent: clarity
Original:  A series of analyses show that the two systems can bring mutual benefits to each other, and the introduced knowledge bridges the gap between the two systems .
Revised:  A series of analyses show that the two systems can bring mutual benefits to each other, and the introduced knowledge contributes to both their performances .
Edit intent: clarity
Original: We study the fair allocation of indivisible goods under the assumption that the goods form an undirected graph and  each agent must receive a connected subgraph.
Revised: We study the allocation of indivisible goods under the assumption that the goods form an undirected graph and each agent must receive a connected subgraph.
Edit intent: clarity
Original: We study the fair allocation of indivisible goods under the assumption that the goods form an undirected graph and  each agent must receive a connected subgraph.
Revised: We study the fair allocation of indivisible goods that form an undirected graph and each agent must receive a connected subgraph.
Edit intent: clarity
Original:  We establish graph-specific maximin share guarantees, which are tight for large classes of graphs in the case of two agents and for paths and stars in the general case.
Revised:  We establish graph-specific and the unconstrained maximin share, and derive bounds on this quantity which are tight for large classes of graphs in the case of two agents and for paths and stars in the general case.
Edit intent: clarity
Original:  Unlike in previous work, our guarantees are with respect to the complete-graph maximin share, which allows us to compare possible guarantees for different graphs.
Edit intent: coherence
Original:  Our work demonstrates several applications of graph-theoretical tools and concepts to fair division problems.
Revised:  Our work demonstrates several applications of graph-theoretic tools and concepts to fair division problems.
Edit intent: fluency
Original:  Using checking enables bidirectional typing to break the decidability barrier of Damas-Milner approaches ;
Revised:  Using checking enables bidirectional typing to support features for which inference is undecidable ;
Edit intent: clarity
Original: We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed edge partitioning method that can scale to trillion-edge graphs while providing high partitioning quality.
Revised: We propose Distributed Neighbor Expansion (Distributed NE), a parallel and distributed graph partitioning method that can scale to trillion-edge graphs while providing high partitioning quality.
Edit intent: fluency
Original:  As a result, Distributed NE can handle a trillion-edge graph using only a few hundreds of machines .
Revised:  As a result, Distributed NE can partition a trillion-edge graph using only a few hundreds of machines .
Edit intent: clarity
Original:  Simulation models has shown that social network structure plays a key role in rendering cooperationevolutionarily stable .
Revised:  Computer simulations have shown that social network structure plays a key role in rendering cooperationevolutionarily stable .
Edit intent: clarity
Original:  Simulation models has shown that social network structure plays a key role in rendering cooperationevolutionarily stable .
Revised:  Simulation models has shown that social network structure plays a key role for the viability of cooperation .
Edit intent: clarity
Original:  Here, we investigate how cooperation is affected by the initial network positions of cooperators in different networks, by means of game-theory based simulation models.
Revised:  Here, we investigate how cooperation is affected by the initial network positions of cooperators in different networks, by means of simulation models.
Edit intent: clarity
Original:  We find that placing cooperators on  high-degree nodes enhances cooperationin standard scale-free networks but not in standard Poisson networks.
Revised:  We find that placing cooperators on well-connected ( high-degree nodes enhances cooperationin standard scale-free networks but not in standard Poisson networks.
Edit intent: clarity
Original: Cooperative behaviour is widespread in nature , but explaining how cooperation evolves constitutes a major scientific challenge.
Revised: Cooperative behaviour constitutes a key aspect of both human society and non-human animal systems , but explaining how cooperation evolves constitutes a major scientific challenge.
Edit intent: clarity
Original: Cooperative behaviour is widespread in nature , but explaining how cooperation evolves constitutes a major scientific challenge.
Revised: Cooperative behaviour is widespread in nature , but explaining how cooperation evolves represents a major scientific challenge.
Edit intent: fluency
Original:  Computer simulations have shown that social network structure plays a key role for the viability of cooperation.
Revised:  It is now well established that social network structure plays a key role for the viability of cooperation.
Edit intent: clarity
Original:  Computer simulations have shown that social network structure plays a key role for the viability of cooperation.
Revised:  Computer simulations have shown that social network structure plays a central role for the viability of cooperation.
Edit intent: clarity
Original:  However, not much is known about the importance of correlations between cooperative strategy and network position for the evolution of cooperation.
Revised:  However, not much is known about the importance of the positions of cooperators in the networks for the evolution of cooperation.
Edit intent: clarity
Original:  The results are furthermore important to consider in regard to cooperation experiments, as they imply that stochastic initial correlations between cooperativeness and network position can affect the results of such experiments.
Revised:  The results are furthermore important to consider in regard to human cooperation experiments.
Edit intent: clarity
Original:  Concurrent objects with asynchronous messaging are an increasingly popular way to structure highly available, high performance, large-scale software systems.
Revised: Context: Concurrent objects with asynchronous messaging are an increasingly popular way to structure highly available, high performance, large-scale software systems.
Edit intent: clarity
Original:  To ensure data-consistency and support synchronization between objects such systems often use an atomic commitment protocol such as Two-Phase  commit (2PC) .
Revised:  To ensure data-consistency and support synchronization between objects such systems often use distributed transactions with Two-Phase commit (2PC) .
Edit intent: clarity
Original:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages at the same time because of locking ).
Revised:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly contended, when an object is queuing a lot of messages at the same time because of locking ).
Edit intent: clarity
Original:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages at the same time because of locking ).
Revised:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages because of locking ).
Edit intent: clarity
Original:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages at the same time because of locking ).
Revised:  In highly available, high-throughput systems, such as large banking infrastructure, however, 2PC becomes a bottleneck when objects are highly congested (one object queuing a lot of messages at the same time because of locking . Approach:
Edit intent: coherence
Original:  We start from message handlers (or methods), which are decorated with pre- and postconditions , describing their guards and effect.
Revised:  We start from message handlers (or methods), which are decorated with pre- and post-conditions , describing their guards and effect.
Edit intent: fluency
Original:   This allows the PSAC lock mechanism to check whether the effect of two incoming messages at the same time are independent, and to avoid locking if this is the case.
Revised:  Knowledge: This allows the PSAC lock mechanism to check whether the effect of two incoming messages at the same time are independent, and to avoid locking if this is the case.
Edit intent: fluency
Original:   We have implemented PSAC for a state machine-based DSL called Rebel, on top of a runtime based on the Akka actor framework.
Revised:  Grounding: We have implemented PSAC for a state machine-based DSL called Rebel, on top of a runtime based on the Akka actor framework.
Edit intent: coherence
Original:  Our performance evaluation shows that PSAC exhibits the same scalability and latency characteristics as standard  2PC, but obtains up to 1.8 times median higher throughput in congested scenarios  .
Revised:  Our performance evaluation shows that PSAC exhibits the same scalability and latency characteristics as standard 2PC, and obtains up to 1.8 times median higher throughput in congested scenarios .
Edit intent: coherence
Original: Alpha complex, a subset of the Delaunay triangulation, has been extensively used as the underlying representation for biomolecular structures.
Revised: The alpha complex, a subset of the Delaunay triangulation, has been extensively used as the underlying representation for biomolecular structures.
Edit intent: fluency
Original:  We propose a GPU based parallel algorithm for the computation of the alpha complex, which exploits the knowledge of typical spatial distribution and sizes of atoms in a biomolecule.
Revised:  We propose a GPU-based parallel algorithm for the computation of the alpha complex, which exploits the knowledge of typical spatial distribution and sizes of atoms in a biomolecule.
Edit intent: fluency
Original:  The first stage proceeds in a bottom up fashion and computes a superset of the edges, triangles, and tetrahedra belonging to the alpha complex.
Revised:  The first stage proceeds in a bottom-up fashion and computes a superset of the edges, triangles, and tetrahedra belonging to the alpha complex.
Edit intent: fluency
Original:  Computational experiments on several biomolecules demonstrate the superior performance of the algorithm, upto 50x when compared to existing methods that are optimized for biomolecules.
Revised:  Computational experiments on several biomolecules demonstrate the superior performance of the algorithm, up to a factor of 50 when compared to existing methods that are optimized for biomolecules.
Edit intent: clarity
Original:  Functional correctness or noninterference of these systems  have conveniently been formulated as safety properties.
Revised:  Desirable properties of these systems have conveniently been formulated as safety properties.
Edit intent: clarity
Original:  In order to automatically synthesize predicates to enforce safety or noninterference, we generalize FO transition systems to FO safety games.
Revised:  In order to automatically synthesize strategies that enforce safety or noninterference, we generalize FO transition systems to FO safety games.
Edit intent: clarity
Original:  Based on general techniques for second-order quantifier elimination, we provide abstraction and refinement techniques to synthesize FO-expressible strategies that enforce safety.
Revised:  Based on general techniques for second-order quantifier elimination, we provide abstraction and refinement techniques in order to synthesize FO strategies that enforce safety.
Edit intent: clarity
Original:  We demonstrate the usefulness of our approach by automatically inferring nontrivial FO specifications for message passing in a leader election protocol as well as for a conference management system to exclude unappreciated disclosure of reports.
Revised:  We demonstrate the usefulness of our approach by inferring nontrivial FO specifications for message passing in a leader election protocol as well as for a conference management system to exclude unappreciated disclosure of reports.
Edit intent: clarity
Original:  We demonstrate the usefulness of our approach by automatically inferring nontrivial FO specifications for message passing in a leader election protocol as well as for a conference management system to exclude unappreciated disclosure of reports.
Revised:  We demonstrate the usefulness of our approach by automatically inferring nontrivial FO specifications in a leader election protocol as well as for a conference management system to exclude unappreciated disclosure of reports.
Edit intent: clarity
Original: Graph drawing and visualisation techniques are important tools for the exploratory analysis of complex systems.
Revised: Network visualisation techniques are important tools for the exploratory analysis of complex systems.
Edit intent: clarity
Original:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e.  which nodes can  directly and indirectly  influence each other via a so-called causal path.
Revised:  In dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e. which nodes can directly and indirectly influence each other via a so-called causal path.
Edit intent: clarity
Original:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e.  which nodes can  directly and indirectly  influence each other via a so-called causal path.
Revised:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e. , which nodes can directly and indirectly influence each other via a so-called causal path.
Edit intent: fluency
Original:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e.  which nodes can  directly and indirectly  influence each other via a so-called causal path.
Revised:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e. which nodes can , directly and indirectly influence each other via a so-called causal path.
Edit intent: fluency
Original:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e.  which nodes can  directly and indirectly  influence each other via a so-called causal path.
Revised:  In such dynamic graphs, the temporal ordering of time-stamped edges determines the causal topology of a system, i.e. which nodes can directly and indirectly , influence each other via a so-called causal path.
Edit intent: fluency
Original:  While this causal topology is crucial to understand dynamical processes,  the role of nodes, or cluster structures , we lack graph drawing techniques that incorporate this information into static visualisations.
Revised:  This causal topology is crucial to understand dynamical processes, the role of nodes, or cluster structures , we lack graph drawing techniques that incorporate this information into static visualisations.
Edit intent: coherence
Original:  While this causal topology is crucial to understand dynamical processes,  the role of nodes, or cluster structures , we lack graph drawing techniques that incorporate this information into static visualisations.
Revised:  While this causal topology is crucial to understand dynamical processes, the role of nodes, or detect clusters. However , we lack graph drawing techniques that incorporate this information into static visualisations.
Edit intent: clarity
Original:  Addressing this gap, we present a novel dynamic graph drawing algorithm that utilises higher-order graphical models of causal paths in time series data to compute time-aware static graph visualisations.
Revised:  Addressing this gap, we present a novel dynamic graph visualisation algorithm that utilises higher-order graphical models of causal paths in time series data to compute time-aware static graph visualisations.
Edit intent: clarity
Original: A method is proposed to infer a Generalised Additive Neural Network (GANN) from an inital Multi-layer Perceptron (MLP) .
Revised: Among interpretable machine learning methods, the class of Generalised Additive Neural Network (GANN) from an inital Multi-layer Perceptron (MLP) .
Edit intent: clarity
Original:   The performance of the PRN matches Gradient Boosting Machines, Support Vector Machines and Random Forests on six data sets from the UCI repository .
Revised:  The performance of the PRN matches Gradient Boosting Machines, Support Vector Machines and Random Forests .
Edit intent: clarity
Original: The central importance of large scale eigenvalue problems in scientific computation necessitates the development  massively parallel algorithms for their solution.
Revised: The central importance of large scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution.
Edit intent: fluency
Original:  However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively.
Revised:  However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing massive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively.
Edit intent: clarity
Original: Entity resolution (ER) refers to the problem of identifying records in one or more relations that refer to the same real-world entity.
Revised: Entity resolution (ER) refers to the problem of matching records in one or more relations that refer to the same real-world entity.
Edit intent: clarity
Original:  ER has been extensively studied by the database community with supervised machine learning approaches achieving the state-of-the-art results .
Revised:  While supervised machine learning approaches achieving the state-of-the-art results .
Edit intent: clarity
Original:  ER has been extensively studied by the database community with supervised machine learning approaches achieving the state-of-the-art results .
Revised:  ER has been extensively studied by the database community with supervised machine learning (ML) approaches achieve the state-of-the-art results .
Edit intent: clarity
Original:  In this paper we propose the problem of performing "covert computation" within tile self-assembly that seeks to design self-assembly systems that "conceal" both the input and computational history of performed computations.
Revised:  In this paper we propose the problem of performing ``covert computation'' within tile self-assembly that seeks to design self-assembly systems that "conceal" both the input and computational history of performed computations.
Edit intent: fluency
Original:  In this paper we propose the problem of performing "covert computation" within tile self-assembly that seeks to design self-assembly systems that "conceal" both the input and computational history of performed computations.
Revised:  In this paper we propose the problem of performing "covert computation" within tile self-assembly that seeks to design self-assembly systems that ``conceal'' both the input and computational history of performed computations.
Edit intent: fluency
Original:  We achieve these results within the growth-only restricted abstract tile assembly model (aTAM) with positive and negative interactions.
Revised:  We achieve these results within the growth-only restricted abstract Tile Assembly Model (aTAM) with positive and negative interactions.
Edit intent: fluency
Original: Computational Politics is the study of computational methods to analyze and moderate users \textquotesingle behaviors related to political activities such as election campaign persuasion, political affiliation, and opinion mining.
Revised: Computational Politics is the study of computational methods to analyze and moderate users ' behaviors related to political activities such as election campaign persuasion, political affiliation, and opinion mining.
Edit intent: clarity
Original:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to a massive number of users joining the online communities and to the digitization of analogous data such as political debates.
Revised:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to massive numbers of users joining the online communities and to the digitization of analogous data such as political debates.
Edit intent: fluency
Original:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to a massive number of users joining the online communities and to the digitization of analogous data such as political debates.
Revised:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to a massive number of users joining online communities and to the digitization of analogous data such as political debates.
Edit intent: fluency
Original:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to a massive number of users joining the online communities and to the digitization of analogous data such as political debates.
Revised:  With the rapid development and ease of access to the Internet, Information Communication Technologies (ICT) have given rise to a massive number of users joining the online communities and the digitization of analogous data such as political debates.
Edit intent: fluency