wanyu/IteraTeR_v2 huggingface dataset:
Original:  Design of an unsupervised community detection loss function to train a GNN  is a fundamental challenge to propose an integrated solution .
Revised:  Design of an unsupervised community detection loss function to train a GNN is a fundamental challenge .
Edit intent: coherence
Original:  We are able to achieve state-of-the-art community detection results on multiple publicly available datasets.
Revised:  We are able to achieve state-of-the-art community detection performance on multiple publicly available datasets.
Edit intent: clarity
Original:  Such measures in the time of social media brought about a new set of challenges -- vulnerability to the toxic impact of online misinformation is high.
Revised:  Such measures in the time of social media brought about a new set of challenges - vulnerability to the toxic impact of online misinformation is high.
Edit intent: fluency
Original:  A case in point is the  COVID-19 . As the virus propagate , so does the associated misinformation and fake news about it leading to infodemic.
Revised:  A case in point is the prevailing COVID-19 . As the virus propagate , so does the associated misinformation and fake news about it leading to infodemic.
Edit intent: clarity
Original:  A case in point is the  COVID-19 . As the virus propagate , so does the associated misinformation and fake news about it leading to infodemic.
Revised:  A case in point is the COVID-19 ; as the virus propagates , so does the associated misinformation and fake news about it leading to infodemic.
Edit intent: fluency
Original:  We present a framework for the distributed control of autonomous vehicles that is safe and guarantees progress for all agents.
Revised:  We present a framework for designing autonomous vehicle behavior in a way that is safe and guarantees progress for all agents.
Edit intent: clarity
Original:  In this paper, we first introduce a new game paradigm which we term the quasi-simultaneous discrete-time game.
Revised:  In this paper, we first introduce a new game paradigm which we term the quasi-simultaneous game.
Edit intent: clarity
Original:  We then define an Agent Protocol agents must use to make decisions in this quasi-simultaneous discrete-time game setting.
Revised:  We then define an agent protocol that all agents must use to make decisions in this quasi-simultaneous discrete-time game setting.
Edit intent: clarity
Original:  We then define an Agent Protocol agents must use to make decisions in this quasi-simultaneous discrete-time game setting.
Revised:  We then define an Agent Protocol agents must use to make decisions in this quasi-simultaneous game setting.
Edit intent: clarity
Original:  The protocol so defined will ensure safety under all traffic conditions and liveness for all agents under "sparse" traffic conditions.
Revised:  The protocol ensures safety under all traffic conditions and liveness for all agents under "sparse" traffic conditions.
Edit intent: clarity
Original:  Our approach acknowledges the influence of Ciprian Foia\c{s , who was passionate about pure, applied, and applications of mathematics.
Revised:  Our approach acknowledges the influence of Ciprian Foias , who was passionate about pure, applied, and applications of mathematics.
Edit intent: fluency
Original:  We introduce a unified semantic framework for behavioural preorders and their characteristic logics in which we parametrize the system type in the coalgebraic paradigm while behavioural preorders are captured as graded monads on the category Pos of partially ordered sets , in generalization of a previous approach to notions of process equivalence.
Revised:  We introduce a unified semantic framework for behavioural preorders and their characteristic logics in which we parametrize the system type in the coalgebraic paradigm while behavioural preorders are captured as graded monads on ~\mathsf{Pos , in generalization of a previous approach to notions of process equivalence.
Edit intent: clarity
Original:  We show the equivalence of graded monads on Pos with theories in a form of graded ordered algebra that we introduce here.
Revised:  We show that graded monads on Pos with theories in a form of graded ordered algebra that we introduce here.
Edit intent: clarity
Original:  We introduce a unified semantic framework for behavioural preorders and their characteristic logics in which we parametrize the system type as a functor on the category Pos of partially ordered sets following the paradigm of universal coalgebra, while behavioural preorders are captured as graded monads on ~ Pos, in generalization of a previous approach to notions of process equivalence.
Revised:  We introduce a unified semantic framework for behavioural preorders and their characteristic logics in which we parametrize the system type as a functor on the category Pos of partially ordered sets following the paradigm of universal coalgebra, while behavioural preorders are captured as graded monads on Pos, in generalization of a previous approach to notions of process equivalence.
Edit intent: fluency
Original:  We show that graded monads on ~ Pos are induced by a form of graded inequational theories that we introduce here.
Revised:  We show that graded monads on Pos are induced by a form of graded inequational theories that we introduce here.
Edit intent: fluency
Original:  In experimental evaluation , RGBD-Net not only produces novel views with higher quality than the previous state-of-the-art methods, but also the obtained depth maps enable reconstruction of more accurate 3D point clouds than the existing multi-view stereo methods .
Revised:  In experimental evaluation , RGBD-Net not only outperforms the state-of-the-art methods, but also the obtained depth maps enable reconstruction of more accurate 3D point clouds than the existing multi-view stereo methods .
Edit intent: clarity
Original:  In experimental evaluation , RGBD-Net not only produces novel views with higher quality than the previous state-of-the-art methods, but also the obtained depth maps enable reconstruction of more accurate 3D point clouds than the existing multi-view stereo methods .
Revised:  In experimental evaluation , RGBD-Net not only produces novel views with higher quality than the previous state-of-the-art methods, but also the obtained depth maps enable reconstruction of more accurate 3D point clouds that are more accurate than those produced by some state-of-the-art multi-view stereo methods .
Edit intent: clarity
Original: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Revised: Emerging mobility systems such as connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Edit intent: clarity
Original: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Revised: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for more accessible, safe, and efficient transportation. CAVs are expected to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Edit intent: clarity
Original: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Revised: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by allowing users to monitor transportation network conditions and making better operating decisions.
Edit intent: clarity
Original: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and making better operating decisions.
Revised: Connected and automated vehicles (CAVs) provide the most intriguing opportunity for enabling users to significantly improve safety and transportation efficiency by monitoring transportation network conditions and make better operating decisions.
Edit intent: fluency
Original:  CAVs, however, could alter tendency-to-travel, which would eventually lead to a high traffic demand causing rebound effects (e.g., increasing vehicle miles traveled ).
Revised:  However, CAVs could alter the users' tendency-to-travel, which would eventually lead to a high traffic demand causing rebound effects (e.g., increasing vehicle miles traveled ).
Edit intent: clarity
Original:  CAVs, however, could alter tendency-to-travel, which would eventually lead to a high traffic demand causing rebound effects (e.g., increasing vehicle miles traveled ).
Revised:  CAVs, however, could alter tendency-to-travel, leading to a higher traffic demand than expected, causing rebound effects (e.g., increasing vehicle miles traveled ).
Edit intent: clarity
Original:  CAVs, however, could alter tendency-to-travel, which would eventually lead to a high traffic demand causing rebound effects (e.g., increasing vehicle miles traveled ).
Revised:  CAVs, however, could alter tendency-to-travel, which would eventually lead to a high traffic demand causing rebound effects (e.g., increased vehicle-miles-traveled ).
Edit intent: fluency
Original:  In this paper , we focus on  the social factors that could drive an emerging mobility system with CAVs to unsustainable congestion levels.
Revised:  In this chapter , we focus on the social factors that could drive an emerging mobility system with CAVs to unsustainable congestion levels.
Edit intent: clarity
Original:  In this paper , we focus on  the social factors that could drive an emerging mobility system with CAVs to unsustainable congestion levels.
Revised:  In this paper , we focus on how to tackle the social factors that could drive an emerging mobility system with CAVs to unsustainable congestion levels.
Edit intent: clarity
Original:  In this paper , we focus on  the social factors that could drive an emerging mobility system with CAVs to unsustainable congestion levels.
Revised:  In this paper , we focus on the social factors that could drive an emerging mobility system to unsustainable congestion levels.
Edit intent: clarity
Original:  We propose a mobility market to model the travelers' decision-making on how to travel in a smart city network with connected roads and public transit infrastructure.
Revised:  We propose a mobility market to model the travelers' decision-making on how to travel in a smart city network with roads and public transit infrastructure.
Edit intent: clarity
Original:  Using techniques from mechanism design, we introduce appropriate monetary incentives (e.g., tolls, fees, subsidies) , and we show how a mobility system consisting of selfish travelers that seek to travel either with a CAV or use public transit can be socially efficient.
Revised:  Using techniques from mechanism design, we introduce appropriate monetary incentives (e.g., tolls, fares, fees) and show how a mobility system consisting of selfish travelers that seek to travel either with a CAV or use public transit can be socially efficient.
Edit intent: clarity
Original:  Thus, our mobility market ensures that travelers always report their personal travel requirements truthfully , always benefit from participating in the market , and the market always generates revenue from each traveler .
Revised:  Thus, our mobility market ensures that travelers always report their travel preferences truthfully and always benefit from participating in the market , and the market always generates revenue from each traveler .
Edit intent: clarity
Original:  However, CAVs could alter the users' tendency-to-travel, leading to a higher traffic demand than expected,  causing rebound effects (e.g., increased vehicle-miles-traveled).
Revised:  However, CAVs could alter the users' tendency-to-travel, leading to a higher traffic demand than expected, thus causing rebound effects (e.g., increased vehicle-miles-traveled).
Edit intent: coherence
Original:  In this chapter, we focus on how to tackle the social factors that could drive an emerging mobility system to unsustainable congestion levels.
Revised:  In this chapter, we focus on tackling social factors that could drive an emerging mobility system to unsustainable congestion levels.
Edit intent: coherence
Original:  Furthermore, the proposed mobility market ensures that travelers always report their travel preferences truthfully and always benefit from participating in the market;
Revised:  Furthermore, the proposed mobility market ensures that travelers always report their true travel preferences and always benefit from participating in the market;
Edit intent: clarity
Original:  lastly, we also show that the market collects enough payments to cover its operating costs.
Revised:  lastly, we also show that the market generates enough revenue to potentially cover its operating costs.
Edit intent: clarity
Original:  They show that the Random Forest is the best performing and most reliable model, with  predictive performance consistently better than relying on the current bandwidth (+19.73\% in mean absolute error and +18.00\% in root mean square error).
Revised:  They show that the Random Forest is the best performing and most reliable model, with a predictive performance consistently better than relying on the current bandwidth (+19.73\% in mean absolute error and +18.00\% in root mean square error).
Edit intent: fluency
Original:  We find that this approach yields stronger defense against adversarial attacks than Adversarial training, a state-of-the-art software defense.
Revised:  We find that this approach yields stronger defense against adversarial attacks than adversarial training, a state-of-the-art software defense.
Edit intent: fluency
Original:  This decoupling method greatly simplifies the computation of the whole MHD system.
Edit intent: coherence
Original:  The proposed method is spatial dimension-independent , geometrically flexible, learns from sparsely-available data and the learned model does not depend on any specific initial and boundary conditions .
Revised:  The proposed method is spatial dimension-independent and geometrically flexible .
Edit intent: coherence
Original:  We demonstrate our method in the forecasting task for  two-dimensional wave equation and  Burgers-Fisher equation in multiple geometries with different boundary conditions  .
Revised:  We demonstrate our method in the forecasting task for the two-dimensional wave equation and Burgers-Fisher equation in multiple geometries with different boundary conditions .
Edit intent: fluency
Original:  We demonstrate our method in the forecasting task for  two-dimensional wave equation and  Burgers-Fisher equation in multiple geometries with different boundary conditions  .
Revised:  We demonstrate our method in the forecasting task for two-dimensional wave equation and the Burgers-Fisher equation in multiple geometries with different boundary conditions .
Edit intent: fluency
Original:  Their steady-state (s.s.) probabilities are given in terms of their transition rates by the Matrix-Tree theorem (MTT)  .
Revised:  Their steady-state (s.s.) probabilities are given in terms of transition rates using the Matrix-Tree theorem (MTT) .
Edit intent: clarity
Original:  The MTT uses spanning trees in a graph-theoretic representation of the system and reveals that, away from thermodynamic equilibrium, s.s. probabilities become globally dependent on all transition ratesand the resulting expressions grow super-exponentially in the graph size.
Revised:  The MTT reveals that, away from thermodynamic equilibrium, s.s. probabilities become globally dependent on all transition ratesand the resulting expressions grow super-exponentially in the graph size.
Edit intent: clarity
Original:  The MTT uses spanning trees in a graph-theoretic representation of the system and reveals that, away from thermodynamic equilibrium, s.s. probabilities become globally dependent on all transition ratesand the resulting expressions grow super-exponentially in the graph size.
Revised:  The MTT uses spanning trees in a graph-theoretic representation of the system and reveals that, away from equilibrium, s.s. probabilities become globally dependent on all transition ratesand the resulting expressions grow super-exponentially in the graph size.
Edit intent: clarity
Original:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that the s.s. probability of vertex i is proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along a minimal path , P, from i to a reference vertex.
Revised:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that s.s. probability of vertex i is proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along a minimal path , P, from i to a reference vertex.
Edit intent: clarity
Original:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that the s.s. probability of vertex i is proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along a minimal path , P, from i to a reference vertex.
Revised:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that the s.s. probabilities are proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along a minimal path , P, from i to a reference vertex.
Edit intent: clarity
Original:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that the s.s. probability of vertex i is proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along a minimal path , P, from i to a reference vertex.
Revised:  Assuming Arrhenius rates with vertex energies and edge barrier energies , we show that the s.s. probability of vertex i is proportional to the average of \exp(-S(P)), where S(P) is the entropy generated along minimal paths , P, from i to a reference vertex.
Edit intent: fluency
Original:  The average is taken over a Boltzmann-like probability distribution on spanning trees , whose ``energies'' are their total edge barrier energies .
Revised:  The average is taken over a probability distribution on spanning trees , whose ``energies'' are their total edge barrier energies .
Edit intent: clarity
Original:  The average is taken over a Boltzmann-like probability distribution on spanning trees , whose ``energies'' are their total edge barrier energies .
Revised:  The average is taken over a Boltzmann-like probability distribution on spanning trees , whose ``energies'' are their total edge barrier energy .
Edit intent: fluency
Original:  This reformulation offers a thermodynamic interpretation that smoothly generalises equilibrium statistical mechanics and it reorganises the expression complexity: the number of distinct minimal-path entropies depends on the number of edges where energy is expended , not on graph size.
Revised:  This reformulation offers a thermodynamic interpretation that smoothly generalises equilibrium statistical mechanics and reorganises the expression complexity: the number of distinct minimal-path entropies depends on the number of edges where energy is expended , not on graph size.
Edit intent: coherence
Original:  This algorithm , named 'burning greedy permutation' algorithm, is based on greedy permutations and is easy to implement .
Revised:  The proposed algorithm is based on greedy permutations and is easy to implement .
Edit intent: clarity
Original:  According to a brief empirical analysis, the proposed algorithm generates competitive solutions , some of which are better than the best previously known .
Revised:  According to a brief empirical analysis, it generates competitive solutions , some of which are better than the best previously known .
Edit intent: clarity
Original:  According to a brief empirical analysis, the proposed algorithm generates competitive solutions , some of which are better than the best previously known .
Revised:  According to a brief empirical analysis, the proposed algorithm generates competitive solutions .
Edit intent: clarity
Original: We analyze the effect of efficient cooperative immigrants on a population playing a public goods game .
Revised: In a world of hardening borders, nations may deprive themselves of enjoying the benefits of cooperative immigrants. Here, we analyze the effect of efficient cooperative immigrants on a population playing a public goods game .
Edit intent: clarity
Original:  First, a selected set of state-of-the-art benchmarks are reproduced as a verification step.
Revised:  First, a selected set of benchmarks are reproduced as a verification step.
Edit intent: clarity
Original:  Among them, we model a cantilever beam problem with spherical voids whose distribution is based on a Cube Closest Packing(CCP) .
Revised:  Among them, we model a cantilever beam problem with spherical voids whose distribution is based on a Cubic Closest Packing .
Edit intent: clarity
Original:  This test involves a discrete domain with up to 11.7M Degrees Of Freedom (DOFs) solved in less than two hours on 3072 cores of a parallel supercomputer.
Revised:  This test involves a discrete domain with up to 11.7M Degrees Of Freedom solved in less than two hours on 3072 cores of a parallel supercomputer.
Edit intent: clarity
Original:  Among them, we model a cantilever beam problem with spherical voids whose distribution is based on a Cubic Closest Packing .
Revised:  Among them, we model a cantilever beam problem with spherical hollows distributed in a Simple Cubic array .
Edit intent: clarity
Original: We introduce the music Ternary Modalities Dataset (MTM Dataset) , which is created by our group to learn joint representations among music three modalities in music information retrieval (MIR), including three types of cross-modal retrieval . Learning joint representations for cross-modal retrieval among three modalities has been limited because of the limited availability of large dataset including three or more modalities .
Revised: We introduce the music Ternary Modalities Dataset (MTM Dataset) , which is created by our group to learn joint representations among music three modalities in music information retrieval (MIR), including three types of cross-modal retrieval (CMR). Little large music dataset including three or more modalities .
Edit intent: clarity
Original:  The dataset and usage examples are available at URL
Revised:  The MusicTM-Dataset are accessible in URL //github.com/dddzeng/MusicTM-Dataset.
Edit intent: clarity
Original:  In this paper, we discuss the design methodology of the database, analyze the similarities and dissimilarities in characteristics of speech and singing voices, and provide some strategies to address relationships between these characteristics for converting one to another.
Revised:  In this paper, we discuss the design methodology of the database, analyse the similarities and dissimilarities in characteristics of speech and singing voices, and provide some strategies to address relationships between these characteristics for converting one to another.
Edit intent: fluency
Original:  We develop benchmark systems  for speech-to-singing alignment, spectral mapping  and conversion using the NHSS database.
Revised:  We develop benchmark systems for speech-to-singing alignment, spectral mapping , and conversion using the NHSS database.
Edit intent: fluency