wanyu/IteraTeR_v2 huggingface dataset:
Original:  This paper  proposes a practical method to compute the expected value of an n authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex ante information about the publication  potential merits or scientific impact.
Revised:  This paper proposes a practical method to compute the expected value of an n authors publication that takes into consideration the added value induced by collaboration in contexts in which there is no prior or ex ante information about the publication 's potential merits or scientific impact.
Edit intent: fluency
Original:  We expect that our findings can help researchers and decision makers to choose more effective and fair counting methods that take into account the benefits of collaboration.
Revised:  We expect that our findings can help researchers and decision-makers to choose more effective and fair counting methods that take into account the benefits of collaboration.
Edit intent: fluency
Original:  Using this notion of Centroids  we construct two novel routing protocols and evaluate their performance with respect to positional errors as well as traditional DTN routing metrics.
Revised:  Using this notion of Centroids , we construct two novel routing protocols and evaluate their performance with respect to positional errors as well as traditional DTN routing metrics.
Edit intent: fluency
Original: How to define and use the concept of inclusive fitness is a contentious topic in social evolution theory.
Revised: How to define and use the concept of inclusive fitness is a contentious topic in evolutionary theory.
Edit intent: clarity
Original:  Using inclusive fitness to explain organismal design has been challenged as incompatible with selection acting on individual genes, and for being restrictive in its applicability because it requires that social interactions are strictly additive, and that selection is weak.
Edit intent: coherence
Original:  Here we argue that this use of inclusive fitness is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to the behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Revised:  Here we argue that the latter usage is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to the behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Edit intent: clarity
Original:  Here we argue that this use of inclusive fitness is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to the behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Revised:  Here we argue that this use of inclusive fitness is justified under far broader conditions than previously shown, but only if inclusive fitness is appropriately redefined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to the behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Edit intent: clarity
Original:  Here we argue that this use of inclusive fitness is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to the behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Revised:  Here we argue that this use of inclusive fitness is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, organisms should maximise the sum of their offspring (including any accrued due to behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Edit intent: fluency
Original:  Inclusive fitness can be used to calculate selection on a focal gene, but it is also applied to whole organisms , which are predicted to appear designed as if to maximise their inclusive fitness.
Revised:  Inclusive fitness can be used to calculate selection on a focal gene, but it is also applied to whole organisms . Individuals are predicted to appear designed as if to maximise their inclusive fitness.
Edit intent: clarity
Original:  Here we argue that the latter usage is justified under far broader conditions than previously shown, but only if inclusive fitness is appropriately redefined.
Revised:  Here we argue that applying the concept of inclusive fitness to organisms is justified under far broader conditions than previously shown, but only if inclusive fitness is appropriately redefined.
Edit intent: clarity
Original:  Here we argue that the latter usage is justified under far broader conditions than previously shown, but only if inclusive fitness is appropriately redefined.
Revised:  Here we argue that the latter usage is justified under far broader conditions than previously shown, but only if it is appropriately redefined.
Edit intent: clarity
Original:  Specifically,  organisms should maximise the sum of their offspring (including any accrued due to behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Revised:  Specifically, we propose that organisms should maximise the sum of their offspring (including any accrued due to behaviour of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Edit intent: clarity
Original:  Individuals are  predicted to appear designed as if to maximise their inclusive fitness  .
Revised:  Individuals are then predicted to appear designed as if to maximise their inclusive fitness .
Edit intent: coherence
Original:  Here we argue that applying the concept of inclusive fitness to organisms is justified under far broader conditions than previously shown, but only if it is appropriately redefined . Specifically, we propose that organisms should maximise the sum of their offspring (including any accrued due to the behaviour/phenotype of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Revised:  Here we argue that applying the concept of inclusive fitness to organisms is justified under far broader conditions than previously shown, but only if it is appropriately defined . Specifically, we propose that organisms should maximise the sum of their offspring (including any accrued due to the behaviour/phenotype of relatives), plus any effects on their relatives' offspring production, weighted by relatedness.
Edit intent: clarity
Original:  In many cases, they are the component that requires the highest computational resources during execution.
Revised:  In many cases, they are the component that require the highest computational resources during execution.
Edit intent: fluency
Original:  One common approach to reduce the complexity of the inference is to prune and quantize the weight matrices of the neural network and to efficiently represent them using sparse matrix data structures .
Revised:  One common approach to reduce the cost of inference is to prune and quantize the weight matrices of the neural network and to efficiently represent them using sparse matrix data structures .
Edit intent: clarity
Original:  In this paper we  present new efficient data structures for representing matrices with low entropy statistics and show that these formats are especially suitable for representing neural networks.
Revised:  In this paper we present new efficient representations for matrices with low entropy statistics and show that these formats are especially suitable for representing neural networks.
Edit intent: clarity
Original:  Moreover, we show that the proposed data structures can not only be regarded as a generalization of sparse formats, but are also more energy and time efficient under practically relevant assumptions.
Revised:  Moreover, we show that performing the dot product under these new matrix formats can indeed be more energy and time efficient under practically relevant assumptions.
Edit intent: clarity
Original:  In this paper, we propose NetLSD ( Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and scalably computable graph representation method that allows for straightforward comparisons . NetLSD hears the shape of a graph by extracting a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Revised:  In this paper, we propose the Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and scalably computable graph representation method that allows for straightforward comparisons . NetLSD hears the shape of a graph by extracting a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Edit intent: coherence
Original:  In this paper, we propose NetLSD ( Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and scalably computable graph representation method that allows for straightforward comparisons . NetLSD hears the shape of a graph by extracting a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Revised:  In this paper, we propose NetLSD ( Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and efficiently computable graph representation method that allows for straightforward comparisons . NetLSD hears the shape of a graph by extracting a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Edit intent: clarity
Original:  In this paper, we propose NetLSD ( Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and scalably computable graph representation method that allows for straightforward comparisons . NetLSD hears the shape of a graph by extracting a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Revised:  In this paper, we propose NetLSD ( Network Laplacian Spectral Descriptor ), a permutation- and size-invariant, scale-adaptive, and scalably computable graph representation method that allows for straightforward comparisons of large graphs. NetLSD extracts a compact signature that inherits the formal properties of the Laplacian spectrum, specifically its heat or wave kernel .
Edit intent: clarity
Original:  Building on the relation between inference and learning, we derive a synaptic plasticity rule that relies only on delayed activity correlations, and that shows a number of remarkable features.
Revised:  Building on the relationship between inference and learning, we derive a synaptic plasticity rule that relies only on delayed activity correlations, and that shows a number of remarkable features.
Edit intent: fluency
Original:  When hidden units are present, our learning rule can be employed to construct Boltzman-Machine-like generative models, exploiting the addition of hidden neurons in feature extraction and classification tasks.
Revised:  When hidden units are present, our learning rule can be employed to construct Boltzmann machine-like generative models, exploiting the addition of hidden neurons in feature extraction and classification tasks.
Edit intent: fluency
Original: Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under  block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs.
Revised: Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs.
Edit intent: fluency
Original:  We present a "jump" function for which the performance of the (1+1) EA using any static uniform mutation and any restart strategy can be worse than the performance of the (1 +1)EA using our mutation operator with no restarts.
Revised:  We show that the (1+1) EA using any static uniform mutation and any restart strategy can be worse than the performance of the (1 +1)EA using our mutation operator with no restarts.
Edit intent: coherence
Original:  We present a "jump" function for which the performance of the (1+1) EA using any static uniform mutation and any restart strategy can be worse than the performance of the (1 +1)EA using our mutation operator with no restarts.
Revised:  We present a "jump" function for which the performance of the (1+1) EA using our mutation operator finds a (1 +1)EA using our mutation operator with no restarts.
Edit intent: clarity
Original:  We show that the (1+1) EA using our mutation operator finds a (1/3)-approximation ratio on any non-negative submodular function in polynomial time.
Revised:  We show that the (1+1) EA using our operator finds a (1/3)-approximation ratio on any non-negative submodular function in polynomial time.
Edit intent: clarity
Original:  We show that the (1+1) EA using our mutation operator finds a (1/3)-approximation ratio on any non-negative submodular function in polynomial time.
Revised:  We show that the (1+1) EA using our mutation operator finds a (1/3)-approximation within polynomial time.
Edit intent: clarity
Original:  Finally, we evaluate experimentally the performance of the (1+1)EA using our operator , on real-world graphs of different origins  with up to 37,000 vertices and 1.6 million edges .
Revised:  Finally, we evaluate the performance of the (1+1)EA using our operator , on real-world graphs of different origins with up to 37,000 vertices and 1.6 million edges .
Edit intent: clarity
Original:  Finally, we evaluate experimentally the performance of the (1+1)EA using our operator , on real-world graphs of different origins  with up to 37,000 vertices and 1.6 million edges .
Revised:  Finally, we evaluate experimentally the performance of the (1+1)EA using our operator , on real-world graphs of different origins , and with up to 37,000 vertices and 1.6 million edges .
Edit intent: coherence
Original:  We propose a provable randomized framework in which a clustering algorithm is applied to a graphs adjacency matrix generated from a stochastic block model.
Revised:  We propose a provable randomized framework in which a clustering algorithm is applied to a graph's adjacency matrix generated from a stochastic block model.
Edit intent: fluency
Original:  A sub-matrix is constructed using random sampling, and the low rank component is found using a convex-optimization based matrix completion algorithm.
Revised:  A sub-matrix is constructed using random sampling, and the low rank component is found using a convex-optimization-based matrix completion algorithm.
Edit intent: fluency
Original:  The clusters are then identified based on this low rank component using a correlation based retrieval step.
Revised:  The clusters are then identified based on this low rank component using a correlation-based retrieval step.
Edit intent: fluency
Original: This paper focuses on the unsupervised clustering of large partially observed graphs.
Revised: This paper explores and analyzes the unsupervised clustering of large partially observed graphs.
Edit intent: clarity
Original:  We propose a  provable randomized framework in which a clustering algorithm is applied to a  graph's adjacency matrix generated from a stochastic block model.
Revised:  We propose a provable randomized framework for clustering graphs generated from the stochastic block model. The clustering is first applied to a graph's adjacency matrix generated from a stochastic block model.
Edit intent: clarity
Original:  Here, we introduce a convolutional neural network (CNN ) architecture optimized for classification of brain states from non-invasive magnetoencephalographic (MEG) measurements.
Revised:  Here, we introduce a CNN optimized for classification of brain states from non-invasive magnetoencephalographic (MEG) measurements.
Edit intent: clarity
Original:  Here, we introduce a convolutional neural network (CNN ) architecture optimized for classification of brain states from non-invasive magnetoencephalographic (MEG) measurements.
Revised:  Here, we introduce a convolutional neural network (CNN ) architecture optimized for classification of brain states from magnetoencephalographic (MEG) measurements.
Edit intent: clarity
Original:  The model structure is motivated by a state-of-the-art generative model of the MEG signal and is thus readily interpretable in neurophysiological terms.
Revised:  Our CNN design is based on a generative model of the MEG signal and is thus readily interpretable in neurophysiological terms.
Edit intent: clarity
Original:  We demonstrate that the proposed model is highly accurate in decoding event-related responses as well as modulations of oscillatory brain activity , and is robust with respect to inter-individual differences .
Revised:  We show here that the proposed model is highly accurate in decoding event-related responses as well as modulations of oscillatory brain activity , and is robust with respect to inter-individual differences .
Edit intent: clarity
Original:  We demonstrate that the proposed model is highly accurate in decoding event-related responses as well as modulations of oscillatory brain activity , and is robust with respect to inter-individual differences .
Revised:  We demonstrate that the proposed network is able to decode event-related responses as well as modulations of oscillatory brain activity , and is robust with respect to inter-individual differences .
Edit intent: clarity
Original: We present an implementation of the relational programming language miniKanren as a set of combi- nators and syntax extensions for OCaml.
Revised: We present an implementation of the relational programming language miniKanren as a set of combinators and syntax extensions for OCaml.
Edit intent: fluency
Original:  In addition we provide a useful generic programming pattern to systematically develop relational specifications in a typed manner, and ad- dress the problem of integration of relational subsystems into functional applications.
Revised:  In addition we provide a useful generic programming pattern to systematically develop relational specifications in a typed manner, and address the problem of integration of relational subsystems into functional applications.
Edit intent: fluency
Original: We present a macroscopic portfolio model which considers the time evolution of the stock price and the investments in bonds and stocks .
Revised: We introduce a microscopic model of interacting financial agents, where each agent is characterized by two portfolios; money invested in bonds and stocks .
Edit intent: clarity
Original:  The asset allocation between bonds and stocks is determined by an combination of a fundamentalist or chartist strategy.
Edit intent: coherence
Original:  This allows us to give a precise mathematical definition of rational and bounded rational financial agents.
Revised:  This enables us to derive a precise mathematical definition of rational and bounded rational financial agents.
Edit intent: clarity
Original:  We develop our algorithm using the marginal contribution (MC) cost-sharing scheme and show that it is the only scheme by which the optimum broadcast-tree is always a Nash equilibrium (NE) of the game.
Revised:  We develop our algorithm using the marginal contribution (MC) cost-sharing scheme and show that the optimum broadcast-tree is always a Nash equilibrium (NE) of the game.
Edit intent: clarity
Original:  Decentralized mechanisms are expected to be key in the development of  solutions for next-generation WLANs, since many deployments are characterized by being uncoordinated by nature.
Revised:  Decentralized mechanisms are expected to be key in the development of SR solutions for next-generation WLANs, since many deployments are characterized by being uncoordinated by nature.
Edit intent: fluency
Original:  To shed some light on this subject, we show the main considerations and possibilities of applying online learning in uncoordinated WLANs for the SR problem  .
Revised:  To shed some light on this subject, we show the main considerations and possibilities of applying online learning to address the SR problem .
Edit intent: clarity
Original:  While the former stands for pure individual behavior, the second one aims to consider the performance experienced by surrounding nodes , thus taking into account the impact of individual actions on the environment.
Revised:  While the former stands for pure individual behavior, the second one aims to consider the performance experienced by surrounding networks , thus taking into account the impact of individual actions on the environment.
Edit intent: clarity
Original:  Through these two strategies , we delve into practical issues for enabling MABs usage in wireless networks, such as convergence ensuring or adversarial effects.
Revised:  Through these two strategies we delve into practical issues for enabling MABs usage in wireless networks, such as convergence ensuring or adversarial effects.
Edit intent: fluency
Original:  Through these two strategies , we delve into practical issues for enabling MABs usage in wireless networks, such as convergence ensuring or adversarial effects.
Revised:  Through these two strategies , we delve into practical issues of applying MABs in wireless networks, such as convergence ensuring or adversarial effects.
Edit intent: clarity
Original:  Through these two strategies , we delve into practical issues for enabling MABs usage in wireless networks, such as convergence ensuring or adversarial effects.
Revised:  Through these two strategies , we delve into practical issues for enabling MABs usage in wireless networks, such as convergence guarantees or adversarial effects.
Edit intent: clarity
Original:  In addition, our simulation results illustrate the potential of our proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance are achieved regarding throughput and fairness. t
Revised:  Our simulation results illustrate the potential of our proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance are achieved regarding throughput and fairness. t
Edit intent: coherence
Original:  In addition, our simulation results illustrate the potential of our proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance are achieved regarding throughput and fairness. t
Revised:  In addition, our simulation results illustrate the potential of the proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance are achieved regarding throughput and fairness. t
Edit intent: fluency
Original:  In addition, our simulation results illustrate the potential of our proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance are achieved regarding throughput and fairness. t
Revised:  In addition, our simulation results illustrate the potential of our proposed solutions for enabling SR in future WLANs, showing that substantial improvements on network performance can be achieved regarding throughput and fairness. t
Edit intent: clarity