wanyu/IteraTeR_v2 huggingface dataset:
Original:  To understand efficient network communication , we develop a theory specifying minimum rates of message diffusion that brain regions should transmit for an expected fidelity, and we test five predictions from the theory .
Revised:  To understand efficient network communication , we develop a theory specifying minimum rates of message transmission between brain regions to achieve an expected fidelity, and we test five predictions from the theory .
Edit intent: clarity
Original:  We introduce compression efficiency, which quantifies differing trade-offs between lossy compression and communication fidelity in structural networks.
Revised:  We introduce compression efficiency, which quantifies the trade-off between lossy compression and communication fidelity in structural networks.
Edit intent: clarity
Original:  We introduce compression efficiency, which quantifies differing trade-offs between lossy compression and communication fidelity in structural networks.
Revised:  We introduce compression efficiency, which quantifies differing trade-offs between lossy compression and transmission fidelity in structural networks.
Edit intent: clarity
Original: Stochastic epidemic models (SEMs) fit to incidence data are critical to elucidating outbreak transmission dynamics, shaping response strategies, and preparing for future epidemics.
Revised: Stochastic epidemic models (SEMs) fit to incidence data are critical to elucidating outbreak dynamics, shaping response strategies, and preparing for future epidemics.
Edit intent: clarity
Original:  Our framework is computationally robust when the model dynamics are complex and can be applied to a broad class of SEMs.
Revised:  Our framework is computationally robust when the model dynamics are complex and applies to a broad class of SEMs.
Edit intent: clarity
Original:  We  apply our method to national-level surveillance counts from the 2013--2015 West Africa Ebola outbreak , modeling within-country transmission and importation of infections from neighboring countries .
Revised:  We apply our method to national surveillance counts from the 2013--2015 West Africa Ebola outbreak , modeling within-country transmission and importation of infections from neighboring countries .
Edit intent: clarity
Original:  We  apply our method to national-level surveillance counts from the 2013--2015 West Africa Ebola outbreak , modeling within-country transmission and importation of infections from neighboring countries .
Revised:  We apply our method to national-level surveillance counts from the 2013--2015 West Africa Ebola outbreak .
Edit intent: clarity
Original:  Publications may describe the software for which source code is unavailable, documentation is incomplete or unmaintained, and analytical source code is missing . Publications that lack this information compromise the role of peer review in evaluating technical strength and scientific contribution.
Revised:  Publications may present academic software for which source code is unavailable, documentation is incomplete or unmaintained, and analytical source code is missing . Publications that lack this information compromise the role of peer review in evaluating technical strength and scientific contribution.
Edit intent: clarity
Original:  Publications may describe the software for which source code is unavailable, documentation is incomplete or unmaintained, and analytical source code is missing . Publications that lack this information compromise the role of peer review in evaluating technical strength and scientific contribution.
Revised:  Publications may describe the software for which essential materials are or become unavailable, such as source code and documentation . Publications that lack this information compromise the role of peer review in evaluating technical strength and scientific contribution.
Edit intent: clarity
Original:  Publications may describe the software for which source code is unavailable, documentation is incomplete or unmaintained, and analytical source code is missing . Publications that lack this information compromise the role of peer review in evaluating technical strength and scientific contribution.
Revised:  Publications may describe the software for which source code is unavailable, documentation is incomplete or unmaintained, and analytical source code is missing . Publications that lack such information compromise the role of peer review in evaluating technical strength and scientific contribution.
Edit intent: clarity
Original:  We herein provide recommendations to improve reproducibility, transparency, and rigor in computational biology -- precisely the values which should be emphasized in foundational life and medical science curricula.
Revised:  We herein provide recommendations to improve reproducibility, transparency, and rigor in computational biology - precisely on the main values which should be emphasized in foundational life and medical science curricula.
Edit intent: clarity
Original:  We herein provide recommendations to improve reproducibility, transparency, and rigor in computational biology -- precisely the values which should be emphasized in foundational life and medical science curricula.
Revised:  We herein provide recommendations to improve reproducibility, transparency, and rigor in computational biology -- precisely the values which should be emphasized in life science curricula.
Edit intent: clarity
Original:  We enforce a condition on these derivations to ensure their cut eliminationproperty and thus validity .
Revised:  To ensure cut elimination, we impose a validity condition on infinite derivations .
Edit intent: clarity
Original:  What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes critical for large-sized data input , as memory constraints limit batching across the nodes.
Revised:  What's more, the inherently inter-connected nature precludes parallelization within the graph, which becomes critical for large-sized graph , as memory constraints limit batching across the nodes.
Edit intent: clarity
Original:  Instead of fedd GRAPH-BERT with the complete large input graph, we propose to train GRAPH-BERT with sampled linkless subgraphs within the local context.
Revised:  Instead of feeding GRAPH-BERT with the complete large input graph, we propose to train GRAPH-BERT with sampled linkless subgraphs within the local context.
Edit intent: fluency
Original:  In addition, the pre-trained GRAPH-BERT model can also be fine-tuned with additional output layers/functional components as the state-of-the-art if any supervised label information or certain application oriented objective is available.
Revised:  In addition, the pre-trained GRAPH-BERT can also be fine-tuned with additional output layers/functional components as the state-of-the-art if any supervised label information or certain application oriented objective is available.
Edit intent: clarity
Original:  In addition, the pre-trained GRAPH-BERT model can also be fine-tuned with additional output layers/functional components as the state-of-the-art if any supervised label information or certain application oriented objective is available.
Revised:  In addition, the pre-trained GRAPH-BERT model can also be transferred to other application tasks directly or with necessary fine-tuning if any supervised label information or certain application oriented objective is available.
Edit intent: clarity
Original:  We have tested the effectiveness of GRAPH-BERT on several benchmark graph datasets.
Revised:  We have tested the effectiveness of GRAPH-BERT on several graph benchmark datasets.
Edit intent: fluency
Original:  Particularly, mixing services in Bitcoin, originally designed to enhance transaction anonymity, have been widely employed for money laundry to complicate trailing illicit fund.
Revised:  Particularly, mixing services in Bitcoin, originally designed to enhance transaction anonymity, have been widely employed for money laundry to complicate trailing illicit fund.
Edit intent: fluency
Original: This work presents the GPU acceleration of the open-source code CaNS for very fast massively-parallel simulations of canonical fluid flows.
Revised: This work presents the GPU acceleration of the open-source code CaNS for very fast massively-parallel simulations of canonical fluid flows.
Edit intent: fluency
Original:  The distinct feature of the many-CPU Navier-Stokes solver in CaNS is its fast  solver for the second-order finite-difference Poisson equation, based on the method of eigenfunction expansions.
Revised:  The distinct feature of the many-CPU Navier-Stokes solver in CaNS is its fast solver for the second-order finite-difference Poisson equation, based on the method of eigenfunction expansions.
Edit intent: fluency
Original:  The non-intrusive reduced order method is based on dynamic mode decomposition  and it is coupled with dynamic active subspaces  to enhance the future state prediction of the target function and reduce the parameter space dimensionality.
Revised:  The non-intrusive reduced order method is based on dynamic mode decomposition (DMD) and it is coupled with dynamic active subspaces to enhance the future state prediction of the target function and reduce the parameter space dimensionality.
Edit intent: clarity
Original:  The proposed pipeline results in a decrease of the relative error in the approximation of the time-varying lift coefficient of more than 4%DIFDELCMD < \\%%% %DIF < at regime.abstract 
Revised:  The proposed pipeline results in a decrease of the relative error in the approximation of the time-varying lift coefficient %DIFDELCMD < \\%%% %DIF < at regime.abstract 
Edit intent: coherence
Original: Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the  efficiency in solving the integer factoring and searching a database faster than any currently known classical computer algorithm.
Revised: Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in solving the integer factoring and searching a database faster than any currently known classical computer algorithm.
Edit intent: clarity
Original: Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the  efficiency in solving the integer factoring and searching a database faster than any currently known classical computer algorithm.
Revised: Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the efficiency in solving the integer factoring and searching a database faster than any currently known classical computing algorithm.
Edit intent: fluency
Original:  Up to now, all the research on adiabatic quantum systems has dealt with polynomial time-bounded computation and little attention has been paid to, for example , adiabatic quantum systems consuming only constant memory space.
Revised:  Up to now, all the research on adiabatic quantum systems has dealt with polynomial time-bounded computation and little attention has been paid to, for instance , adiabatic quantum systems consuming only constant memory space.
Edit intent: fluency
Original:  As our answer to this eminent but profound question, we first lay out a fundamental platform for adiabatic evolutionary quantum systems (AEQSs) with limited computational resources  and then establish how to construct AEQSs using quantum finite automata.
Revised:  As our answer to this eminent but profound question, we first lay out a fundamental platform to carry out adiabatic evolutionary quantum systems (AEQSs) with limited computational resources and then establish how to construct AEQSs using quantum finite automata.
Edit intent: clarity
Original:  We also explore fundamental structural properties of decision problems (or equivalently, languages) solved quickly by such AEQSs.
Revised:  We further explore fundamental structural properties of decision problems (or equivalently, languages) solved quickly by such AEQSs.
Edit intent: clarity
Original:  We also explore fundamental structural properties of decision problems (or equivalently, languages) solved quickly by such AEQSs.
Revised:  We also explore fundamental structural properties of decision problems (or equivalently, languages) solved quickly by the appropriately constructed AEQSs.
Edit intent: clarity
Original:  Here we aim to address social choice in the the presence of sybils and the absence of full participation .
Revised:  Here we aim to address social choice in the presence of sybils and the absence of full participation .
Edit intent: fluency
Original:  Here we aim to address social choice in the the presence of sybils and the absence of full participation .
Revised:  Here we aim to address social choice in the the presence of sybils and voter abstention .
Edit intent: clarity
Original:  To do so we assume the status-quo (Reality) as an ever-present distinguished alternative, and study \emph{Reality Enforcing voting rules , which add virtual votes in support of the status quo .
Revised:  To do so we assume the status-quo (Reality) as an ever-present distinguished alternative, and study \emph{Reality Enforcing voting rules , which add virtual votes in support of the status quo .
Edit intent: fluency
Original:  To do so we assume the status-quo (Reality) as an ever-present distinguished alternative, and study \emph{Reality Enforcing voting rules , which add virtual votes in support of the status quo .
Revised:  To do so we assume the status-quo (Reality) as an ever-present distinguished alternative, and study \emph{Reality Enforcing voting rules , which add virtual votes in support of the status-quo .
Edit intent: fluency
Original:  We then prove an equivalence between optimal spatial and temporal mixing for hard spheres , an equivalence that is well-known for a wide class of discrete spin systems .
Revised:  We then prove an equivalence between optimal spatial and temporal mixing for hard spheres to deduce our results .
Edit intent: clarity
Original:  In contrast, for the slightly larger parameter called treedepth, there are already several examples of  matching the time bounds obtained for treewidth, but using only polynomial space.
Revised:  In contrast, for the slightly larger parameter called treedepth, there are already several examples of algorithms matching the time bounds obtained for treewidth, but using only polynomial space.
Edit intent: clarity
Original: We investigate the use of physics-informed neural networks-based solution of the PDE satisfied by the probability density function (pdf) of the state of a dynamical system subject to random forcing.
Revised: Physics-informed neural networks are developed to characterize the state of dynamical systems in a random environment. The neural network approximates the probability density function (pdf) of the state of a dynamical system subject to random forcing.
Edit intent: clarity
Original:  Numerical examples show that: 1) the neural network solution can approximate the target solution even for partial integro-differential equations and system of PDEs  , 2) solving either PDE using neural networks yields similar pdfs of the state, and 3) the solution to the PDE can be used to study the behavior of the state for different types of random forcings.
Revised:  Numerical examples show that: 1) the neural network solution can approximate the target solution even for partial integro-differential equations and system of PDEs , 2) solving either PDE using neural networks yields similar pdfs of the state, and 3) the solution to these differential equations can be used to study the behavior of the state for different types of random forcings.
Edit intent: clarity
Original:  Our results  demonstrate that even a minimal level of collaboration among agents greatly reduces regret for all agents.
Revised:  Our results thus demonstrate that even a minimal level of collaboration among agents greatly reduces regret for all agents.
Edit intent: clarity
Original:  We introduce a Status-Quo loss (SQLoss) that incentivizes cooperative behavior by encouraging policystationarity.
Revised:  We introduce a status-quo loss (SQLoss) that incentivizes cooperative behavior by encouraging policystationarity.
Edit intent: fluency
Original:  This article describes two approaches that allow us to solve boundary element equations on surface meshes consisting of several million of triangles while preserving the optimal convergence rates of the Galerkin discretization.
Revised:  This article describes two approaches that allow us to solve boundary element equations on surface meshes consisting of several millions of triangles while preserving the optimal convergence rates of the Galerkin discretization.
Edit intent: fluency
Original:  Most, if not all, existing speech enhancement GANs ( SEGANs ) make use of a single generator to perform one-stage enhancement mapping.
Revised:  However, most, if not all, existing speech enhancement GANs ( SEGANs ) make use of a single generator to perform one-stage enhancement mapping.
Edit intent: coherence
Original:  Most, if not all, existing speech enhancement GANs ( SEGANs ) make use of a single generator to perform one-stage enhancement mapping.
Revised:  Most, if not all, existing speech enhancement GANs ( SEGAN ) make use of a single generator to perform one-stage enhancement mapping.
Edit intent: fluency
Original:  In the two proposed frameworks, the GAN architectures are composed of multiple generators that are chained to accomplish multiple-stage enhancement mapping which gradually refines the noisy input signals in  stage-wise fashion.
Revised:  In the two proposed frameworks, the GAN architectures are composed of multiple generators that are chained to perform multi-stage enhancement mapping, which gradually refines the noisy input signals in stage-wise fashion.
Edit intent: clarity
Original:  In the two proposed frameworks, the GAN architectures are composed of multiple generators that are chained to accomplish multiple-stage enhancement mapping which gradually refines the noisy input signals in  stage-wise fashion.
Revised:  In the two proposed frameworks, the GAN architectures are composed of multiple generators that are chained to accomplish multiple-stage enhancement mapping which gradually refines the noisy input signals in a stage-wise fashion.
Edit intent: fluency
Original:  as a result, different enhancement mappings are learned at different stages of the network .
Revised:  as a result, different enhancement mappings at different stages of the network .
Edit intent: clarity
Original:  The scheme proposed in this paper, in contrast, can deal with this problem by generating only single uniform random number at every time step.
Revised:  The scheme proposed in this paper, in contrast, can deal with this problem by generating very few uniform random numbers at every time step.
Edit intent: clarity
Original:  The scheme saves the time for simulation of very high dimensional SDEs.
Revised:  The scheme saves time in the simulation of very high dimensional SDEs.
Edit intent: fluency
Original:  In particular, we will show that Euler-Maruyama approximation generated by the Walsh system is efficient in high dimensions.
Revised:  In particular, we conclude that an Euler-Maruyama approximation generated by the Walsh system is efficient in high dimensions.
Edit intent: clarity
Original:  The scheme proposed in this paper, in contrast, can deal with this problem by generating very few uniform random numbers at every time step.
Revised:  The schemes proposed in this paper, in contrast, can deal with this problem by generating very few uniform random numbers at every time step.
Edit intent: fluency
Original:  The scheme saves time in the simulation of very high dimensional SDEs.
Revised:  The schemes save time in the simulation of very high dimensional SDEs.
Edit intent: fluency
Original:  In particular, we conclude that an Euler-Maruyama approximation generated by the Walsh system is efficient in high dimensions.
Revised:  In particular, we conclude that an Euler-Maruyama approximation based on the Walsh system is efficient in high dimensions.
Edit intent: clarity
Original:  Here we introduce a general  network-based framework to uncover groups of accounts that are likely coordinated.
Revised:  Here we introduce a general network-based methodology to uncover groups of accounts that are likely coordinated.
Edit intent: clarity
Original:  The proposed method construct coordination networks based on arbitrary behavioral traces shared among accounts.
Revised:  The proposed method constructs coordination networks based on arbitrary behavioral traces shared among accounts.
Edit intent: fluency
Original:  We present five case studies of influence campaigns  in the diverse contexts of U.S. elections, Hong Kong protests, the Syrian civil war, and cryptocurrencies .
Revised:  We present five case studies of influence campaigns in the diverse contexts of U.S. elections, Hong Kong protests, the Syrian civil war, and cryptocurrency manipulation .
Edit intent: clarity
Original:  In each of these cases, we detect networks of coordinated Twitter accounts by examining their identities, images, hashtag sequences, retweets, and temporal patterns.
Revised:  In each of these cases, we detect networks of coordinated Twitter accounts by examining their identities, images, hashtag sequences, retweets, or temporal patterns.
Edit intent: fluency
Original:  The proposed framework proves to be broadly applicable to uncover different kinds of coordination across information warfare scenarios.
Revised:  The proposed approach proves to be broadly applicable to uncover different kinds of coordination across information warfare scenarios.
Edit intent: clarity
Original:  Then , the underlying mechanism of bursting is analysed and the controllability of the number of spikes in each burst period is demonstrated under proper input voltage and input resistor.
Revised:  Furthermore , the underlying mechanism of bursting is analysed and the controllability of the number of spikes in each burst period is demonstrated under proper input voltage and input resistor.
Edit intent: coherence
Original:  Then , the underlying mechanism of bursting is analysed and the controllability of the number of spikes in each burst period is demonstrated under proper input voltage and input resistor.
Revised:  Then , the underlying mechanism of bursting is analyzed and the controllability of the number of spikes in each burst period is demonstrated under proper input voltage and input resistor.
Edit intent: coherence
Original:  Then , the underlying mechanism of bursting is analysed and the controllability of the number of spikes in each burst period is demonstrated under proper input voltage and input resistor.
Revised:  Then , the underlying mechanism of bursting is analysed and the controllability of the number of spikes during each burst period is demonstrated under proper input voltage and input resistor.
Edit intent: clarity
Original:  These results show a promising approach for the efficient use of neuristor in the construction of neural networks.
Revised:  These results show a promising approach for the practical implementation of neuristor in the construction of neural networks.
Edit intent: clarity
Original: This work concerns the numerical approximation of the multicomponent compressible Euler system for a mixture of immiscible fluids in multiple space dimensions and its contribution is twofold .
Revised: This work concerns the numerical approximation of a multicomponent compressible Euler system for a mixture of immiscible fluids in multiple space dimensions and its contribution is twofold .
Edit intent: fluency
Original: This work concerns the numerical approximation of the multicomponent compressible Euler system for a mixture of immiscible fluids in multiple space dimensions and its contribution is twofold .
Revised: This work concerns the numerical approximation of the multicomponent compressible Euler system for a fluid mixture in multiple space dimensions and its contribution is twofold .
Edit intent: clarity