wanyu/IteraTeR_v2 huggingface dataset:
Original:  There is a similar situation in the distributed setting: While there is an O(\log^2 n)-round LP-based O(\alpha)-approximation algorithms [KMW06 , DKM19 ], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds with high probability .
Revised:  There is a similar situation in the distributed setting: While there is an O(\log^2 n)-round LP-based O(\alpha)-approximation algorithms [KMW06 , DKM19 ], the best non-LP-based algorithm by Lenzen and Wattenhofer [LW10] is an implementation of their centralized algorithm, providing an O(\alpha^2)-approximation within O(\log n) rounds .
Edit intent: clarity
Original:  We address the questions of whether one can achieve an O(\alpha)-approximation algorithm that is elementary, i.e., not based on any LP-based methods , either in the centralized setting or in the distributed setting.
Revised:  We address the questions of whether one can achieve an O(\alpha)-approximation algorithm that is not LP-based methods , either in the centralized setting or in the distributed setting.
Edit intent: clarity
Original:  We address the questions of whether one can achieve an O(\alpha)-approximation algorithm that is elementary, i.e., not based on any LP-based methods , either in the centralized setting or in the distributed setting.
Revised:  We address the questions of whether one can achieve an O(\alpha)-approximation algorithm that is elementary, i.e., not based on any LP-based , either in the centralized setting or in the distributed setting.
Edit intent: clarity
Original:  We resolve both questions in the affirmative, and en route achieve algorithms that are faster than the state-of-the-art LP-based algorithms  : 1. In the centralized setting, we provide a surprisingly simple combinatorial algorithm that is asymptotically optimal in terms of both approximation factor and runtime : an O(\alpha)-approximation in linear time.
Revised:  We resolve both questions in the affirmative, and en route achieve algorithms that are faster than the state-of-the-art LP-based algorithms : 1. In the centralized setting, we provide a surprisingly simple combinatorial algorithm that is asymptotically optimal in terms of both approximation factor and running time : an O(\alpha)-approximation in linear time.
Edit intent: clarity
Original:  The previous best O(\alpha)-approximation algorithms are LP-based and have super-linear running time.
Edit intent: coherence
Original:  2. Based on our centralized algorithm, we design a distributed combinatorial O(\alpha)-approximation algorithm in the \mathsf{CONGEST model that runs in O(\alpha\log n ) rounds with high probability.
Revised:  2. Based on our centralized algorithm, we design a distributed combinatorial O(\alpha)-approximation algorithm in the CONGEST model that runs in O(\alpha\log n ) rounds with high probability.
Edit intent: clarity
Original: Dendric subshifts are defined by combinatorial restrictions of the extensions of the words in its language .
Revised: Dendric shifts are defined by combinatorial restrictions of the extensions of the words in its language .
Edit intent: clarity
Original: Dendric subshifts are defined by combinatorial restrictions of the extensions of the words in its language .
Revised: Dendric subshifts are defined by combinatorial restrictions of the extensions of the words in their languages .
Edit intent: fluency
Original:  This family generalizes well-known families of subshifts such as Sturmian subshifts , Arnoux-Rauzy subshifts and codings of interval exchange transformations.
Revised:  This family generalizes well-known families of shifts such as Sturmian subshifts , Arnoux-Rauzy subshifts and codings of interval exchange transformations.
Edit intent: fluency
Original:  This family generalizes well-known families of subshifts such as Sturmian subshifts , Arnoux-Rauzy subshifts and codings of interval exchange transformations.
Revised:  This family generalizes well-known families of subshifts such as Sturmian shifts , Arnoux-Rauzy subshifts and codings of interval exchange transformations.
Edit intent: fluency
Original:  This family generalizes well-known families of subshifts such as Sturmian subshifts , Arnoux-Rauzy subshifts and codings of interval exchange transformations.
Revised:  This family generalizes well-known families of subshifts such as Sturmian subshifts , Arnoux-Rauzy shifts and codings of interval exchange transformations.
Edit intent: clarity
Original:  It is known that any minimal dendric subshifts has a primitive S-adic representation where the morphisms in S are positive tame automorphisms of the free group generated by the alphabet.
Revised:  It is known that any minimal dendric shift has a primitive S-adic representation where the morphisms in S are positive tame automorphisms of the free group generated by the alphabet.
Edit intent: clarity
Original:  In this paper we investigate those S-adic representations, heading towards an S-adic characterization ot this family.
Revised:  In this paper we investigate those S-adic representations, heading towards an \mathcal{S this family.
Edit intent: clarity
Original:  Being able to control and predict the process of  hybridisation is crucial for the ambitious future of the so-called Hybrid Molecular-Electronic Computing.
Revised:  Being able to control and predict the process of hybridisation is crucial for the ambitious future of Hybrid Molecular-Electronic Computing.
Edit intent: clarity
Original:  In this work, we present the first comprehensive study of machine learning methods applied to the task of predicting DNA hybridisation.
Revised:  We present the first comprehensive study of machine learning methods applied to the task of predicting DNA hybridisation.
Edit intent: clarity
Original:  For this purpose, we introduce a synthetic hybridisation dataset of over 2.5 million data points, enabling the use of a wide range of machine learning algorithms, including the latest in deep learning.
Revised:  For this purpose, we introduce a synthetic hybridisation dataset of over 2.5 million data points, enabling the use of deep learning.
Edit intent: clarity
Original:  Depending on the hardware, the proposed models provide a reduction in inference time ranging from one to over two orders of magnitude compared to the state-of-the-art, while retaining high fidelity.
Revised:  Depending on hardware, we achieve a reduction in inference time ranging from one to over two orders of magnitude compared to the state-of-the-art, while retaining high fidelity.
Edit intent: clarity
Original:  \ Comp. \ '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths.
Revised:  Comp. '02] proves that, in an undirected unweighted graph, any replacement shortest path avoiding a failing edge can be expressed as the concatenation of two original shortest paths.
Edit intent: fluency
Original: Recently, research on explainable recommender systems (RS) has drawn much attention from both academia and industry, resulting in a variety of explainable models.
Revised: Recently, research on explainable recommender systems has drawn much attention from both academia and industry, resulting in a variety of explainable models.
Edit intent: clarity
Original:  Constructing such datasets, however, presents great challenges.
Revised:  Constructing such datasets, however, poses great challenges.
Edit intent: fluency
Original:  First, user-item-explanation  interactions are rare in existing RS , so how to find alternatives becomes a challenge.
Revised:  First, user-item-explanation interactions are rare in existing recommender systems , so how to find alternatives becomes a challenge.
Edit intent: clarity
Original:  Our solution is to identify nearly duplicate or even identical sentences from user reviews.
Revised:  Our solution is to identify nearly identical sentences from user reviews.
Edit intent: clarity
Original:  Moreover, we plan to make our code publicly available , to allow other researchers create their own datasets.
Revised:  Moreover, we make our code publicly available , to allow other researchers create their own datasets.
Edit intent: clarity
Original:  This occurs, in part, because the variance on score-based gradient estimators scales quadratically with the number of targets .
Revised:  This occurs, in part, because the variance on score-based gradient estimators scales quadratically .
Edit intent: clarity
Original:  In this paper, we propose a causal baseline which exploits independence structure encoded in a novel action-target influence network.
Revised:  In this paper, we address this problem through a causal baseline which exploits independence structure encoded in a novel action-target influence network.
Edit intent: clarity
Original:  We provide an analysis of the proposed estimator and identify the conditions under which variance is guaranteed to improve .
Revised:  We provide an analysis of the proposed estimator and identify the conditions under which variance is reduced .
Edit intent: clarity
Original:  The algorithmic aspects of CPGs are also discussed, including optimal policy factorisations, their complexity , and the use of conditioning to efficiently scale to extremely large, concurrent tasks.
Revised:  The algorithmic aspects of CPGs are discussed, including optimal policy factorisations, their complexity , and the use of conditioning to efficiently scale to extremely large, concurrent tasks.
Edit intent: clarity
Original:  In this paper, we address this problem through a causal baseline which exploits independence structure encoded in a novel action-target influence network.
Revised:  In this paper, we address this problem through a factor baseline which exploits independence structure encoded in a novel action-target influence network.
Edit intent: clarity
Original:  Causal policy gradients ( CPGs ), which follow, provide a common framework for analysing key state-of-the-art algorithms, are shown to generalise traditional policy gradients, and yield a principled way of incorporating prior knowledge of a problem domain's generative processes.
Revised:  Factored policy gradients ( CPGs ), which follow, provide a common framework for analysing key state-of-the-art algorithms, are shown to generalise traditional policy gradients, and yield a principled way of incorporating prior knowledge of a problem domain's generative processes.
Edit intent: clarity
Original:  Finally, we demonstrate the performance advantages of our algorithm on large-scale bandit and traffic intersection problems, providing a novel contribution to the latter in the form of a spatio-causal approximation.
Revised:  Finally, we demonstrate the performance advantages of our algorithm on large-scale bandit and traffic intersection problems, providing a novel contribution to the latter in the form of a spatial approximation.
Edit intent: clarity
Original:  Here, we introduce and demonstrate both optical synapse weighting and all-optical nonlinear thresholding using two different effects in one single chalcogenide material .
Revised:  Here, we introduce and demonstrate both optical synapse weighting and all-optical nonlinear thresholding using two different effects in a chalcogenide material photonic platform .
Edit intent: clarity
Original:  We designed a novel self-resurrecting encoder-decoder attention mechanism to quickly adapt the pretrained LM as the language decoder on a small amount of in-domain training data.
Revised:  We designed a novel self-resurrecting encoder-decoder attention mechanism to quickly adapt the pretrained LM as the language decoder ona small amount of in-domain training data.
Edit intent: fluency
Original:  The pro-posed self-resurrecting activation unit produces sparse activations but is not susceptible to zero gradients.
Revised:  The proposed self-resurrecting activation unit produces sparse activations but is not susceptible to zero gradients.
Edit intent: fluency
Original:  The pro-posed self-resurrecting activation unit produces sparse activations but is not susceptible to zero gradients.
Revised:  The pro-posed self-resurrecting activation unit produces sparse activations but has reduced susceptibility to zero gradients.
Edit intent: clarity
Original:  Our results provide a rigorous and tractable framework to describe pathogen-host co-evolution.
Revised:  Our results provide a concrete and tractable framework to describe pathogen-host co-evolution.
Edit intent: clarity
Original:  Intriguingly, only a few iterations seem to be required to already achieve complex objects .
Revised:  Most intriguingly, this seems to be an ongoing and thus open-ended process to create novelty with increasing complexity .
Edit intent: coherence
Original:  In the present paper  we want to employ combinatorial evolution in software development.
Revised:  In the present paper , we want to employ combinatorial evolution in software development.
Edit intent: fluency
Original:  We implemented a computer program simulating combinatorial evolution of code blocks stored in a database to make them available for combinations .
Revised:  We implemented a computer program simulating combinatorial evolution of code blocks stored in a database to make them available for combining .
Edit intent: fluency
Original: It has been already shown that combinatorial evolution - the creation of new things through the combination of existing things - can be a powerful way to evolve rather than design technical objects such as electronic circuits in a computer simulation.
Revised: Combinatorial evolution - the creation of new things through the combination of existing things - can be a powerful way to evolve rather than design technical objects such as electronic circuits in a computer simulation.
Edit intent: coherence
Original:  Most intriguingly , this seems to be an ongoing and thus open-ended process to create novelty with increasing complexity.
Revised:  Most intriguingly , this seems to be an ongoing and thus open-ended process creating novelty with increasing complexity.
Edit intent: fluency
Original:  In the present paper, we want to employ combinatorial evolution in software development.
Revised:  Here, we employ combinatorial evolution in software development.
Edit intent: coherence
Original:  Here, we implemented a computer program simulating combinatorial evolution of code blocks stored in a database to make them available for combining.
Revised:  We implemented a computer program simulating combinatorial evolution of code blocks stored in a database to make them available for combining.
Edit intent: coherence
Original:  We found that reserved key words of a programming language are suitable for defining the basic code blocks at the beginning of the simulation.
Revised:  We found that reserved keywords of a programming language are suitable for defining the basic code blocks at the beginning of the simulation.
Edit intent: fluency
Original:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and to classes containing methods and variable declarations.
Revised:  As in a previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and to classes containing methods and variable declarations.
Edit intent: fluency
Original:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and to classes containing methods and variable declarations.
Revised:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, class definitions, to methods, and to classes containing methods and variable declarations.
Edit intent: fluency
Original:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and to classes containing methods and variable declarations.
Revised:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, methods, and to classes containing methods and variable declarations.
Edit intent: clarity
Original:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and to classes containing methods and variable declarations.
Revised:  As in the previous combinatorial evolution simulation of electronic circuits, complexity increased from simple keywords and special characters to more complex variable declarations, to class definitions, to methods, and classes containing methods and variable declarations.
Edit intent: fluency
Original: We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over any large enough finite field  .
Revised: We prove that the partition rank and the analytic rank of tensors are equivalent up to a constant, over any large enough finite field .
Edit intent: clarity
Original:  This largely settles the main question in the "bias implies low rank" line of work in higher-order Fourier analysis, which was reiterated by Kazhdan and Ziegler, Lovett, and others .
Revised:  This largely settles the main question in the "bias implies low rank" line of work in higher-order Fourier analysis, and was reiterated by Kazhdan and Ziegler, Lovett, and others .
Edit intent: coherence
Original:  This largely settles the main question in the "bias implies low rank" line of work in higher-order Fourier analysis, which was reiterated by Kazhdan and Ziegler, Lovett, and others .
Revised:  This largely settles the main question in the "bias implies low rank" line of work in higher-order Fourier analysis, which was reiterated by multiple authors .
Edit intent: clarity
Original: We prove that the partition rank and the analytic rank of tensors are equivalent up to a constant, over any large enough finite field ( independently of the number of variables ) .
Revised: We prove that the partition rank and the analytic rank of tensors are equal up to a constant, over any large enough finite field ( independently of the number of variables ) .
Edit intent: clarity
Original:  The proof constructs rational maps computing a partition rank decomposition for successive derivatives of the tensor, on a carefully chosen subset of the kernel varietyassociated with the tensor.
Edit intent: coherence
Original:  Proving the equivalence between these two quantities is the main question in the "bias implies low rank" line of work in higher-order Fourier analysis , and was reiterated by multiple authors  .
Revised:  Proving the equivalence between these two ranks is a central question in additive combinatorics , and was reiterated by multiple authors .
Edit intent: clarity
Original: Influencing (and being influenced by) others indirectly through social networks is fundamental to all human societies.
Revised: Influencing (and being influenced by) others through social networks is fundamental to all human societies.
Edit intent: clarity
Original:  Whether this happens through the diffusion of rumors, viruses, opinions, or know-how, finding the source is of persistent interest to people and an algorithmic challenge of much current research interest.
Revised:  Whether this happens through the diffusion of rumors, opinions, or know-how, finding the source is of persistent interest to people and an algorithmic challenge of much current research interest.
Edit intent: fluency
Original:  Whether this happens through the diffusion of rumors, viruses, opinions, or know-how, finding the source is of persistent interest to people and an algorithmic challenge of much current research interest.
Revised:  Whether this happens through the diffusion of rumors, viruses, opinions, or viruses, identifying the diffusion source (i.e., the person that initiated it) is a problem that has attracted much research interest.
Edit intent: clarity
Original:  We close this gap by separating two mechanisms hiding diffusion sources-one stemming from the network topology itself and the other from strategic manipulation of the network .
Revised:  We close this gap by evaluating two mechanisms that hide the source-one stemming from the network topology itself and the other from strategic manipulation of the network .
Edit intent: clarity
Original:  We close this gap by separating two mechanisms hiding diffusion sources-one stemming from the network topology itself and the other from strategic manipulation of the network .
Revised:  We close this gap by separating two mechanisms hiding diffusion sources-one stemming from the source's actions, the other from strategic manipulation of the network .
Edit intent: clarity
Original:  We show that hiding connections that were part of the viral cascade is far more effective than introducing fake individuals .
Revised:  We show that hiding connections that were part of the viral cascade is far more effective than introducing fake nodes .
Edit intent: clarity
Original:  Thus, efforts should focus on exposing concealed ties rather than planted fake entities, e.g., bots in social media ;
Revised:  Thus, efforts should focus on exposing concealed ties rather than planted entities ;
Edit intent: clarity
Original:  such exposure would drastically improve our chances of detecting the source of a social diffusion .
Revised:  such exposure would drastically improve our chances of detecting the diffusion source .
Edit intent: clarity
Original:   To accomplish this, the model is based on three projection algorithms allowing to partially replicate the processes' global execution states at a given moment, to consistently update the obtained partial states and to deduce new coherent global states.
Revised:  To accomplish this, the model rely on three projection algorithms allowing to partially replicate the processes' global execution states at a given moment, to consistently update the obtained partial states and to deduce new coherent global states.
Edit intent: clarity
Original: We present convergence rates of operator learning in [Chen and Chen 1995] and [Lu et al. 2020] when the operators are solution operators of differential equations.
Revised: We present convergence analysis of operator learning in [Chen and Chen 1995] and [Lu et al. 2020] when the operators are solution operators of differential equations.
Edit intent: clarity
Original:  The early methods simply treat all the historical items equally and recent ones distinguish the different importance of items for a prediction .
Revised:  The early methods simply treat all the historical items equally and recently proposed methods attempt to distinguish the different importance of items for a prediction .
Edit intent: clarity
Original:  The early methods simply treat all the historical items equally and recent ones distinguish the different importance of items for a prediction .
Revised:  The early methods simply treat all the historical items equally and recent ones distinguish the different importance of historical items when recommending a target item .
Edit intent: clarity
Original:  As a result, they fail to estimate the item similarity on a finer-grained level to predict the user's preference for an item, resulting in sub-optimal recommendation.
Revised:  As a result, they fail to estimate the item similarity on a finer-grained level to predict the user's preference to an item, resulting in sub-optimal recommendation.
Edit intent: fluency