wanyu/IteraTeR_v2 huggingface dataset:
Original:  Theevolvability was defined by Valiant in a way similar to the learnability, which was proposed to understand the mysteries underlying natural evolution.
Revised:  The was defined by Valiant in a way similar to the learnability, which was proposed to understand the mysteries underlying natural evolution.
Edit intent: fluency
Original: This article aims at document engineering of PDF-based complex software specifications , where specifications of Object Management Group (OMG) are our initial targets.
Revised: This article aims at reengineering of PDF-based complex software specifications , where specifications of Object Management Group (OMG) are our initial targets.
Edit intent: clarity
Original: This article aims at document engineering of PDF-based complex software specifications , where specifications of Object Management Group (OMG) are our initial targets.
Revised: This article aims at document engineering of PDF-based complex documents , where specifications of Object Management Group (OMG) are our initial targets.
Edit intent: clarity
Original:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents  such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Revised:  Our objective is therefore to create an approach that allows us to reengineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Edit intent: fluency
Original:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents  such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Revised:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents ( such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Edit intent: fluency
Original:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents  such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Revised:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents such as specifications, technical books, etc so that end-users to have a better experience with them.
Edit intent: clarity
Original:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents  such as specifications, conference proceedings, technical books, etc so that end-users to have a better experience with them.
Revised:  Our objective is therefore to create an approach that allowed us to re-engineer PDF-based documents, and to illustrate how to make more usable versions of electronic documents such as specifications, conference proceedings, technical books, etc ) so that end users to have a better experience with them.
Edit intent: fluency
Original:  In the next phase, we created the multi-layer hypertext version of the document to facilitate document browsing and navigating.
Revised:  In the next phase, we created a multilayer hypertext version of the document to facilitate document browsing and navigating.
Edit intent: fluency
Original:  In the next phase, we created the multi-layer hypertext version of the document to facilitate document browsing and navigating.
Revised:  In the next phase, we created the multi-layer hypertext version of the document to facilitate browsing and navigating.
Edit intent: fluency
Original:  Although we initially focused on OMG software specifications, we chose a general approach for various phases of our work including format conversions, logical structure extraction, text extraction, multi-layer hypertext generation and concept exploration ;
Revised:  Although we initially focused on OMG software specifications, we chose a general approach for different phases of our work including format conversions, logical structure extraction, text extraction, multi-layer hypertext generation and concept exploration ;
Edit intent: fluency
Original:  Although we initially focused on OMG software specifications, we chose a general approach for various phases of our work including format conversions, logical structure extraction, text extraction, multi-layer hypertext generation and concept exploration ;
Revised:  Although we initially focused on OMG software specifications, we chose a general approach for various phases of our work including format conversions, logical structure extraction, text extraction, multilayer hypertext generation, and concept exploration ;
Edit intent: fluency
Original:  therefore , we can process other complex documents to achieve mentioned goals.
Revised:  therefore , we can process other complex documents to achieve our goals.
Edit intent: clarity
Original: This article aims at reengineering of PDF-based complex documents, where specifications of  Object Management Group (OMG) are our initial targets.
Revised: This article aims at reengineering of PDF-based complex documents, where specifications of the Object Management Group (OMG) are our initial targets.
Edit intent: fluency
Original: In this paper the study of two kinds of economic exchange, additive and multiplicative, in a system of N agents has been made .
Revised: We study two kinds of economic exchange, additive and multiplicative, in a system of N agents has been made .
Edit intent: clarity
Original: In this paper the study of two kinds of economic exchange, additive and multiplicative, in a system of N agents has been made .
Revised: In this paper the study of two kinds of economic exchange, additive and multiplicative, in a system of N agents .
Edit intent: clarity
Original:  The system evolves to a Boltzmann-Gibbs distribution with additive exchange a condenses with a multiplicative one.
Revised:  The system evolves to a Boltzmann-Gibbs distribution with additive exchange and condenses with a multiplicative one.
Edit intent: fluency
Original:  Consequently, the usual approach which employs the a-posteriori Pareto optimality of equilibrium allocations and the related representative-agent techniques in the complete-market setting cannot be used.
Revised:  Consequently, equilibrium allocations are not necessarily Pareto optimal and the related representative-agent techniques in the complete-market setting cannot be used.
Edit intent: clarity
Original:  Consequently, the usual approach which employs the a-posteriori Pareto optimality of equilibrium allocations and the related representative-agent techniques in the complete-market setting cannot be used.
Revised:  Consequently, the usual approach which employs the a-posteriori Pareto optimality of equilibrium allocations and the related representative-agent techniques cannot be used.
Edit intent: clarity
Original:  In this paper we go a step further and describe a modification of Kleitman and Wang's algorithm that is a more natural extension of Havel-Hakimi's algorithm, in the sense that our extension is equivalent to Havel-Hakimi's algorithm when the degree sequence is Eulerian and has an even degree sum.
Revised:  In this paper we go a step further and describe a modification of Kleitman and Wang's algorithm that is a more natural extension of Havel-Hakimi's algorithm, in the sense that our extension can be made equivalent to Havel-Hakimi's algorithm when the degree sequence is Eulerian and has an even degree sum.
Edit intent: clarity
Original:  We give structural characterizations of these directed graphs , as well as degree sequence characterizations for the _{3 ill-defined  sequences, leading to a well-defined algorithm .
Revised:  We give structural characterizations of these realizations , as well as degree sequence characterizations for the _{3 ill-defined sequences, leading to a well-defined algorithm .
Edit intent: clarity
Original:  We give structural characterizations of these directed graphs , as well as degree sequence characterizations for the _{3 ill-defined  sequences, leading to a well-defined algorithm .
Revised:  We give structural characterizations of these directed graphs , as well as _{3 ill-defined sequences, leading to a well-defined algorithm .
Edit intent: coherence
Original: We propose a class of distributed medium access control protocols that utilize memory about users' transmission decisions and feedback information.
Revised: Many existing medium access control protocols that utilize memory about users' transmission decisions and feedback information.
Edit intent: clarity
Original: We propose a class of distributed medium access control protocols that utilize memory about users' transmission decisions and feedback information.
Revised: We propose a class of distributed medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information.
Edit intent: clarity
Original:  We consider a slotted Aloha system and define protocols with memory  .
Revised:  We define protocols with memory .
Edit intent: coherence
Original:  We introduce two performance metrics, total throughput and average expected delay, and formulate the problem faced by a protocol designer of finding an optimal protocol.
Revised:  We introduce two performance metrics, throughput and average expected delay, and formulate the problem faced by a protocol designer of finding an optimal protocol.
Edit intent: clarity
Original:  We introduce two performance metrics, total throughput and average expected delay, and formulate the problem faced by a protocol designer of finding an optimal protocol.
Revised:  We introduce two performance metrics, total throughput and average delay, and formulate the problem faced by a protocol designer of finding an optimal protocol.
Edit intent: clarity
Original:  We introduce two performance metrics, total throughput and average expected delay, and formulate the problem faced by a protocol designer of finding an optimal protocol.
Revised:  We introduce two performance metrics, total throughput and average expected delay, and formulate the problem of finding an optimal protocol.
Edit intent: clarity
Original:  Incentive compatibility constraints can be imposed on the protocol designer's problem when users can manipulate prescribed protocols.
Edit intent: coherence
Original:  Next we analyze the performance of protocols with memory 1 (i.e., memory for one slot) using the Markov model and numerical methods.
Revised:  Next we analyze the performance of protocols with 1-slot memory using a Markov chain and numerical methods.
Edit intent: clarity
Original:  Finally, we apply our framework to a more general scenario of wireless local area networks and obtain a similar improvement from using memory in medium access control .
Revised:  Finally, we apply our framework to wireless local area networks and obtain a similar improvement from using memory in medium access control .
Edit intent: clarity
Original:  Finally, we apply our framework to a more general scenario of wireless local area networks and obtain a similar improvement from using memory in medium access control .
Revised:  Finally, we apply our framework to a more general scenario of wireless local area networks .
Edit intent: coherence
Original:  We study the chromatic number of the square of the Cartesian product C_m\Box C_n of two cycles and show that the value of this parameter is at most 7 except when m=n=3, in which case the value is 9, and when m=n=4 or m=3 and n=5, in which case the value is 8. Moreover, we conjecture that for every G=C_m\Box C_n, the chromatic number of G^2 equals \lceil mn/\alpha(G^2) \rceil, where \alpha(G^2) denotes the size of a maximal independent set in G^2.
Revised:  We study the chromatic number of the square of the Cartesian product C_m\Box C_n of two cycles and show that the value of this parameter is at most 7 except when m=n=3, in which case the value is 9, and when m=n=4 or m=3 and n=5, in which case the value is 8. Moreover, we conjecture that whenever G=C_m\Box C_n, the chromatic number of G^2 equals \lceil mn/\alpha(G^2) \rceil, where \alpha(G^2) denotes the size of a maximal independent set in G^2.
Edit intent: clarity
Original:  In this work, it is shown that node cooperation implies a tradeoff between throughput and transmission cost, which depends on the degree of cooperation.
Revised:  In this work, it is shown that cooperation implies for cooperating nodes a tradeoff between throughput and transmission cost, which depends on the degree of cooperation.
Edit intent: clarity
Original: We show that the statistics of spreads in real order books is characterized by an intrinsic asymmetry due to discreteness effects for even or odd values of the  .
Revised: We show that the statistics of spreads in real order books is characterized by an intrinsic asymmetry due to discreteness effects for even or odd values of the spread .
Edit intent: clarity
Original:  An analysis of data from the NYSE order book point out that traders' strategies contribute to this asymmetry.
Revised:  An analysis of data from the NYSE order book points out that traders' strategies contribute to this asymmetry.
Edit intent: fluency
Original:  Monte Carlo simulations of our model also show a realistic dynamics with a sort of intermittent behavior characterized by long periods in which the order book is compact and liquid interrupted by volatile and sparse configurations .
Revised:  Simulations of our model also show a realistic dynamics with a sort of intermittent behavior characterized by long periods in which the order book is compact and liquid interrupted by volatile and sparse configurations .
Edit intent: clarity
Original:  In fact, we show that the quantum bounded-error complexity is polynomially related to the classical deterministic complexity and further to the block sensitivity of f.
Revised:  We further show that the quantum bounded-error complexity is polynomially related to the classical deterministic complexity and further to the block sensitivity of f.
Edit intent: coherence
Original:  In fact, we show that the quantum bounded-error complexity is polynomially related to the classical deterministic complexity and further to the block sensitivity of f.
Revised:  In fact, we show that the quantum bounded-error complexity is polynomially related to the classical deterministic complexity and the block sensitivity of f.
Edit intent: clarity
Original: A challenging open problem in communication complexity (Buhrman and de Wolf, 2001;
Revised: An open problem in communication complexity (Buhrman and de Wolf, 2001;
Edit intent: clarity
Original:  We establish , in%DIFDELCMD < \RR%%% ^2, a lower bound of about 2.37^n improving the best existing bound of about 2.29^n by Borcea and Streinu, whereas in \RR^3 we establish the first bound of about 2.52^n, where n denotes the number of vertices.
Revised:  We establish %DIFDELCMD < \RR%%% ^2, a lower bound of about 2.37^n improving the best existing bound of about 2.29^n by Borcea and Streinu, whereas in \RR^3 we establish the first bound of about 2.52^n, where n denotes the number of vertices.
Edit intent: fluency
Original:  We establish , in%DIFDELCMD < \RR%%% ^2, a lower bound of about 2.37^n improving the best existing bound of about 2.29^n by Borcea and Streinu, whereas in \RR^3 we establish the first bound of about 2.52^n, where n denotes the number of vertices.
Revised:  We establish , in%DIFDELCMD < \RR%%% the first lower bound in \RR^3 we establish the first bound of about 2.52^n, where n denotes the number of vertices.
Edit intent: coherence
Original:  We establish , in%DIFDELCMD < \RR%%% ^2, a lower bound of about 2.37^n improving the best existing bound of about 2.29^n by Borcea and Streinu, whereas in \RR^3 we establish the first bound of about 2.52^n, where n denotes the number of vertices.
Revised:  We establish , in%DIFDELCMD < \RR%%% ^2, a lower bound of about 2.37^n improving the best existing bound of about 2.29^n by Borcea and Streinu, whereas in \RR^3 of about 2.52^n, where n denotes the number of vertices.
Edit intent: clarity
Original:  Our implementation yields the first tight bounds for n =7,8 \le  in \RR^2 , and for \RR n= 6, 7 in \RR^3 by enumerating all rigid graphs up to isomorphism .
Revised:  Our implementation yields the first tight bounds for n =7,8 \le in \RR^2 and for \RR n= 6, 7 in \RR^3 by enumerating all rigid graphs up to isomorphism .
Edit intent: fluency
Original:  Our implementation yields the first tight bounds for n =7,8 \le  in \RR^2 , and for \RR n= 6, 7 in \RR^3 by enumerating all rigid graphs up to isomorphism .
Revised:  Our implementation yields the first tight bounds for n =7,8 \le in \RR^2 , and \RR n= 6, 7 in \RR^3 by enumerating all rigid graphs up to isomorphism .
Edit intent: fluency
Original:  A bucket decomposition partitions the vertex set of a graph into ordered sets (called buckets) of (almost) equal sizes such that all edges are either incident on vertices in the same bucket or on vertices in two consecutive buckets.
Revised:  A bucket decomposition partitions the vertex set of a graph into ordered sets (called buckets) of (almost) equal sizes such that all edges are either incident to vertices in the same bucket or on vertices in two consecutive buckets.
Edit intent: fluency
Original:  A bucket decomposition partitions the vertex set of a graph into ordered sets (called buckets) of (almost) equal sizes such that all edges are either incident on vertices in the same bucket or on vertices in two consecutive buckets.
Revised:  A bucket decomposition partitions the vertex set of a graph into ordered sets (called buckets) of (almost) equal sizes such that all edges are either incident on vertices in the same bucket or to vertices in two consecutive buckets.
Edit intent: fluency
Original:  In first one  when two-dimensional risk process hits the barrier the minimal amount of dividends is payed out to keep the risk process within the regionbounded by the barrier .
Revised:  In first one the dividends are payed out when two-dimensional risk process hits the barrier the minimal amount of dividends is payed out to keep the risk process within the regionbounded by the barrier .
Edit intent: clarity
Original:  In first one  when two-dimensional risk process hits the barrier the minimal amount of dividends is payed out to keep the risk process within the regionbounded by the barrier .
Revised:  In first one when two-dimensional risk process exit fixed region .
Edit intent: clarity
Original:  The ruin is achieved if the corresponding two-dimensional risk process first leave the positive quadrant.
Revised:  The ruin is achieved when the corresponding two-dimensional risk process first leave the positive quadrant.
Edit intent: fluency
Original:  The ruin is achieved if the corresponding two-dimensional risk process first leave the positive quadrant.
Revised:  The ruin is achieved if the corresponding two-dimensional risk process first leaves the positive quadrant.
Edit intent: fluency
Original:  We will consider two scenarios of  controlled process: refraction and the impulse control.
Revised:  We will consider two scenarios of the controlled process: refraction and the impulse control.
Edit intent: fluency
Original:  We will consider two scenarios of  controlled process: refraction and the impulse control.
Revised:  We will consider two scenarios of controlled process: refraction and impulse control.
Edit intent: fluency
Original:  In first one the dividends are payed out when  two-dimensional risk process exit fixed region.
Revised:  In the first case the dividends are payed out when two-dimensional risk process exit fixed region.
Edit intent: clarity
Original:  In first one the dividends are payed out when  two-dimensional risk process exit fixed region.
Revised:  In first one the dividends are payed out when the two-dimensional risk process exit fixed region.
Edit intent: fluency
Original:  In first one the dividends are payed out when  two-dimensional risk process exit fixed region.
Revised:  In first one the dividends are payed out when two-dimensional risk process exits the fixed region.
Edit intent: fluency
Original:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Revised:  In the second scenario , whenever the process hits the horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Edit intent: fluency
Original:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Revised:  In the second scenario whenever process hits horizontal line, it is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Edit intent: clarity
Original:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Revised:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividends to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Edit intent: fluency
Original:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant and waits there for the first claim to arrive.
Revised:  In the second scenario whenever process hits horizontal line, the risk process is reduced by paying dividend to some fixed point in the positive quadrant where it waits for the next claim to arrive.
Edit intent: clarity
Original:  In both models we calculate  discounted cumulative dividend payments until the ruin time .
Revised:  In both models we calculate the discounted cumulative dividend payments until the ruin time .
Edit intent: fluency
Original:  In both models we calculate  discounted cumulative dividend payments until the ruin time .
Revised:  In both models we calculate discounted cumulative dividend payments until the ruin .
Edit intent: clarity
Original:  This paper is an attempt at understanding the effect of dependencies of two portfolios on the the join optimal strategy of paying dividends.
Revised:  This paper is the first attempt to understand the effect of dependencies of two portfolios on the the join optimal strategy of paying dividends.
Edit intent: clarity
Original:  This paper is an attempt at understanding the effect of dependencies of two portfolios on the the join optimal strategy of paying dividends.
Revised:  This paper is an attempt at understanding the effect of dependencies of two portfolios on the joint optimal strategy of paying dividends.
Edit intent: fluency
Original:  For the proportional reinsurance we can observe for example the interesting phenomenon that is dependence of choice of the optimal barrier  on the initial reserves.
Revised:  For example in case of proportional reinsurance one can observe the interesting phenomenon that is dependence of choice of the optimal barrier on the initial reserves.
Edit intent: clarity