wanyu/IteraTeR_v2 huggingface dataset:
Original:  The dynamics of the terror hubs and the vulnerable motifs that we discover in the network backbone can provide deep insight on their formations and spreading, and thereby help in contending terrorism or making public policies that can check their spread.
Revised:  The dynamics of the terror hubs and the vulnerable motifs that we discover in the network backbone turn out to be very significant, and may provide deep insight on their formations and spreading, and thereby help in contending terrorism or making public policies that can check their spread.
Edit intent: coherence
Original:  The dynamics of the terror hubs and the vulnerable motifs that we discover in the network backbone can provide deep insight on their formations and spreading, and thereby help in contending terrorism or making public policies that can check their spread.
Revised:  The dynamics of the terror hubs and the vulnerable motifs that we discover in the network backbone can provide deep insight on their formations and spreading, and thereby help in contending terrorism or framing public policies that can check their spread.
Edit intent: clarity
Original:  The tools are Anystyle-Parser, Biblio, CERMINE, Citation, Citation-Parser, GROBID, ParsCit, PDFSSA4MET, Reference Tagger and Science Parse, and we compare them in both their out-of-the-box versions and  tuned to the project-specific data.
Revised:  The tools are Anystyle-Parser, Biblio, CERMINE, Citation, Citation-Parser, GROBID, ParsCit, PDFSSA4MET, Reference Tagger and Science Parse, and we compare them in both their out-of-the-box versions and versions tuned to the project-specific data.
Edit intent: fluency
Original:  We also found that even though machine learning-based tools and tools based on rules or regular expressions achieve on average similar precision (0.77 for ML-based tools vs. 0.76 for non-ML-based tools), applying machine learning-based tools results in the recall three times higher than in the case of non-ML-based tools (0.66 vs. 0.22).
Revised:  We also found that even though machine learning-based tools and tools based on rules or regular expressions achieve on average similar precision (0.77 for ML-based tools vs. 0.76 for non-ML-based tools), applying machine learning-based tools results in a recall three times higher than in the case of non-ML-based tools (0.66 vs. 0.22).
Edit intent: fluency
Original: Understanding the mechanics behind the coordinated movement of mobile animal groups  provides key insights into their biology and ecology  while also yielding algorithms for bio-inspired technologies and autonomous systems.
Revised: Understanding the mechanics behind the coordinated movement of mobile animal groups provides key insights into their biology and ecology , while also yielding algorithms for bio-inspired technologies and autonomous systems.
Edit intent: fluency
Original:  It is becoming increasingly clear that many mobile animal groups are composed of heterogeneous individuals with differential levels and types of influence over group behaviors--often considered as "leaders" .
Revised:  It is becoming increasingly clear that many mobile animal groups are composed of heterogeneous individuals with differential levels and types of influence over group behaviors .
Edit intent: clarity
Original:  We argue that instead of asserting a single definition or notion of leadership, the complex interaction rules and dynamics typical of a group implies that leadership itself is not merely a scalar quantity , but rather, a complex combination of many different components.
Revised:  We argue that instead of asserting a single definition or notion of leadership, the complex interaction rules and dynamics typical of a group implies that leadership itself is not merely a binary classification (leader or follower) , but rather, a complex combination of many different components.
Edit intent: clarity
Original:  In this manuscript we develop an anatomy of leadership, identify several principle components and provide a general mathematical framework for discussing leadership.
Revised:  In this paper we develop an anatomy of leadership, identify several principle components and provide a general mathematical framework for discussing leadership.
Edit intent: clarity
Original:  With real and synthetic examples we then illustrate how to use this framework .
Revised:  With the intricacies of this taxonomy in mind we present a set of leadership-oriented toy models that should be used as a proving ground for leadership inference methods going forward .
Edit intent: clarity
Original:  We believe this multifaceted approach to leadership definition will allow for a broader understanding the role of leadership and its inference from data in mobile animal groups and beyond.
Revised:  We believe this multifaceted approach to leadership will enable a broader understanding the role of leadership and its inference from data in mobile animal groups and beyond.
Edit intent: clarity
Original:  We believe this multifaceted approach to leadership definition will allow for a broader understanding the role of leadership and its inference from data in mobile animal groups and beyond.
Revised:  We believe this multifaceted approach to leadership definition will allow for a broader understanding of leadership and its inference from data in mobile animal groups and beyond.
Edit intent: clarity
Original: {\em   We derive an (essentially) optimal bound of O(1 /\rho s)^{n-1} on the s-energy of an n-agent  averaging system, where \rho is a lower bound on the nonzero weights.
Revised: The{\em We derive an (essentially) optimal bound of O(1 /\rho s)^{n-1} on the s-energy of an n-agent averaging system, where \rho is a lower bound on the nonzero weights.
Edit intent: fluency
Original: {\em   We derive an (essentially) optimal bound of O(1 /\rho s)^{n-1} on the s-energy of an n-agent  averaging system, where \rho is a lower bound on the nonzero weights.
Revised: {\em s-energy We derive an (essentially) optimal bound of O(1 /\rho s)^{n-1} on the s-energy of an n-agent averaging system, where \rho is a lower bound on the nonzero weights.
Edit intent: clarity
Original:  In "Markov influence systems" (MIS) , the transition probabilities of the chains change as a function of the current state distribution.
Revised:  In "Markov influence systems" (MIS) , the transition probabilities of the chains change as a function of the current distribution.
Edit intent: clarity
Original:  It comes in two independent parts: first , we generalize the standard classification of Markov chain states to the dynamic case by showing how to parse graph sequences.
Revised:  It comes in two independent parts: in the first one , we generalize the standard classification of Markov chain states to the dynamic case by showing how to parse graph sequences.
Edit intent: clarity
Original:  We also give an example of "hyper-torpid" mixing, where a stationary distribution is reached in super-exponential time, a timescale that cannot be achieved by any Markov chain.
Revised:  We give an example of "hyper-torpid" mixing, where a stationary distribution is reached in super-exponential time, a timescale that cannot be achieved by any Markov chain.
Edit intent: clarity
Original:  We also give an example of "hyper-torpid" mixing, where a stationary distribution is reached in super-exponential time, a timescale that cannot be achieved by any Markov chain.
Revised:  We also give an example of "hyper-torpid" mixing, where a stationary distribution is reached in super-exponential time, a timescale beyond the reach of any Markov chain.
Edit intent: clarity
Original: We study an optimal control problem for a multi-agent system modeled by an undirected formation graph with nodes describing the kinematics of each agent, given by a left invariant control system on a Lie group.
Revised: In this work, we study an optimal control problem for a multi-agent system modeled by an undirected formation graph with nodes describing the kinematics of each agent, given by a left invariant control system on a Lie group.
Edit intent: clarity
Original: We study an optimal control problem for a multi-agent system modeled by an undirected formation graph with nodes describing the kinematics of each agent, given by a left invariant control system on a Lie group.
Revised: We study an optimal control problem for a multi-agent system modeled by an undirected formation graph with nodes describing the kinematics of each agent, given by a left-invariant control system on a Lie group.
Edit intent: fluency
Original:  This is accomplished by introducing appropriate potential functions into the cost functional for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and render the optimal control problem partially invariant by a Lie group of symmetries.
Revised:  Such a task is done by introducing some potential functions into the cost functional for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and render the optimal control problem partially invariant by a Lie group of symmetries.
Edit intent: clarity
Original:  This is accomplished by introducing appropriate potential functions into the cost functional for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and render the optimal control problem partially invariant by a Lie group of symmetries.
Revised:  This is accomplished by introducing appropriate potential functions into the cost function for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and render the optimal control problem partially invariant by a Lie group of symmetries.
Edit intent: fluency
Original:  This is accomplished by introducing appropriate potential functions into the cost functional for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and render the optimal control problem partially invariant by a Lie group of symmetries.
Revised:  This is accomplished by introducing appropriate potential functions into the cost functional for the optimal control problem, corresponding to fictitious forces, induced by the formation constraint among agents, that break the symmetry of the individual agents and the cost functions, and rendering the optimal control problem partially invariant by a Lie group of symmetries.
Edit intent: fluency
Original:  Reduced necessary conditions for the existence of normal extrema are obtained using techniques from variational calculus on manifolds.
Revised:  Reduced necessary conditions for the existence of normal extrema are obtained using techniques of variational calculus on manifolds.
Edit intent: clarity
Original:  As an application  we study an optimal control problem for multiple unicycles.
Revised:  As an application , we study an optimal control problem for multiple unicycles.
Edit intent: fluency
Original:  The reflection of these new invariants in the original system  enables its analysis.
Revised:  The reflection of these new invariants in the original system then enables its analysis.
Edit intent: coherence
Original:  Moreover, our approach is purely axiomatic, and so the axiomatization is suitable for sound implementation in foundational theorem provers.
Revised:  Moreover, our results are purely axiomatic, and so the axiomatization is suitable for sound implementation in foundational theorem provers.
Edit intent: clarity
Original:  We address the moment indeterminacy of the log-normal distribution and numerically investigate its impact on the asymptotic behavior of the series .
Revised:  The moment indeterminacy of the log-normal distribution and numerically investigate its impact on the asymptotic behavior of the series .
Edit intent: clarity
Original:  The matrix form of Lie transform is an approximation of general solution for the nonlinear system of ordinary differential equations.
Revised:  The matrix form of Lie transform is an approximation of the general solution of the nonlinear system of ordinary differential equations.
Edit intent: fluency
Original:  We provide a theoretical explanation of learning dynamical systems from time series for the proposed method , as well as demonstrate it in several applications.
Revised:  We provide a theoretical explanation of the proposed architecture , as well as demonstrate it in several applications.
Edit intent: clarity
Original:  Namely, we show results of modeling and identification for both  well-known systems like Lotka-Volterra equation and more complicated examples from retail, biochemistry , and accelerator physics  .
Revised:  We present the results of modeling and identification for both well-known systems like Lotka-Volterra equation and more complicated examples from retail, biochemistry , and accelerator physics .
Edit intent: coherence
Original:  Namely, we show results of modeling and identification for both  well-known systems like Lotka-Volterra equation and more complicated examples from retail, biochemistry , and accelerator physics  .
Revised:  Namely, we show results of modeling and identification for both well-known dynamical systems, and more complicated examples from retail, biochemistry , and accelerator physics .
Edit intent: clarity
Original:  A toy implementation in Magma confirms that the signature-based algorithm is more efficient in terms of the number of S-polynomials computed . Early experimental results suggest that the algorithm might even work for polynomials over more general rings, such as unique factorization domains (e.g. the ring of multivariate polynomials over a field or a PID).
Revised:  A toy implementation in Magma confirms that the signature-based algorithm is more efficient in terms of the number of S-polynomials computed . Early experimental results suggest that the algorithm might even be correct and terminate in a more general setting, for polynomials over a unique factorization domain (e.g. the ring of multivariate polynomials over a field or a PID).
Edit intent: clarity
Original:  We calculate the joint characteristic function of two futures prices for different maturities in the risk-neutral measure , and explain how European options on futures and calendar spread options can be priced .
Revised:  We calculate the joint characteristic function of two futures prices for different maturities in the risk-neutral measure .
Edit intent: coherence
Original:  We also see that the seasonal model significantly outperforms the nested non-seasonal model in all five markets, and  show which seasonality patterns are particularly well-suited for each market .
Revised:  We also see that the seasonal model significantly outperforms the nested non-seasonal model in all five markets, and we show which seasonality patterns are particularly well-suited for each market .
Edit intent: fluency
Original: This work is an exploratory study of how we could progress a step towards an AI assisted peer- review system .
Revised: This work is a preliminary exploratory study of how we could progress a step towards an AI assisted peer- review system .
Edit intent: clarity
Original: This work is an exploratory study of how we could progress a step towards an AI assisted peer- review system .
Revised: This work is an exploratory study of how we could progress a step towards an AI assisted article classification sys- tem in academia .
Edit intent: clarity
Original:  We extract several features to quantify the quality of a paper and the degree of in-scope exploring keyword search, citation analysis, reputations of authors and affiliations, similarity with respect to accepted papers.
Revised:  We extract several features to quantify the quality of a paper and the degree of in-scope explor- ing keyword search, citation analysis, reputations of authors and affiliations, similarity with respect to accepted papers.
Edit intent: fluency
Original:  The features are then fed to standard machine learning based classifiers to develop an automated system.
Revised:  With these features we train standard machine learning based classifiers to develop an automated system.
Edit intent: clarity
Original:  The features are then fed to standard machine learning based classifiers to develop an automated system.
Revised:  The features are then fed to standard machine learning classifiers to develop an automated system.
Edit intent: clarity
Original:  The features are then fed to standard machine learning based classifiers to develop an automated system.
Revised:  The features are then fed to standard machine learning based classifiers to develop a classification system.
Edit intent: clarity
Original:  On a decent set of test data our generic approach yields promising results across 3 different journals.
Revised:  On a decent set of test data our approach yields promising results across 3 different journals.
Edit intent: clarity
Original:  The study inherently exhibits the possibility of a redefined interest of the research community on the study of rejected papers and inculcates a drive towards an automated peer review system .
Revised:  We believe that our approach is generic and could be adapted to other journals with appropriate adjustments .
Edit intent: coherence
Original:  Since the user threshold is unknown in practice, we proceed to propose an \epsilon -greedy algorithm to learn the threshold via interactions with users.
Revised:  Since the user threshold is unknown in practice, we proceed to propose an \epsilon -greedy algorithm to find the solution by learning the threshold via interactions with users.
Edit intent: clarity
Original:  Simulation results show that the greedy algorithm achieves near-optimal performance and improves the cache-hit ratio significantly compared with priori works with/without recommendation.
Revised:  Simulation results show that the proposed algorithms improve the successful offloading probability compared with prior works with/without recommendation.
Edit intent: clarity
Original:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \epsilon of the cache-hit ratio obtained by the greedy algorithm with known user threshold.
Revised:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \varepsilon of the performance obtained by the greedy algorithm with known user threshold.
Edit intent: clarity
Original:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \epsilon of the cache-hit ratio obtained by the greedy algorithm with known user threshold.
Revised:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \epsilon of the cache-hit ratio obtained by the algorithm with known user threshold.
Edit intent: fluency
Original:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \epsilon of the cache-hit ratio obtained by the greedy algorithm with known user threshold.
Revised:  The \epsilon -greedy algorithm learns the user threshold quickly, and achieves more than 1- \epsilon of the cache-hit ratio obtained by the greedy algorithm with known threshold.
Edit intent: fluency
Original: We study multidimensional minima and quasiperiodic shifts of finite type.
Revised: We study multidimensional minimal and quasiperiodic shifts of finite type.
Edit intent: fluency
Original:  The results of the simulation demonstrate that the proposed algorithm reduces computational time by approximately 17,400\% over the na \"i%DIFDELCMD < }%%% ve approach.
Revised:  The results of the simulation demonstrate that the proposed algorithm reduces computational time \"i%DIFDELCMD < }%%% ve approach.
Edit intent: clarity
Original:  The results of the simulation demonstrate that the proposed algorithm reduces computational time by approximately 17,400\% over the na \"i%DIFDELCMD < }%%% ve approach.
Revised:  The results of the simulation demonstrate that the proposed algorithm reduces computational time by approximately 17,400\% over the na %DIFDELCMD < }%%% ve approach.
Edit intent: fluency
Original: Many studies have shown that cells use temporal dynamics of signaling molecules to encode information.
Revised: Many studies have shown that cells use temporal dynamics of signalling molecules to encode information.
Edit intent: fluency
Original:  One particular class of temporal dynamics is sustained and transient signals, i.e. signals of long and short durations respectively.
Revised:  One particular class of temporal dynamics is persistent and transient signals, i.e. signals of long and short durations respectively.
Edit intent: clarity
Original:  The solution of the detection problem is to compute the likelihood ratio of observing a sustained signal to a transient signal.
Revised:  The solution of the detection problem is to compute the log-likelihood ratio of observing a sustained signal to a transient signal.
Edit intent: clarity
Original:  The solution of the detection problem is to compute the likelihood ratio of observing a sustained signal to a transient signal.
Revised:  The solution of the detection problem is to compute the likelihood ratio of observing a persistent signal to a transient signal.
Edit intent: clarity
Original:  Although the capability of coherent feedforward loops to discriminate sustained signals is known, its statistical information processing interpretation has not been pointed out before .
Revised:  Although the capability of coherent feedforward loops to discriminate sustained signals is known, this paper adds an information processing interpretation has not been pointed out before .
Edit intent: clarity
Original: Considering a given computational problem, a certificate is a piece of additional data that one  attaches to the output in order to help verifying that this output is correct.
Revised: For a given computational problem, a certificate is a piece of additional data that one attaches to the output in order to help verifying that this output is correct.
Edit intent: clarity
Original: Considering a given computational problem, a certificate is a piece of additional data that one  attaches to the output in order to help verifying that this output is correct.
Revised: Considering a given computational problem, a certificate is a piece of data that one attaches to the output in order to help verifying that this output is correct.
Edit intent: clarity
Original: Considering a given computational problem, a certificate is a piece of additional data that one  attaches to the output in order to help verifying that this output is correct.
Revised: Considering a given computational problem, a certificate is a piece of additional data that one attaches to the output with the aim of allowing efficient verification (by the verifier) that this output is correct.
Edit intent: clarity
Original:  Certificates are often used to make the verification phase significantly more efficient than the whole (re-)computation of the output.
Edit intent: coherence
Original:  Here, we consider the minimal approximant basis problem, for which the fastest known algorithms compute a polynomial matrix of dimensions m \times m and average degree D/m using O~(m^\omega D{m}) field operations.
Revised:  Here, we consider the minimal approximant basis problem, for which the fastest known algorithms output a polynomial matrix of dimensions m \times m and average degree D/m using O~(m^\omega D{m}) field operations.
Edit intent: clarity