wanyu/IteraTeR_v2 huggingface dataset:
Original:  The class of finite width tree structured orders contains finite orders ({0, 1}, int32, int64, ..., float, double, ...), and orders contructed from them on a tree structure.
Revised:  The class of finite width tree structured orders contains finite orders ({0, 1}, int32, int64, ..., float, double, ...), and orders constructed from them on a tree structure.
Edit intent: fluency
Original:  The true result of this article is an efficient universality result for lexicographic order, or more generally for some linear extensions of the partial order `Next': `if current elements are equal, compare next elements '.
Revised:  The true result of this article is an efficient universality result for lexicographic order, or more generally for some linear extensions of the partial order `Next': `if current items are equal, compare next elements '.
Edit intent: clarity
Original:  The true result of this article is an efficient universality result for lexicographic order, or more generally for some linear extensions of the partial order `Next': `if current elements are equal, compare next elements '.
Revised:  The true result of this article is an efficient universality result for lexicographic order, or more generally for some linear extensions of the partial order `Next': `if current elements are equal, compare next items '.
Edit intent: clarity
Original: C language is one of the most popular languages in system programming and applications written in C have been widely used by different industries .
Revised: C language is one of the most popular languages for software systems .
Edit intent: clarity
Original:  The proposed algorithm has been implemented in a tool called C2M.
Revised:  The proposed algorithm has been implemented by a tool called C2M.
Edit intent: clarity
Original:  A case study is given to show how the approach works .
Revised:  A benchmark of experiments including 13 real-world Xd-C programs is conducted. The results show that C2M works effectively .
Edit intent: coherence
Original:  The second approach, based on the idea of an election microstructure, describes the collective behaviour of the electorate by modelling the voting preferences of individual members of the electorate .
Revised:  The second approach, based on the idea of an election microstructure, describes the collective behaviour of the electorate by modelling the preferences of individual members of the electorate .
Edit intent: clarity
Original:  The second approach, based on the idea of an election microstructure, describes the collective behaviour of the electorate by modelling the voting preferences of individual members of the electorate .
Revised:  The second approach, based on the idea of an election microstructure, describes the collective behaviour of the electorate by modelling the voting preferences of individual voters .
Edit intent: clarity
Original:  This paper addresses both  these issues.
Revised:  This paper addresses both of these issues.
Edit intent: fluency
Original:  The first approach, based on the idea of a representative voter, is shown to be suitable to obtain a qualitative understanding of phenomena associated with fake news at a macroscopic level.
Revised:  The first approach, based on the idea of a representative voter, is shown to be suitable for obtaining a qualitative understanding of phenomena associated with fake news at a macroscopic level.
Edit intent: fluency
Original:  It is shown through a simulation study that the mere knowledge that pieces of fake news may be in circulation goes a long way towards mitigating the impact of fake news.
Revised:  It is shown through a simulation study that the mere knowledge that fake news may be in circulation goes a long way towards mitigating the impact of fake news.
Edit intent: clarity
Original:  The source code is available in URL 
Revised:  The source code is available in URL .
Edit intent: fluency
Original:  The Cartesian grids are dynamically refined to adapt to the evolving interfaces and high vorticity regions .
Revised:  The Cartesian grids are dynamically refined to adapt to the evolving interfaces and track regions of high vorticity .
Edit intent: clarity
Original:  The algorithm combines the interface capturing level set method with a novel velocity-pressure coupled, variable-coefficient incompressible Navier-Stokes solver that is able to implicitly handle six orders of magnitude difference in the material properties.
Revised:  The algorithm combines the interface capturing level set method with a variable-coefficient incompressible Navier-Stokes solver that is able to implicitly handle six orders of magnitude difference in the material properties.
Edit intent: clarity
Original:  We present several test cases to demonstrate the order of accuracy and  scalability of the flow solver.
Revised:  The paper includes several test cases to demonstrate the order of accuracy and scalability of the flow solver.
Edit intent: clarity
Original:  We present several test cases to demonstrate the order of accuracy and  scalability of the flow solver.
Revised:  We present several test cases that demonstrate the order of accuracy and scalability of the flow solver.
Edit intent: fluency
Original:  Fluctuations in the density field due its transport are avoided by employing higher-order total variation diminishing (TVD) and convection-boundedness criterion (CBC) satisfying limiters .
Revised:  The scheme uses higher-order total variation diminishing (TVD) and convection-boundedness criterion (CBC) satisfying limiters .
Edit intent: clarity
Original:  The high-order bounded convective transport is done on a dimension by dimension basis, which makes our scheme simple to extend to two and three spatial dimensions .
Revised:  The high-order bounded convective transport is done on a dimension-by-dimension basis, which makes our scheme simple to extend to two and three spatial dimensions .
Edit intent: fluency
Original:  The high-order bounded convective transport is done on a dimension by dimension basis, which makes our scheme simple to extend to two and three spatial dimensions .
Revised:  The high-order bounded convective transport is done on a dimension by dimension basis, which makes the scheme simple to extend to two and three spatial dimensions .
Edit intent: clarity
Original:  The high-order bounded convective transport is done on a dimension by dimension basis, which makes our scheme simple to extend to two and three spatial dimensions .
Revised:  The high-order bounded convective transport is done on a dimension by dimension basis, which makes our scheme simple to implement .
Edit intent: clarity
Original:  We also demonstrate through several test cases that the lack of consistent mass and momentum transport in the frequently used non-conservative multiphase flow solvers and/ or the use of non-CBC satisfying limiters can fail miserably for convection-dominant high density ratio flows.
Revised:  We also demonstrate through several test cases that the lack of consistent mass and momentum transport in non-conservative multiphase flow solvers and/ or the use of non-CBC satisfying limiters can fail miserably for convection-dominant high density ratio flows.
Edit intent: clarity
Original:  We also demonstrate through several test cases that the lack of consistent mass and momentum transport in the frequently used non-conservative multiphase flow solvers and/ or the use of non-CBC satisfying limiters can fail miserably for convection-dominant high density ratio flows.
Revised:  We also demonstrate through several test cases that the lack of consistent mass and momentum transport in the frequently used non-conservative formulations, which are commonly used in practice, or the use of non-CBC satisfying limiters can fail miserably for convection-dominant high density ratio flows.
Edit intent: clarity
Original:  In this position paper, we proposed a BLockchain-Enabled Social credits System (BLESS) aiming at constructing more trustworthy and safer communities .
Revised:  In this position paper, we suggest to construct trustworthy and safe communities based on a BLockchain-Enabled Social credits System (BLESS) aiming at constructing more trustworthy and safer communities .
Edit intent: clarity
Original:  The decentralized architecture of the blockchain network  not only allows distributed individuals to participate rating process of a SCS , but also provides tamper proof of transaction data in the trustless network environment.
Revised:  The decentralized architecture of the blockchain network , which not only allows distributed individuals to participate rating process of a SCS , but also provides tamper proof of transaction data in the trustless network environment.
Edit intent: coherence
Original:  The decentralized architecture of the blockchain network  not only allows distributed individuals to participate rating process of a SCS , but also provides tamper proof of transaction data in the trustless network environment.
Revised:  The decentralized architecture of the blockchain network not only allows grassroots individuals to participate rating process of a SCS , but also provides tamper proof of transaction data in the trustless network environment.
Edit intent: clarity
Original:   Smart contract enabled authentication and authorization strategy prevents any unauthorized entity from accessing the credit system.
Revised:  The anonymity in blockchain records also protects individuals from being targeted in the fight against powerful enterprises. Smart contract enabled authentication and authorization strategy prevents any unauthorized entity from accessing the credit system.
Edit intent: coherence
Original:  The proposed BLESS scheme is promising to offer a secure, transparent and decentralized social credit system .
Revised:  The BLESS scheme is promising to offer a secure, transparent and decentralized social credit system .
Edit intent: clarity
Original:  The proposed BLESS scheme is promising to offer a secure, transparent and decentralized social credit system .
Revised:  The proposed BLESS scheme is promising to offer a secure, transparent and decentralized SCS .
Edit intent: clarity
Original:  Type 2 Topoisomerase (TopoII) enzymes play an important role in this process but the precise mechanisms yielding systematic disentanglement of DNA in vivo are not clear.
Revised:  Type II Topoisomerase (TopoII) enzymes play an important role in this process but the precise mechanisms yielding systematic disentanglement of DNA in vivo are not clear.
Edit intent: fluency
Original:  The mechanism we uncover is universal in that it does not qualitatively depend on the specific substrate, whether DNA or chromatin, or on the processivity of the SMC proteins ;
Revised:  The mechanism we uncover is universal in that it does not qualitatively depend on the specific substrate, whether DNA or chromatin, or on SMC processivity ;
Edit intent: clarity
Original: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Revised: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Edit intent: clarity
Original: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Revised: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency Communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Edit intent: fluency
Original: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Revised: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) , while eMBB communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Edit intent: clarity
Original: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-RAN system.
Revised: In this paper, a Fog-Radio Access Network (F-RAN) architecture is considered in which Ultra-Reliable and Low-Latency communications (URLLC) traffic is served by the Edge Nodes (ENs) of a cellular network, while enhanced Mobile BroadBand (eMBB ) communications are handled centrally at a cloud processor as in a Cloud-Radio Access Network (C-RAN) system.
Edit intent: fluency
Original:  In addition to the conventional orthogonal multiplexing of the two services, this work evaluates the performance of Heterogeneous Non-Orthogonal Multiple Access (H-NOMA), which enables eMBB and URLLC data, to share the same radio resources.
Revised:  Both uplink and downlink are analyzed by accounting for the heterogeneous performance requirements of eMBB and URLLC data, to share the same radio resources.
Edit intent: clarity
Original:  Moussavi and Shallit obtained that RT_i(2)=2i and RT_2(3)=134.
Revised:  Mousavi and Shallit obtained that RT_i(2)=2i and RT_2(3)=134.
Edit intent: fluency
Original: This paper considers a novel framework to detect communities in a graph from the observation of signals at its nodes.
Revised: This paper considers a new framework to detect communities in a graph from the observation of signals at its nodes.
Edit intent: fluency
Original:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of  low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Revised:  We model the observed signals as noisy outputs of an unknown network process , represented as a graph filter -- that is excited by a set of low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Edit intent: fluency
Original:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of  low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Revised:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter that is excited by a set of low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Edit intent: fluency
Original:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of  low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Revised:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of unknown low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Edit intent: coherence
Original:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of  low-rank inputs . Rather than learning the precise parameters of the graph itself, the proposed method retrieves the community structure directly ;
Revised:  We model the observed signals as noisy outputs of an unknown network process -- represented as a graph filter -- that is excited by a set of low-rank inputs . Rather than learning the precise parameters of the graph itself, we aim at retrieving the community structure directly ;
Edit intent: clarity
Original:  The paper shows that communities can be detected by applying spectral clustering to the low-rank output covariance matrix obtained from the graph signals.
Revised:  The paper shows that communities can be detected by applying a spectral method to the covariance matrix of graph signals.
Edit intent: clarity
Original:  The performance analysis indicates that the community detection accuracy depends on the spectral properties of the graph filter considered.
Revised:  Our analysis indicates that the community detection accuracy depends on the spectral properties of the graph filter considered.
Edit intent: clarity
Original:  The performance analysis indicates that the community detection accuracy depends on the spectral properties of the graph filter considered.
Revised:  The performance analysis indicates that the community detection performance depends on a `low-pass' property of the graph filter considered.
Edit intent: clarity
Original:  Furthermore, we show that the accuracy can be improved via a low-rank matrix  decomposition method when the excitation signals are known.
Revised:  Furthermore, we show that the performance can be improved via a low-rank matrix decomposition method when the excitation signals are known.
Edit intent: clarity
Original:  Numerical experiments demonstrate that our approach is effective for analyzing network data from diffusion, consumers, and social dynamics .
Revised:  Numerical experiments demonstrate that our approach is effective .
Edit intent: clarity
Original: The ability to give a precise and fast prediction for the price movement of stocks is the key to profitability in High Frequency Trading.
Revised: The ability to give precise and fast prediction for the price movement of stocks is the key to profitability in High Frequency Trading.
Edit intent: fluency
Original:  We have analyzed the model's performance based on it's prediction accuracy as well as prediction speed across full-day trading simulations.
Revised:  The paper goes on to analyze the model's performance based on it's prediction accuracy as well as prediction speed across full-day trading simulations.
Edit intent: clarity
Original:   In this paper we prove that computing the difficulty of a critical model is NP-hard and exhibit an algorithm to determine it, in contrast with the upcoming result of Balister, Bollob\'as, Morris and Smith on undecidability in higher dimensions.
Revised:  In this paper we prove that computing the difficulty of a critical model is NP-hard and exhibit an algorithm to determine it, in contrast with the upcoming result of Balister, Bollob\'as, Morris and Smith on uncomputability in higher dimensions.
Edit intent: fluency
Original: Dengue continues to be a significant health burden for individuals living in its endemic region .
Revised: Dengue continues to be a significant health burden in their endemic regions .
Edit intent: clarity
Original:  One of the strategies to reduce this burden requires targeting the vector agent, Ae. aegypti, in which intracellular bacteriumWolbachia has proven to be attractive in achieving this aim.
Revised:  One of the strategies to tackle these infections is to replace the main vector agent, Ae. aegypti, in which intracellular bacteriumWolbachia has proven to be attractive in achieving this aim.
Edit intent: clarity
Original:  Despite the successful introduction of WI Ae. aegypti mosquitoes at a small scale, how the method works and the likelihood of success at a larger scale is not fully understood .
Revised:  Despite the successful introduction of WI Ae. aegypti population .
Edit intent: clarity
Original:  We show that in all these models a purely geometric criterion, represented by a minimal length \bar\ell_min, determines the onset of residual stresses and rigidity.
Revised:  We show that in all these models a geometric criterion, represented by a minimal length \bar\ell_min, determines the onset of residual stresses and rigidity.
Edit intent: clarity
Original:  We show that in all these models a purely geometric criterion, represented by a minimal length \bar\ell_min, determines the onset of residual stresses and rigidity.
Revised:  We show that in all these models a purely geometric criterion, represented by a minimal length \bar\ell_min, determines the onset of prestresses and rigidity.
Edit intent: clarity
Original:  This allows us to predict not only the correct scalings for the elastic material properties, but also the precise magnitudes {\em  for bulk modulus and shear modulus discontinuities at the rigidity transition as well as the magnitude of the Poynting effect.
Revised:  This allows us to predict not only the correct scalings for the elastic material properties, but also the precise {\em for bulk modulus and shear modulus discontinuities at the rigidity transition as well as the magnitude of the Poynting effect.
Edit intent: clarity
Original:  Lastly, our results indicate that in many of these materials one can estimate \bar\ell_min from measurements of local geometric structure, which in turn suggests that imaging of the network structure may be sufficient to characterize large-scale mechanical properties  .
Revised:  Lastly, our results may lay important foundations for ways to estimate \bar\ell_min from measurements of local geometric structure, which in turn suggests that imaging of the network structure may be sufficient to characterize large-scale mechanical properties .
Edit intent: clarity
Original:  Lastly, our results indicate that in many of these materials one can estimate \bar\ell_min from measurements of local geometric structure, which in turn suggests that imaging of the network structure may be sufficient to characterize large-scale mechanical properties  .
Revised:  Lastly, our results indicate that in many of these materials one can estimate \bar\ell_min from measurements of local geometric structure, and thus help develop methods to characterize large-scale mechanical properties .
Edit intent: clarity
Original:  Lastly, our results indicate that in many of these materials one can estimate \bar\ell_min from measurements of local geometric structure, which in turn suggests that imaging of the network structure may be sufficient to characterize large-scale mechanical properties  .
Revised:  Lastly, our results indicate that in many of these materials one can estimate \bar\ell_min from measurements of local geometric structure, which in turn suggests that imaging of the network structure may be sufficient to characterize large-scale mechanical properties from imaging data .
Edit intent: clarity
Original:  Although the study of antisemitism and hate is not new, the scale and rate of change of online data has impacted the efficacy of traditional approaches to measure and understand this worrying trend .
Revised:  Although the study of antisemitism and hate is not new, the scale and rate of change of online data has impacted the efficacy of traditional approaches to measure and understand these troubling trends .
Edit intent: clarity