wanyu/IteraTeR_v2 huggingface dataset:
Original:  Many solutions exist, but often suffer from problems such as high computational cost or causing false negative or false positive detections.
Revised:  Many solutions exist, but often suffer from issues such as high computational cost or causing false negative or false positive detections.
Edit intent: fluency
Original:  In practice, these problems can result in results that range from inefficiency and annoyance to catastrophic.
Revised:  In practice, these issues can result in results that range from inefficiency and annoyance to catastrophic.
Edit intent: clarity
Original:  In practice, these problems can result in results that range from inefficiency and annoyance to catastrophic.
Revised:  In practice, these problems can result in problems that range from inefficiency and annoyance to catastrophic.
Edit intent: clarity
Original:  These biomolecular condensates include certain extracellular materials, and intracellular compartments that are characterized as "membraneless organelles '' . Analytical theories are a valuable, computationally efficient tool for addressing general principles.
Revised:  These biomolecular condensates include certain extracellular materials, and intracellular compartments that are characterized as "membraneless organelles " . Analytical theories are a valuable, computationally efficient tool for addressing general principles.
Edit intent: fluency
Original: This paper studies competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Revised: This paper investigates the impact of confirmation bias on competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Edit intent: clarity
Original: This paper studies competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Revised: This paper studies competitive information spread in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Edit intent: clarity
Original: This paper studies competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Revised: This paper studies competitive information spread with confirmation bias in the cyber-social network that comprises individuals in social networks and competitive information sources in cyber layer.
Edit intent: fluency
Original: This paper studies competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in social networks and competitive information sources in cyber layer.
Revised: This paper studies competitive information spread with confirmation bias in the cyber-social networks that comprises individuals in a social network and competitive information sources in cyber layer.
Edit intent: fluency
Original:  The competitive information spread is formulated as a zero-sum game between the competitive information sources, whose pure Nash equilibrium is demonstrated to exist.
Revised:  We formulate the problem as a zero-sum game between the competitive information sources, whose pure Nash equilibrium is demonstrated to exist.
Edit intent: clarity
Original:  The derived Nash equilibrium depends on the innate opinions,  social network topology and parameters of confirmation bias.
Revised:  The derived Nash equilibrium depends on the innate opinions, the social network topology and parameters of confirmation bias.
Edit intent: fluency
Original:  The derived Nash equilibrium depends on the innate opinions,  social network topology and parameters of confirmation bias.
Revised:  The derived Nash equilibrium depends on the innate opinions, social network topology , as well as the parameters of confirmation bias.
Edit intent: clarity
Original:  Nash equilibriums in the scenarios of neutral and extremal group of innate opinions are also investigated .
Revised:  We uncover that confirmation bias moves the equilibrium towards the center only when the innate opinions are also investigated .
Edit intent: coherence
Original:  Numerical examples in the context of the well-known Krackhardt's advice network are provided to demonstrate the correctness of theory results.
Revised:  Numerical examples in the context of well-known Krackhardt's advice network are provided to demonstrate the correctness of theory results.
Edit intent: fluency
Original:  Numerical examples in the context of the well-known Krackhardt's advice network are provided to demonstrate the correctness of theory results.
Revised:  Numerical examples in the context of the well-known Krackhardt's advice network are provided to demonstrate the correctness of theoretical results.
Edit intent: fluency
Original:  For example, a pollination interaction may be particularly likely if the proportions of a bee's tongue match flower shapein a beneficial way.
Revised:  For example, a pollination interaction may be more likely if the proportions of a bee's tongue match flower shapein a beneficial way.
Edit intent: clarity
Original:  Empirical evidence for trait matching , however, varies significantly in strength among different types of ecological networks.
Revised:  Empirical evidence for trait matching , however, vary significantly among different types of ecological networks.
Edit intent: clarity
Original:  Here, we show that ambiguity among empirical trait matching studies may have arisen at least in parts from using overly simple statistical models.
Revised:  Here, we show that ambiguity among empirical trait-matching studies may have arisen at least in parts from using overly simple statistical models.
Edit intent: fluency
Original:  We find that the best ML models can successfully predict species interactions in plant-pollinator networks (up to 0.93 AUC) and outperform conventional regression models .
Revised:  We find that the best ML models can successfully predict species interactions in plant-pollinator networks , outperforming GLMs by a substantial margin .
Edit intent: clarity
Original:  Our results also demonstrate that ML models can better identify the causally responsible trait matching combinations than GLMs.
Revised:  Our results also demonstrate that ML models can better identify the causally responsible trait-matching combinations than GLMs.
Edit intent: fluency
Original:  More generally, our results highlight the potential of ML and artificial intelligence for inference  beyond standard tasks such as  pattern recognition.
Revised:  More generally, our results highlight the potential of machine learning and artificial intelligence for inference beyond standard tasks such as pattern recognition.
Edit intent: clarity
Original: Aggregated Relational Data, known as ARD, capture information about a social network by asking about the number of connections between a person and a group with a particular characteristic , rather than asking about connections between each pair of individuals directly.
Revised: Aggregated Relational Data, known as ARD, capture information about a social network by asking a respondent questions of the form "How many people with characteristic X do you know?" rather than asking about connections between each pair of individuals directly.
Edit intent: clarity
Original:  Firstly, the accuracy of differential operators , such as the gradient, divergence, curl, and Laplacian, is compared for various p on a curved element of the sphere.
Revised:  Firstly, the accuracy of differential operators is compared for various p on a curved element of the sphere.
Edit intent: coherence
Original:  Secondly, by applying the method of moving frames, four different time-dependent PDEs on the sphere , such as conservation laws, diffusion equations, shallow water equations, and Maxwell's equations are numerically solved to investigate the impact of geometric approximation error on the accuracy and conservation properties of high-order numerical schemes for PDEs on the sphere.
Revised:  Secondly, by applying the method of moving frames, four different time-dependent PDEs on the sphere are numerically solved to investigate the impact of geometric approximation error on the accuracy and conservation properties of high-order numerical schemes for PDEs on the sphere.
Edit intent: coherence
Original:  We establish that  the MLE recovers a constant proportion of the hidden submatrix if and only if \lambda%DIFDELCMD < \gtrsim %DIFDELCMD < %%%  } {\rho} \log 1{\rho}}, }{ \frac{1{\rho} \log 1{\rho}}  .
Revised:  We establish that the MLE recovers a constant proportion of the hidden submatrix if %DIFDELCMD < \gtrsim %DIFDELCMD < %%% } {\rho} \log 1{\rho}}, }{ \frac{1{\rho} \log 1{\rho}} .
Edit intent: clarity
Original:  We establish that  the MLE recovers a constant proportion of the hidden submatrix if and only if \lambda%DIFDELCMD < \gtrsim %DIFDELCMD < %%%  } {\rho} \log 1{\rho}}, }{ \frac{1{\rho} \log 1{\rho}}  .
Revised:  We establish that the MLE recovers a constant proportion of the hidden submatrix if and only if \lambda%DIFDELCMD < \gtrsim %DIFDELCMD < %%% } {\rho} \log 1{\rho}}, }{ \frac{1{\rho} \log 1{\rho}} ) .
Edit intent: fluency
Original:  The MLE is computationally intractable in general, and in fact, for \rho>0 sufficiently small, this problem is conjectured to exhibit a statistical-computational gap .
Revised:  The MLE is computationally intractable in general, and in fact, for \rho>0 sufficiently small, this problem is conjectured to exhibit a statistical-computational gap .
Edit intent: fluency
Original:  To provide rigorous evidence for this, we study the likelihood landscape for this problem, and establish that for some \varepsilon>0 and \frac{1{\rho} \log 1{\rho} } \ll \lambda \ll 1{\rho^{1/2 + \varepsilon}}, the problem exhibits a variant of the Overlap-Gap-Property(OGP) .
Revised:  To provide rigorous evidence for this, we study the likelihood landscape for this problem, and establish that for some \varepsilon>0 and \frac{1{\rho} \log 1{\rho} } \ll \lambda \ll 1{\rho^{1/2 + \varepsilon}}, the problem exhibits a variant of the Overlap-Gap-Property (OGP) .
Edit intent: fluency
Original:  Nature, in contrast, has already developed efficient and resilient large-scale networks , including brain connectomes and bird flocks.
Revised:  In contrast, nature has already developed efficient and resilient large-scale networks , including brain connectomes and bird flocks.
Edit intent: clarity
Original:  They are also used to highlighted the effectiveness of starling flocks , where increasing the outdegree is likely to produce a less responsive flock that has the most influential birds poorly positioned to observe a predator and, hence, instigate an evasion manoeuvre  .
Revised:  They are also used to highlighted the effectiveness of starling flocks , where increasing the number of outgoing connections can produce a less responsive flock that has the most influential birds poorly positioned to observe a predator and, hence, instigate an evasion manoeuvre .
Edit intent: clarity
Original:  Using these oracles , any reasonable graph property can be tested  against any reasonable  distribution in the category of planar graphs.
Revised:  Using these oracles any reasonable graph property can be tested against any reasonable distribution in the category of planar graphs.
Edit intent: fluency
Original: Materialisation is often used in RDF systems to derive, in a preprocessing step , all facts implied by given RDF triples and rules.
Revised: Materialisation is often used in RDF systems as a preprocessing step , all facts implied by given RDF triples and rules.
Edit intent: coherence
Original: Materialisation is often used in RDF systems to derive, in a preprocessing step , all facts implied by given RDF triples and rules.
Revised: Materialisation is often used in RDF systems to derive, in a preprocessing step to derive all facts implied by given RDF triples and rules.
Edit intent: fluency
Original:  In financial terms, the introduced time-homogeneity corresponds to time-consistent call prices, given the state of the stock.
Revised:  In financial terms, the introduced time-homogeneity corresponds to a time-consistency condition for call prices, given the state of the stock.
Edit intent: clarity
Original:  The time homogeneity assumption leads to improved price bounds and the possibility to utilize more market data .
Revised:  The time homogeneity assumption leads to improved price bounds as market data from many time points can be incorporated effectively .
Edit intent: clarity
Original: We give a thorough overview of supervised learning and  network design for learning membership on algebraic varieties via deep neural networks.
Revised: We review supervised learning and network design for learning membership on algebraic varieties via deep neural networks.
Edit intent: clarity
Original: We give a thorough overview of supervised learning and  network design for learning membership on algebraic varieties via deep neural networks.
Revised: We give a thorough overview of supervised learning and deep neural network design for learning membership on algebraic varieties via deep neural networks.
Edit intent: fluency
Original:  We show how artificial neural networks can be trained to predict the entanglement type for quantum states.
Revised:  We show how artificial neural networks can predict the entanglement type for quantum states.
Edit intent: clarity
Original:  The computational efficiency can be improved since there is no direct eigenvalue solving in the finest space and the multigrid method can act as the solver for the deduced linear boundary value equations .
Revised:  The computational efficiency can be improved since there is no direct eigenvalue solving in the finest space and the multigrid method can act as the solver for the deduced linear boundary value problems .
Edit intent: clarity
Original:  In this paper, we address various non-trivial challenges in implementing these mechanisms in Ethereum and provide experimental analysis.
Revised:  In this paper, we address various non-trivial issues that arise in implementing peer-consistency mechanisms in Ethereum and provide experimental analysis.
Edit intent: clarity
Original: The appropriate relay selection method can improve the performance of dense wireless networks  when the quality of connections between sources and their destinations is poor.
Revised: Machine-to-Machine (M2M) communications have been introduced to improve the communication capacity in dense wireless networks when the quality of connections between sources and their destinations is poor.
Edit intent: clarity
Original:  In addition, the simultaneous use of different radio frequency (RF) interfaces for transmitting data, which communication devices are equipped with them, can increase the capacity of data transmission over the network.
Revised:  In addition, the simultaneous use of different Radio Frequency (RF) interfaces for transmitting data, which communication devices are equipped with them, can increase the capacity of data transmission over the network.
Edit intent: fluency
Original:  This paperproposes two novel M2M relay selection algorithms namely Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA).
Revised:  In this paper, two novel M2M relay selection algorithms namely Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA).
Edit intent: clarity
Original:  This paperproposes two novel M2M relay selection algorithms namely Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA).
Revised:  This paperproposes two novel M2M relay selection algorithms are proposed, named as Optimal Relay Selection Algorithm (ORSA) and Matching based Relay Selection Algorithm (MRSA).
Edit intent: coherence
Original:  ORSA is a centralized algorithm for  optimal selection of relays by transforming the  problem to a k-cardinality assignment problem that can be solved using the Hungarian algorithm.
Revised:  ORSA is a centralized algorithm for the optimal selection of relays by transforming the problem to a k-cardinality assignment problem that can be solved using the Hungarian algorithm.
Edit intent: fluency
Original:  MRSA is a distributed algorithm that leverages concepts from Matching Theory to provide a stable solution for the relay selection problem.
Revised:  MRSA is a distributed algorithm that leverages concepts from matching theory to provide a stable solution for the relay selection problem.
Edit intent: fluency
Original:  In both proposed algorithms , in order to improve performance of the network, a static RF interface usage is applied to enable simultaneous use of different interfaces for data transmission  .
Revised:  In both proposed algorithms static RF interfaces usage is applied to enable simultaneous use of different interfaces for data transmission .
Edit intent: coherence
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation setup for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: clarity
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: coherence
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: fluency
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet token as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: clarity
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead of as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: fluency
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate thefacet support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Edit intent: fluency
Original:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences for each facet , and directly evaluate extractive methods by comparing the indices of extracted sentences with support sentences .
Revised:  In this paper, we present a facet-aware evaluation procedure for better assessment of the information coverage in extracted summaries while still supporting automatic evaluation once annotated . Specifically, we treat facet instead oftoken as the basic unit for evaluation, manually annotate the support sentences of the facet, and automatically evaluate extractive summarization methods by comparing the indices of extracted sentences with support sentences .
Edit intent: clarity
Original:  We demonstrate the benefits of the proposed setupby performing a thoroughquantitative investigation on the CNN/Daily Mail dataset , which in the meantime reveals useful insights of state-of-the-art summarization methods. %DIFDELCMD < \footnote{%%% Data can be found at URL
Revised:  We demonstrate the benefits of the quantitative investigation on the CNN/Daily Mail dataset , which in the meantime reveals useful insights of state-of-the-art summarization methods. %DIFDELCMD < \footnote{%%% Data can be found at URL
Edit intent: clarity