wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our method, which overcomes this difficulty, is to accurately compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition at the semi-infinite end ;
Revised:  Our method, which overcomes this difficulty, is to accurately compute the Green's function of the semi-infinite Hamiltonian by imposing an appropriate boundary condition in the bulk direction ;
Edit intent: clarity
Original:  We demonstrate our method's effectiveness by a study of edge states at a graphene zig-zag edge in the presence of defects , including atomic vacancies .
Revised:  We demonstrate our method's effectiveness by studies of edge states at a graphene zig-zag edge in the presence of defects , including atomic vacancies .
Edit intent: fluency
Original:  As a result, each substrate possesses a unique "quality" --- obtained through reconfiguration --- to realise different reservoirs for different tasks.
Revised:  As a result, each substrate possesses a unique `quality' -- obtained through reconfiguration --- to realise different reservoirs for different tasks.
Edit intent: fluency
Original:  As a result, each substrate possesses a unique "quality" --- obtained through reconfiguration --- to realise different reservoirs for different tasks.
Revised:  As a result, each substrate possesses a unique "quality" --- obtained through reconfiguration -- to realise different reservoirs for different tasks.
Edit intent: fluency
Original:  Here we describe an experimental framework that can be used to characterise the quality of  any substrate for RC.
Revised:  Here we describe an experimental framework to characterise the quality of any substrate for RC.
Edit intent: clarity
Original:  Here we describe an experimental framework that can be used to characterise the quality of  any substrate for RC.
Revised:  Here we describe an experimental framework that can be used to characterise the quality of potentially any substrate for RC.
Edit intent: clarity
Original:  Our framework reveals that a definition of quality is not only useful to compare substrates, but can also help map the non-trivial relationship between properties and task performance.
Revised:  Our framework reveals that a definition of quality is not only useful to compare substrates, but can help map the non-trivial relationship between properties and task performance.
Edit intent: coherence
Original:  In the wider context, the framework offers a greater understanding  to what makes a dynamical system compute, helping improve the design of future substrates for RC.
Revised:  In the wider context, the framework offers a greater understanding as to what makes a dynamical system compute, helping improve the design of future substrates for RC.
Edit intent: clarity
Original:  Pettie and Wellman (2018)asked whether there exist r-sparse DS(n, s) -sequences of length \Omega (s n^{ 2 }) for  s \geq n and r > 2, which would generalize a ]  result of Roselle and Stanton (1971) for the case r = 2.
Revised:  Pettie and Wellman (2018)asked whether there exist r-sparse DS(n, s) -sequences of length \Omega (s n^{ r }) for s \geq n and r > 2, which would generalize a ] result of Roselle and Stanton (1971) for the case r = 2.
Edit intent: fluency
Original:  We construct r-sparse DS(n, s )-sequences of length \Omega(s n ^{2) for s \geq n and r > 2. Our construction uses linear hypergraph edge-coloring bounds.
Revised:  We construct r-sparse DS(n, s )-sequences of length \Omega(s n ) for s \geq n and r > 2. Our construction uses linear hypergraph edge-coloring bounds.
Edit intent: clarity
Original:  We prove that if u is an (r, s)-formation\dots  , then Ex(u, j, n) = \Theta(s n^{ r }) for all j \geq r and s \geq n ^{r-1 Wellman and Pettie [Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices, Disc.
Revised:  We prove that if u is an (r, s)-formation\dots , then Ex(u, j, n) = \Theta(s n^{ r }) for all j \geq r and s \geq n , answering a question of Wellman and Pettie [Lower Bounds on Davenport-Schinzel Sequences via Rectangular Zarankiewicz Matrices, Disc.
Edit intent: clarity
Original:  Math. 341 (2018), 1987--1993] and extend the result of Roselle and Stanton that Ex(u, 2, n) = \Theta(s n^2) for any alternation u of length s \geq n [Some properties of Davenport-Schinzel sequences, Acta Arithmetica 17 (1971), 355--362].
Revised:  Math. 341 (2018), 1987--1993] and extending the result of Roselle and Stanton that Ex(u, 2, n) = \Theta(s n^2) for any alternation u of length s \geq n [Some properties of Davenport-Schinzel sequences, Acta Arithmetica 17 (1971), 355--362].
Edit intent: fluency
Original: The question of what animals understand about their social worlds is fundamental to studies of the evolution of sociality, cognition, and animal culture.
Revised: The information contained in social systems, and the part of it that animals actually possess, is a driver of the evolution of sociality, cognition, and animal culture.
Edit intent: clarity
Original:  However, the presence and extent of social knowledge in individuals is difficult to detect , and when detections have been made , differences in methodology make cross-species comparisons difficult.
Revised:  However, it is difficult to detect , and when detections have been made , differences in methodology make cross-species comparisons difficult.
Edit intent: clarity
Original:  This method infers individual-level strategic rules for aggression in dominance hierarchies where rankdifferences between individuals may structure decision-making .
Revised:  This method infers individual-level rules for aggression in dominance hierarchies where rankdifferences between individuals may structure decision-making .
Edit intent: clarity
Original:  This method infers individual-level strategic rules for aggression in dominance hierarchies where rankdifferences between individuals may structure decision-making .
Revised:  This method infers individual-level strategic rules for aggression based on how aggression decisions are influenced by differences in social rank .
Edit intent: clarity
Original:  We apply this method to a data from 172 social groups across 85 species in 22 orders.
Revised:  We apply this method to 172 social groups across 85 species in 22 orders.
Edit intent: clarity
Original:  The majority of animal groups in our dataset (112 groups, 65\%) follow a downward heuristic  , spreading aggression relatively equally across lower-ranked opponents .
Revised:  The majority of animal groups in our dataset (112 groups, 65\%) follow a downward heuristic to structure their fights , spreading aggression relatively equally across lower-ranked opponents .
Edit intent: clarity
Original:  Different groups within the same species can use different strategies, indicating that the choice of heuristics may be contextual and that the structuring of aggression  should not be considered a fixed characteristic of a species .
Revised:  Different groups within the same species can use different strategies, indicating that the choice of heuristics may be contextual and that the structuring of aggression should not be considered a fixed characteristic .
Edit intent: clarity
Original:  Our approach to studying animal conflict provides new opportunities to investigate the extent of rank knowledge across species , compare the evolution of social knowledge, and better understand the effect of social knowledge on individual behaviour in within-group conflict .
Revised:  Our approach provides new opportunities to investigate the extent of rank knowledge across species , compare the evolution of social knowledge, and better understand the effect of social knowledge on individual behaviour in within-group conflict .
Edit intent: clarity
Original:  Our approach to studying animal conflict provides new opportunities to investigate the extent of rank knowledge across species , compare the evolution of social knowledge, and better understand the effect of social knowledge on individual behaviour in within-group conflict .
Revised:  Our approach to studying animal conflict provides new opportunities to study the use of social information across species and the evolution of social knowledge, and better understand the effect of social knowledge on individual behaviour in within-group conflict .
Edit intent: clarity
Original: The information contained in social systems, and the part of it that animals actually possess, is a driver of the evolution of sociality, cognition, and animal culture .
Revised: Members of a social species need to make appropriate decisions about who, how, and when to interact with others in their group .
Edit intent: clarity
Original:  However, it is difficult to detect how much information individuals actually have about their social worlds.
Revised:  However, it has been difficult for researchers to detect the inputs to these decisions and, in particular, how much information individuals actually have about their social worlds.
Edit intent: clarity
Original:  The majority of animal groups in our dataset (112 groups, 65 \%)
Revised:  The majority of the groups (133 groups, 77 \%)
Edit intent: clarity
Original:   The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Revised:  The {\it Triangle Algorithm} (TA) %DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Edit intent: clarity
Original:   The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Revised:  The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% %DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Edit intent: coherence
Original:   The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Revised:  The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% %DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Edit intent: coherence
Original:   The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it witness , i. e. the orthogonal bisector of pp' separates p from conv(S).
Revised:  The {\it Triangle Algorithm} (TA) computes p' \in conv(S) so that, either%DIFDELCMD < \Vert %DIFDELCMD < %%% p'- p%DIFDELCMD < \Vert %%% \leq \varepsilon R, R= \max \{%DIFDELCMD < \Vert %%% p -v%DIFDELCMD < \Vert%%% : v\in S\ {\it , i. e. the orthogonal bisector of pp' separates p from conv(S).
Edit intent: fluency
Original:  This matches complexity of Nesterov's fast-gradient method.
Edit intent: coherence
Original: Load balancing between adjacent base stations ( BS ) is important for homogenizing traffic load distributions and improving service provisioning.
Revised: Load balancing between adjacent base stations ( BSs ) is important for homogenizing traffic load distributions and improving service provisioning.
Edit intent: clarity
Original: Load balancing between adjacent base stations ( BS ) is important for homogenizing traffic load distributions and improving service provisioning.
Revised: Load balancing between adjacent base stations ( BS ) is important for balancing load distributions and improving service provisioning.
Edit intent: clarity
Original:  An unexplored area of research is the relationship between the local load balancing dynamics and the overall network topology .
Revised:  The relationship between each BS's load balancing dynamics and the overall network topology .
Edit intent: clarity
Original: Twitter accounts have already been used in many scientometrics studies, but the meaningfulness of the data for societal impact measurements in research evaluation has been questioned.
Revised: Twitter accounts have already been used in many scientometric studies, but the meaningfulness of the data for societal impact measurements in research evaluation has been questioned.
Edit intent: fluency
Original:  Earlier research has compared social media counts with citations .
Revised:  Earlier research focused on social media counts with citations .
Edit intent: clarity
Original:  Earlier research has compared social media counts with citations .
Revised:  Earlier research has compared social media counts and neglected the interactive nature of the data .
Edit intent: clarity
Original:  We explore a novel network approach in which we compare author keywords to Twitter hashtags as indicators of topics.
Revised:  We explore a novel network approach in which we compare author keywords to hashtags as indicators of topics.
Edit intent: clarity
Original:  We find that the most tweeted topics regarding climate change research focus on consequences for humans due to climate change .
Revised:  We find that the most tweeted topics regarding climate change research focus on the consequences of climate change for humans .
Edit intent: clarity
Original: Vanna-volga is a popular method for  interpolation/extrapolation of volatility smiles.
Revised: Vanna-Volga is a popular method for interpolation/extrapolation of volatility smiles.
Edit intent: fluency
Original: Vanna-volga is a popular method for  interpolation/extrapolation of volatility smiles.
Revised: Vanna-volga is a popular method for the interpolation/extrapolation of volatility smiles.
Edit intent: fluency
Original:  The technique is widely used in the FX markets context, due to its ability to consistently construct the entire lognormal smile using only three lognormal market quotes.
Revised:  The technique is widely used in the FX markets context, due to its ability to consistently construct the entire Lognormal smile using only three lognormal market quotes.
Edit intent: fluency
Original:  The technique is widely used in the FX markets context, due to its ability to consistently construct the entire lognormal smile using only three lognormal market quotes.
Revised:  The technique is widely used in the FX markets context, due to its ability to consistently construct the entire lognormal smile using only three Lognormal market quotes.
Edit intent: fluency
Original:  However, the derivation of vanna-volga method itself is free of distributional assumptions.
Revised:  However, the derivation of the Vanna-Volga method itself is free of distributional assumptions.
Edit intent: fluency
Original:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets  .
Revised:  With this is mind , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets .
Edit intent: clarity
Original:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets  .
Revised:  To this end , it is surprising there have been no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets .
Edit intent: clarity
Original:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets  .
Revised:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities ( the current standard for interest rate markets .
Edit intent: clarity
Original:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets  .
Revised:  To this end , it is surprising there have been actually no attempts to apply the method to Normal volatilities which are the current standard for interest rate markets ) .
Edit intent: fluency
Original:  As it turns out, that requires only minor modifications  compared to the lognormal case.
Revised:  As it turns out, only minor modifications compared to the lognormal case.
Edit intent: coherence
Original:  As it turns out, that requires only minor modifications  compared to the lognormal case.
Revised:  As it turns out, that requires only minor modifications are required compared to the lognormal case.
Edit intent: clarity
Original:  As it turns out, that requires only minor modifications  compared to the lognormal case.
Revised:  As it turns out, that requires only minor modifications compared to the Lognormal case.
Edit intent: fluency
Original:  Apart from being based on practical and intuitive hedging arguments, the vanna-volga has further important advantages.
Revised:  Apart from being based on practical and intuitive hedging arguments, the Vanna-Volga has further important advantages.
Edit intent: fluency
Original:  In comparison to the Normal SABR model, the vanna-volga can easily fit both classical convex and atypical concave smiles ( "frowns" ).
Revised:  In comparison to the Normal SABR model, the Vanna-Volga can easily fit both classical convex and atypical concave smiles ( "frowns" ).
Edit intent: fluency
Original:  In comparison to the Normal SABR model, the vanna-volga can easily fit both classical convex and atypical concave smiles ( "frowns" ).
Revised:  In comparison to the Normal SABR model, the vanna-volga can easily fit both classical convex and atypical concave smiles ( frowns ).
Edit intent: fluency
Original:  Concave smile patters are sometimes observed around ATM strikes in the interest rate markets, in particular in the situations of anticipated jumps (with  unclear outcome) in interest rates.
Revised:  Concave smile patterns are sometimes observed around ATM strikes in the interest rate markets, in particular in the situations of anticipated jumps (with unclear outcome) in interest rates.
Edit intent: clarity
Original:  Concave smile patters are sometimes observed around ATM strikes in the interest rate markets, in particular in the situations of anticipated jumps (with  unclear outcome) in interest rates.
Revised:  Concave smile patters are sometimes observed around ATM strikes in the interest rate markets, particularly in the situations of anticipated jumps (with unclear outcome) in interest rates.
Edit intent: fluency
Original:  Concave smile patters are sometimes observed around ATM strikes in the interest rate markets, in particular in the situations of anticipated jumps (with  unclear outcome) in interest rates.
Revised:  Concave smile patters are sometimes observed around ATM strikes in the interest rate markets, in particular in the situations of anticipated jumps (with an unclear outcome) in interest rates.
Edit intent: fluency
Original:  At least in these situations, the vanna-volga can be expected to interpolate/extrapolate better than SABR.
Revised:  At least in these situations, the Vanna-Volga can be expected to interpolate/extrapolate better than SABR.
Edit intent: fluency
Original:  We give an algorithms based on \%the convex-programming primitive of Bregman projections.
Revised:  We give an algorithms based on Bregman projections.
Edit intent: clarity
Original:  We give an algorithms based on Bregman projections.
Revised:  We give an algorithm based on Bregman projections.
Edit intent: fluency
Original:  This was recently shown to be a computationally intractable ( NP-Hard ) problem.
Revised:  This was recently shown to be a computationally intractable ( NP-hard ) problem.
Edit intent: fluency
Original:  Our procedure can be implemented on near-term quantum processors,  providing a potentially more efficient way to  predict financial crashes.
Revised:  Our procedure could be implemented on near-term quantum processors, providing a potentially more efficient way to predict financial crashes.
Edit intent: fluency
Original:  Our procedure can be implemented on near-term quantum processors,  providing a potentially more efficient way to  predict financial crashes.
Revised:  Our procedure can be implemented on near-term quantum processors, thus providing a potentially more efficient way to predict financial crashes.
Edit intent: coherence
Original: Transport and secure layer protocols are essential to ensure reliable and secure communication between two parties.
Revised: Transport and security protocols are essential to ensure reliable and secure communication between two parties.
Edit intent: clarity
Original:  These protocols must be lightweight, since IoT devices are usually resource constrained.
Revised:  For IoT applications, these protocols must be lightweight, since IoT devices are usually resource constrained.
Edit intent: clarity
Original:  Unfortunately, the existing transport and secure layer protocols -- namely TCP/TLS and UDP/DTLS -- fall short in terms of connection overhead, latency, and connection migration when used in IoT applications.
Revised:  Unfortunately, the existing transport and security protocols -- namely TCP/TLS and UDP/DTLS -- fall short in terms of connection overhead, latency, and connection migration when used in IoT applications.
Edit intent: clarity
Original:  The disentangled rep- resentation allows for controllable generation of AMPs.
Revised:  The disentangled representation allows for controllable generation of AMPs.
Edit intent: fluency
Original:  These features are highly desired in next-generation antimicrio- bial design.
Revised:  These features are highly desired in next-generation antimicrobial design.
Edit intent: fluency
Original:  But an economy can also be viewed as a network, in which producers purchase goods , convert them to new goods, and sell them to households or other producers.
Revised:  But an economy can also be viewed as a network, in which each producer buys input goods and converts them to other goods, selling the product to households or other producers.
Edit intent: clarity
Original:  Here we develop a simple theory that shows how the network properties of an economy can amplify the effects of technological improvements as they propagate along chains of production.
Revised:  We show how this network amplifies the effects of technological improvements as they propagate along chains of production.
Edit intent: clarity
Original:  Second, we show "schema simplification" theorems describing when and how result bounded services can be used.
Revised:  Second, we show "schema simplification" theorems describing when and how result-bounded services can be used.
Edit intent: fluency
Original: We prove limit theorems for the super-replication cost of European options in a Binomial model with transient price impact.
Revised: We prove limit theorems for the super-replication cost of options in a Binomial model with transient price impact.
Edit intent: clarity
Original:  In this article, we present a general framework for deep-learning-based traffic classification.
Revised:  In this article, we introduce a general framework for deep-learning-based traffic classification.
Edit intent: fluency
Original:  We discuss commonly used deep learning methods and their application in traffic classification tasks.
Revised:  We present commonly used deep learning methods and their application in traffic classification tasks.
Edit intent: clarity