wanyu/IteraTeR_v2 huggingface dataset:
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  ), where In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: coherence
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  v In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: fluency
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  0 In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: coherence
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  A In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: fluency
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  and In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: fluency
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  B In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: fluency
Original:       In 1 we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Revised:  In we used a cycle basis of the cycle space to represent a simple connected graph G. If G is Hamiltonian, then there exists a set of cycles to be a solution of Grinberg's Equation.
Edit intent: coherence
Original:  In this paper, we reexamine the cycle combinations of Equality (3.3) in 1%DIFDELCMD < ] %%% and find a distinctive cycle set underlying the non-Hamiltonian combinations satisfying Grinberg's Equation.
Revised:  In this paper, we 1%DIFDELCMD < ] %%% and find a distinctive cycle set underlying the non-Hamiltonian combinations satisfying Grinberg's Equation.
Edit intent: clarity
Original:  In this paper, we reexamine the cycle combinations of Equality (3.3) in 1%DIFDELCMD < ] %%% and find a distinctive cycle set underlying the non-Hamiltonian combinations satisfying Grinberg's Equation.
Revised:  In this paper, we reexamine the cycle combinations of Equality (3.3) in %DIFDELCMD < ] %%% and find a distinctive cycle set underlying the non-Hamiltonian combinations satisfying Grinberg's Equation.
Edit intent: clarity
Original:  We detail the characteristics of this cycle set and the existing condition\textit{ \textit{  .
Revised:  We detail the characteristics of this cycle set and the existing condition\textit{ ,\textit{ .
Edit intent: fluency
Original: In this paper , we address the independent set enumeration problem.
Revised: In this study , we address the independent set enumeration problem.
Edit intent: clarity
Original:  Although many efficient enumeration algorithms  for maximal independent sets have been proposed , no fine-grained analysis  for the non-maximal variant has not been given.
Revised:  Although several efficient enumeration algorithms for maximal independent sets have been proposed , no fine-grained analysis for the non-maximal variant has not been given.
Edit intent: clarity
Original:  Although many efficient enumeration algorithms  for maximal independent sets have been proposed , no fine-grained analysis  for the non-maximal variant has not been given.
Revised:  Although many efficient enumeration algorithms for maximal independent sets , no fine-grained analysis for the non-maximal variant has not been given.
Edit intent: clarity
Original:  Although many efficient enumeration algorithms  for maximal independent sets have been proposed , no fine-grained analysis  for the non-maximal variant has not been given.
Revised:  Although many efficient enumeration algorithms for maximal independent sets have been proposed , no fine-grained analysis has been given for the non-maximal variant has not been given.
Edit intent: fluency
Original:  As the main result, we propose an algorithm EIS for the non-maximal variant that runs in amortized O(q) time and liner space, where q is the maximum integer such that there is no clique with q vertices in the given graph.
Revised:  As the main result, we propose an algorithm EIS for the non-maximal variant that runs in O(q) time and liner space, where q is the maximum integer such that there is no clique with q vertices in the given graph.
Edit intent: clarity
Original:  As the main result, we propose an algorithm EIS for the non-maximal variant that runs in amortized O(q) time and liner space, where q is the maximum integer such that there is no clique with q vertices in the given graph.
Revised:  As the main result, we propose an algorithm EIS for the non-maximal variant that runs in amortized O(q) time and liner space, where q is the clique number, i.e., the maximum size of a clique in an input graph.
Edit intent: clarity
Original:  Note that EIS correctly works even if we do not know the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique  , e.g., triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Revised:  Note that EIS works correctly even if the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique , e.g., triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Edit intent: clarity
Original:  Note that EIS correctly works even if we do not know the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique  , e.g., triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Revised:  Note that EIS correctly works even if we do not know the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique , triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Edit intent: coherence
Original:  Note that EIS correctly works even if we do not know the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique  , e.g., triangle-free graphs, planer graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Revised:  Note that EIS correctly works even if we do not know the exact value of q . In addition, it is known that several sparse graph class have constant clique number which is defined by the size of a maximum clique , e.g., triangle-free graphs, planar graphs, bounded degenerate graphs, locally bounded expansion graphs, and so on.
Edit intent: fluency
Original:   We further find that  " Luckiest draw" recipients , or those who obtain the largest shares of their corresponding red packets, are 1.5 times more likely to pay it forward than other recipients .
Revised:  We further find that " luckiest draw" recipients , or those who obtain the largest shares of their corresponding red packets, are 1.5 times more likely to pay it forward than other recipients .
Edit intent: fluency
Original:   We further find that  " Luckiest draw" recipients , or those who obtain the largest shares of their corresponding red packets, are 1.5 times more likely to pay it forward than other recipients .
Revised:  We further find that " Luckiest draw" recipients repay 1.5 times more likely to pay it forward than other recipients .
Edit intent: clarity
Original:   We further find that  " Luckiest draw" recipients , or those who obtain the largest shares of their corresponding red packets, are 1.5 times more likely to pay it forward than other recipients .
Revised:  We further find that " Luckiest draw" recipients , or those who obtain the largest shares of their corresponding red packets, are 1.5 times more than other recipients .
Edit intent: clarity
Original: Does receiving a gift encourage the recipient to send more gifts ? Causal identification of behavioral contagion is very challenging , especially based on observational datafrom social networks.
Revised: Our study seeks to identify the social contagion of in-group gifts: if gifts trigger their recipients to send more gifts ? Causal identification of behavioral contagion is very challenging , especially based on observational datafrom social networks.
Edit intent: clarity
Original:  We find that, on average, receiving one more dollar causes a recipient to send 18 cents back to the group within the subsequent 24 hours.
Revised:  We find that, on average, receiving one additional dollar causes a recipient to send 18 cents back to the group within the subsequent 24 hours.
Edit intent: fluency
Original: The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property  . Laurent develops a sequent-style subtyping judgment , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Revised: The subtyping rules for intersection types traditionally employ a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property . Laurent develops a sequent-style subtyping judgment , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Edit intent: clarity
Original: The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property  . Laurent develops a sequent-style subtyping judgment , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Revised: The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that subtyping does not satisfy the subformula property . Laurent develops a sequent-style subtyping judgment , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Edit intent: clarity
Original: The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property  . Laurent develops a sequent-style subtyping judgment , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Revised: The subtyping relation for intersection type systems traditionally employs a transitivity rule (Barendregt et al. 1983), which means that the subtyping judgment does not enjoy the subformula property . Laurent develops a sequent-style subtyping system , without transitivity, and proves transitivity via a sequence of six lemmas that culminate in cut-elimination (2018).
Edit intent: fluency
Original:  This article presents a subtyping judgment, in regular style , that satisfies the subformula property, and presents a direct proof of transitivity .
Revised:  This article develops a subtyping system in regular style , that satisfies the subformula property, and presents a direct proof of transitivity .
Edit intent: clarity
Original:  This article presents a subtyping judgment, in regular style , that satisfies the subformula property, and presents a direct proof of transitivity .
Revised:  This article presents a subtyping judgment, in regular style that omits transitivity and provides a direct proof of transitivity .
Edit intent: clarity
Original:  The article concludes with a proof that the new subtyping judgment is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.
Revised:  The article proves that the new subtyping judgment is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.
Edit intent: clarity
Original:  The article concludes with a proof that the new subtyping judgment is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.
Revised:  The article concludes with a proof that the new subtyping system is equivalent to that of Barendregt, Coppo, and Dezani-Ciancaglini.
Edit intent: clarity
Original: In this article, we propose a two-grid based adaptive proper orthogonal decomposition (POD) algorithm to solve the time dependent partial differential equations.
Revised: In this article, we propose a two-grid based adaptive proper orthogonal decomposition (POD) method to solve the time dependent partial differential equations.
Edit intent: clarity
Original:  Our new algorithm is cheap and easy to  implement.
Revised:  Our new algorithm is cheap and easy to be implement.
Edit intent: fluency
Original:  We implement our new method to the solution of time-dependent advection-diffusion equations with  Kolmogorov flow and  ABC flow.
Revised:  We apply our new method to the solution of time-dependent advection-diffusion equations with Kolmogorov flow and ABC flow.
Edit intent: fluency
Original:  We implement our new method to the solution of time-dependent advection-diffusion equations with  Kolmogorov flow and  ABC flow.
Revised:  We implement our new method to the solution of time-dependent advection-diffusion equations with the Kolmogorov flow and ABC flow.
Edit intent: clarity
Original:  We implement our new method to the solution of time-dependent advection-diffusion equations with  Kolmogorov flow and  ABC flow.
Revised:  We implement our new method to the solution of time-dependent advection-diffusion equations with Kolmogorov flow and the ABC flow.
Edit intent: clarity
Original:  The numerical results show that our method is more efficient than the existing POD algorithms .
Revised:  The numerical results show that our method is more efficient than the existing POD methods .
Edit intent: clarity
Original:  In this paper we introduce ocular parallax rendering, a technology that accurately renders small amounts of gaze-contingent parallax capable of improving depth perception and realism in VR.
Revised:  In this article, we introduce ocular parallax rendering, a technology that accurately renders small amounts of gaze-contingent parallax capable of improving depth perception and realism in VR.
Edit intent: fluency
Original:  Here, I review the existing literature on the cognitive basis of cooperation, altruism, honesty, equity-efficiency, positive and negative reciprocity, and moral judgments .
Revised:  Here, I review the existing literature on the cognitive basis of cooperation, altruism, honesty, positive and negative reciprocity, and moral judgments .
Edit intent: clarity
Original:  Here, I review the existing literature on the cognitive basis of cooperation, altruism, honesty, equity-efficiency, positive and negative reciprocity, and moral judgments .
Revised:  Here, I review the existing literature on the cognitive basis of cooperation, altruism, honesty, equity-efficiency, positive and negative reciprocity, and utilitarianism .
Edit intent: clarity
Original:  For each of these domains, I list a number of open problems that I believe to be crucial to further advance our understanding of human social cognition .
Revised:  For each of these domains, I list a number of open problems that I believe to be crucial to further advance our understanding of the cognitive basis of human sociality .
Edit intent: clarity
Original:  This framework seems promising , as it turns out to make predictions that are generally in line with the experimental data in all but one domain: positive reciprocity.
Revised:  This framework seems to be a promising starting point , as it turns out to make predictions that are generally in line with the experimental data in all but one domain: positive reciprocity.
Edit intent: clarity
Original:  In this paper we give an algorithm for SBVD whose running time is O^*(2.076^k)  .
Revised:  In this paper we give algorithms for these problems whose running times are O^*(2.076^k) .
Edit intent: clarity
Original:  For completeness we additionally cross-compared Bayesian and free-energy approaches  .
Revised:  We additionally cross-compared Bayesian and free-energy approaches .
Edit intent: coherence
Original:  Models of schizophrenia mainly focused on hallucinations and delusional thoughts using neural disconnections or inhibitory imbalance as the predominating alteration.
Revised:  Models of schizophrenia mainly focused on hallucinations and delusional thoughts using neural dysconnections or inhibitory imbalance as the predominating alteration.
Edit intent: fluency
Original: In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language---representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely whether a program has certain growth-rate properties, in particular whether a computed value, or the program's running time, has a polynomial growth rate.
Revised: In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely whether a program has certain growth-rate properties, in particular whether a computed value, or the program's running time, has a polynomial growth rate.
Edit intent: fluency
Original:  This case study is conducted towards a better understanding of these fundamental trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.
Revised:  This comparison is conducted towards a better understanding of these fundamental trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.
Edit intent: clarity
Original:  This case study is conducted towards a better understanding of these fundamental trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.
Revised:  This case study is conducted towards a better understanding on trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.
Edit intent: clarity
Original: When deploying autonomous agents in the real world, we need to think about effective ways of communicating our objectives to them.
Revised: When deploying autonomous agents in the real world, we need effective ways of communicating our objectives to them.
Edit intent: clarity
Original: When deploying autonomous agents in the real world, we need to think about effective ways of communicating our objectives to them.
Revised: When deploying autonomous agents in the real world, we need to think about effective ways of communicating objectives to them.
Edit intent: clarity
Original:  Traditional skill learning has revolved around reinforcement and imitation learning, each with their own constraints on the format and temporal distribution with which information between the human and the agent is exchanged.
Revised:  Traditional skill learning has revolved around reinforcement and imitation learning, each with rigid constraints on the format and temporal distribution with which information between the human and the agent is exchanged.
Edit intent: clarity
Original:  Traditional skill learning has revolved around reinforcement and imitation learning, each with their own constraints on the format and temporal distribution with which information between the human and the agent is exchanged.
Revised:  Traditional skill learning has revolved around reinforcement and imitation learning, each with their own constraints on the format of information exchanged between the human and the agent is exchanged.
Edit intent: clarity
Original:  The prediction of pathologies affecting newborns based on their cry is thus of significant clinical interest, as it would facilitate the development of accessible, low-cost diagnostic tools based on wearables and smartphones .
Revised:  The prediction of pathologies affecting newborns based on their cry is thus of significant clinical interest, as it would facilitate the development of accessible, low-cost diagnostic tools .
Edit intent: clarity
Original: A modern vehicle contains many electronic control units (ECUs), which communicate with each other through the Controller Area Network (CAN) bus to ensure vehicle safety and performance.
Revised: A modern vehicle contains many electronic control units (ECUs), which communicate with each other through the in-vehicle network to ensure vehicle safety and performance.
Edit intent: clarity
Original:  Emerging Connected and Automated Vehicles (CAVs) will have more ECUs and coupling between them due to the vast array of additional sensors, advanced driving features (such as lane keeping and navigation) and Vehicle-to-Everything (V2X) connectivity.
Revised:  Emerging Connected and Automated Vehicles (CAVs) will have more ECUs and coupling between them due to the vast array of additional sensors, advanced driving features and Vehicle-to-Everything (V2X) connectivity.
Edit intent: clarity
Original:  As a result , CAVs will have more vulnerabilities within the in-vehicle network .
Revised:  Due to the connectivity , CAVs will have more vulnerabilities within the in-vehicle network .
Edit intent: coherence
Original:  As a result , CAVs will have more vulnerabilities within the in-vehicle network .
Revised:  As a result , CAVs will be more vulnerable to remote attackers .
Edit intent: clarity
Original:  In this study, we develop a software defined networking (SDN) based in-vehicle networking framework for security against false information attacks on CAN frames .
Revised:  In this study, we developed a software-defined in-vehicle networking framework for security against false information attacks on CAN frames .
Edit intent: coherence
Original:  In this study, we develop a software defined networking (SDN) based in-vehicle networking framework for security against false information attacks on CAN frames .
Revised:  In this study, we develop a software defined networking (SDN) based in-vehicle Ethernet networking system that provides security against false information attacks on CAN frames .
Edit intent: clarity