wanyu/IteraTeR_v2 huggingface dataset:
Original:  To demonstrate the robustness of QQC, we provide three natural characterizations and prove compositionality 
Revised:  To demonstrate the robustness of QQC, we provide three natural characterizations and prove compositionality .
Edit intent: fluency
Original:  In these games, the payoff of each agent depends on the agreement of her strategy to her internal belief and on its coordination with the strategies of her neighbors in the social network.
Revised:  In these games, the cost of each agent depends on the agreement of her strategy to her internal belief and on its coordination with the strategies of her neighbors in the social network.
Edit intent: clarity
Original:  We show that deciding whether a minority belief can become the majority opinion is NP-hard even when the initial number of supporters of this belief is very close to 1/4 of the social network size.
Revised:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the initial number of supporters of this belief is very close to 1/4 of the social network size.
Edit intent: clarity
Original:  We show that deciding whether a minority belief can become the majority opinion is NP-hard even when the initial number of supporters of this belief is very close to 1/4 of the social network size.
Revised:  We show that deciding whether a minority belief can become the majority opinion is NP-hard even when the initial number of supporters of this belief is at most 1/4 of the social network size.
Edit intent: clarity
Original:  More importantly, we show that every two-strategy game that admits a generalized ordinal potential function is structurally equivalent to a generalized discrete preference game.
Revised:  More importantly, we show that every game with two strategies per agent that admits a generalized ordinal potential function is structurally equivalent to a generalized discrete preference game.
Edit intent: clarity
Original:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the initial number of supporters of this belief is at most 1/ 4 of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Revised:  We show that deciding whether a graph admits a minority that becomes majority is NP-hard when the initial number of supporters of this belief is at most 1/ 4 of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Edit intent: clarity
Original:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the initial number of supporters of this belief is at most 1/ 4 of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Revised:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the minority size is at most 1/ 4 of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Edit intent: clarity
Original:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the initial number of supporters of this belief is at most 1/ 4 of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Revised:  We show that deciding whether a minority belief can become the majority opinion is NP-hard when the initial number of supporters of this belief is at most 1/ 4-th of the social network size . Next, motivated by the limited expressive power of discrete preference games, we define and study the novel class of generalized discrete preference games.
Edit intent: clarity
Original:  A profile of the agents' preferences is stable if the preference of each agent coincides with the preference of at least half of the neighbors (thus, the system stabilizes ).
Revised:  A profile of the agents' preferences is stable if the preference of each agent coincides with the preference of at least half of the neighbors (thus, the system is in equilibrium ).
Edit intent: clarity
Original:  It does not take into account the actual values of preference (even if they are initially known).
Revised:  This does not take into account the actual values of preference (even if they are initially known).
Edit intent: fluency
Original:  The Heuristic Rating Estimation (HRE) approach is a modification of this method in which the initial values of preference (when they are known) are taken into account.
Revised:  The Heuristic Rating Estimation (HRE) approach is a modification of this method in which the initial values of preferences (when they are known) are taken into account.
Edit intent: fluency
Original:  Determining the relative order of preferences is to solve a certain linear equation system defined by the matrix A and the constant term vector b (both obtained from M).
Revised:  To determine the relative order of preferences is to solve a certain linear equation system defined by the matrix A and the constant term vector b (both obtained from M).
Edit intent: fluency
Original:  The article explores the properties of those equation system .
Revised:  The article explores the properties of these equation systems .
Edit intent: fluency
Original:  In particular  it is proven that for some small data inconsistency the A matrix is  M-matrix, hence the equation proposed by the HRE approach has a unique strictly positive solution.
Revised:  In particular , it is proven that for some small data inconsistency the A matrix is M-matrix, hence the equation proposed by the HRE approach has a unique strictly positive solution.
Edit intent: fluency
Original:  In particular  it is proven that for some small data inconsistency the A matrix is  M-matrix, hence the equation proposed by the HRE approach has a unique strictly positive solution.
Revised:  In particular it is proven that for some small data inconsistency the A matrix is an M-matrix, hence the equation proposed by the HRE approach has a unique strictly positive solution.
Edit intent: fluency
Original:  This does not take into account the actual values of preference (even if they are initially known) .
Revised:  This does not take into account the actual values of preference .
Edit intent: clarity
Original:  The Heuristic Rating Estimation (HRE) approach is a modification of this method in which the initial valuesof preferences (when they are known) are taken into account .
Revised:  The Heuristic Rating Estimation (HRE) approach is a modification of this method in which allows modelling of the reference values .
Edit intent: clarity
Original:  To determine the relative order of preferences is to solve a certain linear equation system defined by the matrix A and the constant term vector b (both obtained from M).
Revised:  To determine the relative order of preferences is to solve a certain linear equation system defined by the matrix A and the constant term vector b (both derived from M).
Edit intent: fluency
Original:  We propose an approach that allows detection of collisions even between continuous, stochastic trajectories with the only restriction that means and covariances can be computed.
Revised:  We propose an approach that allows detection of collisions even between continuous, stochastic trajectories with the only restriction that means and variances can be computed.
Edit intent: clarity
Original:  However, several studies have proved that real economic networks  are topologically very different from networks inferred only from node strengths.
Revised:  However, several studies have proved that real economic networks are topologically very different from configurations inferred only from node strengths.
Edit intent: clarity
Original:  Here we provide a detailed analysis for the World Trade Web (WTW) by comparing it to an enhanced null model that simultaneously reproduces the strength and the number of connections of each node.
Revised:  Here we provide a detailed analysis for the World Trade Web (WTW) by comparing it to an enhanced null model that simultaneously reproduces the strength and the degree of each node.
Edit intent: clarity
Original:  We study several temporal snapshots and different aggregation levels (commodity classes) of the WTW and systematically find that the observed properties are extremely well reproduced by our model.
Revised:  We study several temporal snapshots and different layers (commodity classes) of the WTW and systematically find that the observed properties are extremely well reproduced by our model.
Edit intent: clarity
Original: In economic and financial networks, the strength (total value of the connections) of a given node has always an important economic meaning, such as the size of supply and demand, import and export, or financial exposure.
Revised: In economic and financial networks, the strength of each node has always an important economic meaning, such as the size of supply and demand, import and export, or financial exposure.
Edit intent: clarity
Original:  Here we provide a detailed analysis for the World Trade Multiplex by comparing it to an enhanced null model that we recently introduced in order to simultaneously reproduce the strength and the degree of each node.
Revised:  Here we provide a detailed analysis of the World Trade Multiplex by comparing it to an enhanced null model that we recently introduced in order to simultaneously reproduce the strength and the degree of each node.
Edit intent: fluency
Original:  Here we provide a detailed analysis for the World Trade Multiplex by comparing it to an enhanced null model that we recently introduced in order to simultaneously reproduce the strength and the degree of each node.
Revised:  Here we provide a detailed analysis for the World Trade Multiplex by comparing it to an enhanced null model that simultaneously reproduces the strength and the degree of each node.
Edit intent: clarity
Original:  We study several temporal snapshots and different layers (commodity classes) of the multiplex and systematically find that the observed properties are extremely well reproduced by our model.
Revised:  We study several temporal snapshots and different layers (commodity classes) of the multiplex and find that the observed properties are extremely well reproduced by our model.
Edit intent: coherence
Original:  We study several temporal snapshots and different layers (commodity classes) of the multiplex and systematically find that the observed properties are extremely well reproduced by our model.
Revised:  We study several temporal snapshots and different layers (commodity classes) of the multiplex and systematically find that the observed properties are systematically well reproduced by our model.
Edit intent: clarity
Original:  This allows us to introduce the  concept of extensive and intensive bias, defined as a measurable tendency of the network to prefer either the formation of new links or the reinforcement of existing ones.
Revised:  This allows us to introduce the concept of extensive and intensive bias, defined as a measurable tendency of the network to prefer either the formation of extra links or the reinforcement of existing ones.
Edit intent: clarity
Original:  In addition, our method can identify selection occurring at different levels (i.e. population or region-specific adaptation) , as well as convergent selection in different regions.
Revised:  In addition, our method can identify selection occurring at different scales , as well as convergent selection in different regions.
Edit intent: clarity
Original:  In addition, our method can identify selection occurring at different levels (i.e. population or region-specific adaptation) , as well as convergent selection in different regions.
Revised:  In addition, our method can identify selection occurring at different levels (i.e. population or region-specific adaptation) , as well as convergent adaptation in different regions.
Edit intent: fluency
Original:  The simultaneous analysis of these two geographic areas allows us to identify several new candidate genome regions for altitudinal selection, and we show that convergent evolution among continents has been quite common.
Revised:  The simultaneous analysis of these two geographic areas allows us to identify several candidate genome regions for altitudinal selection, and we show that convergent evolution among continents has been quite common.
Edit intent: clarity
Original:   This notion of resilience suggests an array of open questions for graph colorability and other combinatorial problems.
Revised:  This notion of resilience suggests an array of open questions for graph coloring and other combinatorial problems.
Edit intent: clarity
Original:  Most epidemic models however assume that the spreading process takes place on a single level (be it a single population, a meta-population system or a network of contacts).
Revised:  However, most epidemic models assume that the spreading process takes place on a single level (be it a single population, a meta-population system or a network of contacts).
Edit intent: coherence
Original:  The latter is in part a consequence of our still limited knowledge about the interdependency of the many mechanisms and factors involved in disease spreading.
Edit intent: clarity
Original:  In this paper, we study a model that allows describing the spreading dynamics of two concurrent diseases and apply it to a paradigmatic case of disease-disease interaction: the interaction between AIDS and Tuberculosis . Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and also compute the temporal evolution characterizing the unfolding dynamics.
Revised:  In this paper, we propose a framework that allows describing the spreading dynamics of two concurrent diseases and apply it to a paradigmatic case of disease-disease interaction: the interaction between AIDS and Tuberculosis . Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and also compute the temporal evolution characterizing the unfolding dynamics.
Edit intent: clarity
Original:  In this paper, we study a model that allows describing the spreading dynamics of two concurrent diseases and apply it to a paradigmatic case of disease-disease interaction: the interaction between AIDS and Tuberculosis . Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and also compute the temporal evolution characterizing the unfolding dynamics.
Revised:  In this paper, we study a model that allows describing the spreading dynamics of two concurrent diseases . Specifically, we characterize analytically the epidemic thresholds of the two diseases for different scenarios and also compute the temporal evolution characterizing the unfolding dynamics.
Edit intent: coherence
Original:  These results have important implications for our understanding of competitions and various applications that leverage such models.
Revised:  These results have important implications to competitions not only in complex social systems but also in contexts that leverage such models.
Edit intent: clarity
Original:  In this paper , we consider a caching network with one source, hosting m files, connected to n destinations, each with a storage capacity of M files, via a shared link.
Revised:  In this work , we consider a caching network with one source, hosting m files, connected to n destinations, each with a storage capacity of M files, via a shared link.
Edit intent: clarity
Original:  Given that file requests follow a Zipf popularity distribution , our objective is to characterize the minimum average number of transmissions to satisfy all user demands in the information theoretic sense .
Revised:  Given that file requests follow a Zipf popularity distribution . In this case, we pose the problem in terms of the minimum average number of transmissions to satisfy all user demands in the information theoretic sense .
Edit intent: clarity
Original:  Furthermore, the data are analysed with an advanced statistical technique ( segmented regression analysis ) which can identify specific segments with similar growth rates in the history of science.
Revised:  Furthermore, the data are analysed with an advanced statistical technique - segmented regression analysis ) which can identify specific segments with similar growth rates in the history of science.
Edit intent: fluency
Original:  Furthermore, the data are analysed with an advanced statistical technique ( segmented regression analysis ) which can identify specific segments with similar growth rates in the history of science.
Revised:  Furthermore, the data are analysed with an advanced statistical technique ( segmented regression analysis - which can identify specific segments with similar growth rates in the history of science.
Edit intent: fluency
Original:  In our analysis  we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 percent up to the middle of the 18th century, to 2 to 3 percent up to the period between the two world wars and 8 to 9 percent to 2012.
Revised:  In our analysis we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 \% up to the middle of the 18th century, to 2 to 3 percent up to the period between the two world wars and 8 to 9 percent to 2012.
Edit intent: fluency
Original:  In our analysis  we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 percent up to the middle of the 18th century, to 2 to 3 percent up to the period between the two world wars and 8 to 9 percent to 2012.
Revised:  In our analysis we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 percent up to the middle of the 18th century, to 2 to 3 \% up to the period between the two world wars and 8 to 9 percent to 2012.
Edit intent: fluency
Original:  In our analysis  we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 percent up to the middle of the 18th century, to 2 to 3 percent up to the period between the two world wars and 8 to 9 percent to 2012.
Revised:  In our analysis we identified three growth phases in the development of science, which each led to growth rates tripling in comparison with the previous phase: from less than 1 percent up to the middle of the 18th century, to 2 to 3 percent up to the period between the two world wars and 8 to 9 \% to 2012.
Edit intent: fluency
Original:  We performed binaural recordings of three auditory scenes with varying spatial properties.
Revised:  Here, we performed binaural recordings of three auditory scenes with varying spatial properties.
Edit intent: coherence
Original:  We provide a novel example by giving polynomial-size Turing kernels for k-Path and k-Cycle on planar graphs, graphs of maximum degreet , claw-free graphs, and K_{3,t}-minor-free graphs , for each constant t>=3.
Revised:  We provide a novel example by giving polynomial-size Turing kernels when restricted to planar graphs, graphs of maximum degreet , claw-free graphs, and K_{3,t}-minor-free graphs , for each constant t>=3.
Edit intent: clarity
Original:  We provide a novel example by giving polynomial-size Turing kernels for k-Path and k-Cycle on planar graphs, graphs of maximum degreet , claw-free graphs, and K_{3,t}-minor-free graphs , for each constant t>=3.
Revised:  We provide a novel example by giving polynomial-size Turing kernels for k-Path and k-Cycle on planar graphs, graphs of bounded degree , claw-free graphs, and K_{3,t}-minor-free graphs , for each constant t>=3.
Edit intent: clarity
Original:  We provide a novel example by giving polynomial-size Turing kernels for k-Path and k-Cycle on planar graphs, graphs of maximum degreet , claw-free graphs, and K_{3,t}-minor-free graphs , for each constant t>=3.
Revised:  We provide a novel example by giving polynomial-size Turing kernels for k-Path and k-Cycle on planar graphs, graphs of maximum degreet , claw-free graphs, or to K_{3,t}-minor-free graphs , for each constant t>=3.
Edit intent: clarity
Original:  Concretely, we present algorithms for k-Path (k-Cycle) on these restricted graph families that run in polynomial time when they are allowed to query an external oracle for the answers to k-Path (k-Cycle) instances of size and parameter bounded polynomially in k.
Revised:  Concretely, we present algorithms for k-Path (k-Cycle) on these restricted graph families that run in polynomial time when given access to an oracle that solves k-Path (k-Cycle) instances of size and parameter bounded polynomially in k.
Edit intent: clarity
Original:  Although making minimal offers and accepting any offers is the most rational choice in UG, human subjects tend to behave more fairly in experiments . Previous studies suggested that extra information such as reputation or empathy is needed for fairness to evolve in UG. Here we show that fairness can evolve without additional information if the game is probabilistic , which we call the Not Quite Ultimatum Game (NQUG).
Revised:  Although making minimal offers and accepting any offers is the most rational choice in UG, human subjects tend to behave more fairly in UG . Previous studies suggested that extra information such as reputation or empathy is needed for fairness to evolve in UG. Here we show that fairness can evolve without additional information if the game is probabilistic , which we call the Not Quite Ultimatum Game (NQUG).
Edit intent: clarity
Original:  Although making minimal offers and accepting any offers is the most rational choice in UG, human subjects tend to behave more fairly in experiments . Previous studies suggested that extra information such as reputation or empathy is needed for fairness to evolve in UG. Here we show that fairness can evolve without additional information if the game is probabilistic , which we call the Not Quite Ultimatum Game (NQUG).
Revised:  Although making minimal offers and accepting any offers is the most rational choice in UG, human subjects tend to behave more fairly in experiments . Previous studies suggested that extra information such as reputation , empathy, or spatial structure is needed for fairness to evolve in UG. Here we show that fairness can evolve without additional information if the game is probabilistic , which we call the Not Quite Ultimatum Game (NQUG).
Edit intent: clarity
Original:  In NQUG , players make decisions probabilistically and may continue interactions when the offer is rejected .
Revised:  Evolutionary simulations of NQUG showed that the probabilistic decision making contributes to the increase of proposers' offer amounts to avoid rejection, while the repetition of the game works to responders' advantage because they can wait until a good offer comes .
Edit intent: coherence
Original: The recent financial crisis illustrated the need for a thorough, functional understanding of systemic risk in strongly interconnected financial structures.
Revised: The 2008 financial crisis illustrated the need for a thorough, functional understanding of systemic risk in strongly interconnected financial structures.
Edit intent: clarity