wanyu/IteraTeR_v2 huggingface dataset:
Original:  By contrast, we prove that computing an allocation satisfying envy-freeness and another of its relaxations, envy-freeness up to any good (EFX), requires a linear number of queries even when there are only two agents with identical additive valuations .
Revised:  By contrast, we prove that computing an allocation satisfying envy-freeness and another of its relaxations, envy-freeness up to any good (EFX), requires a linear number of queries even when there are only two agents with identical additive utilities .
Edit intent: clarity
Original: Political and social polarization are a significant cause of conflict and poor governance in many societies , thus understanding their causes is of considerable importance .
Revised: Social and political polarization is a significant source of conflict and poor governance in many societies , thus understanding their causes is of considerable importance .
Edit intent: clarity
Original: Political and social polarization are a significant cause of conflict and poor governance in many societies , thus understanding their causes is of considerable importance .
Revised: Political and social polarization are a significant cause of conflict and poor governance in many societies . Thus, understanding its causes has become a priority of scholars across many disciplines .
Edit intent: clarity
Original:  Here we demonstrate that shifts in socialization strategy similar to political polarization and /or identity politics could be a constructive response to periods of apparent economic decline.
Revised:  Here we demonstrate that shifts in socialization strategies analogous to political polarization and /or identity politics could be a constructive response to periods of apparent economic decline.
Edit intent: fluency
Original:  We show that even where in an expanding economy, interacting with diverse out-groups can afford benefits through innovation and exploration , if that economy contracts, a strategy of seeking homogeneous groups can be important to maintaining individual solvency.
Revised:  We show that even where in an expanding economy, interacting with diverse out-groups confers benefits from innovation and exploration , if that economy contracts, a strategy of seeking homogeneous groups can be important to maintaining individual solvency.
Edit intent: clarity
Original:  We show that even where in an expanding economy, interacting with diverse out-groups can afford benefits through innovation and exploration , if that economy contracts, a strategy of seeking homogeneous groups can be important to maintaining individual solvency.
Revised:  We show that even where in an expanding economy, interacting with diverse out-groups can afford benefits through innovation and exploration , if that economy contracts, a strategy of seeking low-risk interactions can be important to maintaining individual solvency.
Edit intent: clarity
Original:  This is true even where the expected value of out group interaction exceeds that of in group interactions .
Revised:  To capture this dynamic, we assume that in-group interactions have a lower expected outcome, but a more certain one. Thus in-group interactions are less risky than out-group interactions .
Edit intent: coherence
Original:  Our account unifies what were previously seen as conflicting explanations: identity threat versus economic anxiety.
Edit intent: coherence
Original:  The network is trained using synthetic data, generated using a dynamic model proposed by McSharry et al. as well as real data from Physionet PDB database of ECG signals.
Revised:  The network is trained using synthetic data, generated by dynamic model ECG and fine-tuned with a real data from Physionet PDB database of ECG signals.
Edit intent: clarity
Original:  Our findings show that networks trained with more synthetic data have better results than trained with more real data .
Revised:  Our results show that networks trained with more synthetic data have better results than trained with more real data .
Edit intent: clarity
Original:  The network is pretrained using synthetic data, generated by dynamic model ECG and fine-tuned with a real data from Physionet PDB database of ECG signals.
Revised:  The network is pretrained using synthetic data, generated by a dynamic ECG model, and fine-tuning it with a real data from Physionet PDB database of ECG signals.
Edit intent: clarity
Original:  We also investigate the impact of synthetic data on the network performance on real signals.
Revised:  We also investigate the impact of the synthetic training data on the network performance on real signals.
Edit intent: clarity
Original:  Our results show that networks pretrained with synthetic data  have better results than network trained with real data only , regardless of the training set size.
Revised:  Our results show that networks pretrained with synthetic data seem to have better results than network trained with real data only , regardless of the training set size.
Edit intent: clarity
Original:  The algorithm actually solves its counting version modulo prime p>t, by manipulating generating functions using FFT .
Revised:  Our new algorithm actually solves its counting version modulo prime p>t, by manipulating generating functions using FFT .
Edit intent: clarity
Original: Given a multiset  of n positive integers and a target integer t, the Subset Sum problem asks to determine whether there exists a subset of S that sums up to t.
Revised: Given a multiset S of n positive integers and a target integer t, the Subset Sum problem asks to determine whether there exists a subset of S that sums up to t.
Edit intent: fluency
Original:  A decode-and- forward incremental relaying (IR) protocol is then introduced to improve reliability and security of communications in the presence of the active eavesdropper.
Revised:  A decode-and-forward incremental relaying (IR) protocol is then introduced to improve reliability and security of communications in the presence of the active eavesdropper.
Edit intent: fluency
Original:  Gene expression shows distinct regularity pattern in different tissues.
Revised:  Gene expression shows a distinct regulatory pattern in different tissues.
Edit intent: clarity
Original:  Furthermore, mechanistic understanding of gene regularity pattern can be provided through studying the underlying relationships as a complex network.
Revised:  Furthermore, mechanistic understanding of gene regulatory pattern can be provided through studying the underlying relationships as a complex network.
Edit intent: clarity
Original:  In addition, we generated novel hypotheses including genes as causes of the Schizophrenia associated genes and new genes associated with Schizophrenia.
Revised:  In addition, we generated novel hypotheses including genes as causes of the schizophrenia-associated genes and new genes associated with Schizophrenia.
Edit intent: fluency
Original:  It requires a carefu l adaptation of the technique of Cole et al.
Revised:  It requires a careful adaptation of the technique of Cole et al.
Edit intent: fluency
Original:  ~ [STOC 2004] to avoid multiple counting of pairs of substrings.
Revised:  [STOC 2004] to avoid multiple counting of pairs of substrings.
Edit intent: coherence
Original: For Labouch\`ere system with winning probability p at each coup, we prove that the expectation of the largest betting size under any initial list is finite if p>1{2}, and is infinite if p\le 1{2}, solving the open conjecture in \mbox{ grimmett2001one .
Revised: For Labouchere system with winning probability p at each coup, we prove that the expectation of the largest betting size under any initial list is finite if p>1{2}, and is infinite if p\le 1{2}, solving the open conjecture in \mbox{ grimmett2001one .
Edit intent: fluency
Original: For Labouch\`ere system with winning probability p at each coup, we prove that the expectation of the largest betting size under any initial list is finite if p>1{2}, and is infinite if p\le 1{2}, solving the open conjecture in \mbox{ grimmett2001one .
Revised: For Labouch\`ere system with winning probability p at each coup, we prove that the expectation of the largest bet size under any initial list is finite if p>1{2}, and is infinite if p\le 1{2}, solving the open conjecture in \mbox{ grimmett2001one .
Edit intent: fluency
Original:  As a corollary, a polynomial algorithm for computing |G : H| for a finite permutation group G is suggested.
Revised:  As a corollary, a polynomial algorithm for computing |G : H| for a permutation group G is suggested.
Edit intent: clarity
Original:  Coherent parallelisation also has important theoretical consequences  for both quantum physics and the theory of algorithmic complexity and computability .
Revised:  We present important theoretical consequences for both quantum physics and the theory of algorithmic complexity and computability .
Edit intent: clarity
Original:  In this paper, its presented a Deep Learning architecture for Session-Based recommendations of News articles .
Revised:  In this paper, its presented a Deep Learning Meta-Architecture for News Recommender Systems .
Edit intent: clarity
Original:  The recommendation task addressed in this work is next-item prediction for user sessions: "what is the next most likely article a user might read in a session?"
Revised:  The recommendation task addressed in this work is next-item prediction for users sessions: "what is the next most likely article a user might read in a session?"
Edit intent: fluency
Original:  User session context is leveraged by the architecture to provide additional information in such extreme cold-start scenario of news recommendation.
Revised:  Users sessions context is leveraged by the architecture to provide additional information in such extreme cold-start scenario of news recommendation.
Edit intent: fluency
Original: Collaborative filtering based recommender systems have been extremely successful in settings where user preference data on items is abundant.
Revised: Collaborative filtering based recommender systems have proven to be extremely successful in settings where user preference data on items is abundant.
Edit intent: clarity
Original:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain when items mostly belong to the same category and are mostly alike (e.g.  television series episodes).
Revised:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain for items that mostly belong to the same category and are mostly alike (e.g. television series episodes).
Edit intent: clarity
Original:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain when items mostly belong to the same category and are mostly alike (e.g.  television series episodes).
Revised:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain when items mostly belong to the same category (e.g. television series episodes).
Edit intent: coherence
Original:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain when items mostly belong to the same category and are mostly alike (e.g.  television series episodes).
Revised:  While ontology-based approaches address the shortcomings of their collaborative filtering counterparts, ontological organizations of items can be difficult to obtain when items mostly belong to the same category and are mostly alike (e.g. , television series episodes).
Edit intent: fluency
Original:  As  study case, we evaluated the proposed method against other approaches by performing the classical rating prediction task on a collection of Star Trek television series episodes in an item cold-start scenario.
Revised:  As a study case, we evaluated the proposed method against other approaches by performing the classical rating prediction task on a collection of Star Trek television series episodes in an item cold-start scenario.
Edit intent: fluency
Original:  We observed that our proposed method showed to be a convenient alternative to collaborative filtering approaches for collections of mostly similar items, particularly when other content-based approaches are not applicable or otherwise unavailable.
Revised:  We found our proposed method showed to be a convenient alternative to collaborative filtering approaches for collections of mostly similar items, particularly when other content-based approaches are not applicable or otherwise unavailable.
Edit intent: clarity
Original:  We observed that our proposed method showed to be a convenient alternative to collaborative filtering approaches for collections of mostly similar items, particularly when other content-based approaches are not applicable or otherwise unavailable.
Revised:  We observed that our proposed method to be a convenient alternative to collaborative filtering approaches for collections of mostly similar items, particularly when other content-based approaches are not applicable or otherwise unavailable.
Edit intent: clarity
Original: Neural architecture search (NAS) is an important  task in network design , but it remains challenging due to high computational consumption in most methods and low stability in evolution algorithm (EA) based NAS.
Revised: Neural architecture search (NAS) is an important yet challenging task in network design , but it remains challenging due to high computational consumption in most methods and low stability in evolution algorithm (EA) based NAS.
Edit intent: clarity
Original: Neural architecture search (NAS) is an important  task in network design , but it remains challenging due to high computational consumption in most methods and low stability in evolution algorithm (EA) based NAS.
Revised: Neural architecture search (NAS) is an important task in network design due to its high computational consumption in most methods and low stability in evolution algorithm (EA) based NAS.
Edit intent: clarity
Original: Neural architecture search (NAS) is an important  task in network design , but it remains challenging due to high computational consumption in most methods and low stability in evolution algorithm (EA) based NAS.
Revised: Neural architecture search (NAS) is an important task in network design , but it remains challenging due to high computational consumption and low stability in evolution algorithm (EA) based NAS.
Edit intent: clarity
Original:  In this paper , we propose the Reinforced Evolutionary Neural Architecture Search (RENAS),  an evolutionary method with reinforced mutation for NAS to address these two issues.
Revised:  In this paper , we propose the Reinforced Evolutionary Neural Architecture Search (RENAS), which is an evolutionary method with reinforced mutation for NAS to address these two issues.
Edit intent: coherence
Original: Neural architecture search (NAS) is an important yet challenging task in network design due to its high computational consumption and low stability .
Revised: Neural Architecture Search (NAS) is an important yet challenging task in network design due to its high computational consumption and low stability .
Edit intent: fluency
Original: Neural architecture search (NAS) is an important yet challenging task in network design due to its high computational consumption and low stability .
Revised: Neural architecture search (NAS) is an important yet challenging task in network design due to its high computational consumption .
Edit intent: clarity
Original:  To address these two issues , we propose the Reinforced Evolutionary Neural Architecture Search ( RENAS ), which is an evolutionary method with  reinforced mutation for NAS.
Revised:  To address this issue , we propose the Reinforced Evolutionary Neural Architecture Search ( RENAS ), which is an evolutionary method with reinforced mutation for NAS.
Edit intent: coherence
Original:  To address these two issues , we propose the Reinforced Evolutionary Neural Architecture Search ( RENAS ), which is an evolutionary method with  reinforced mutation for NAS.
Revised:  To address these two issues , we propose the Reinforced Evolutionary Neural Architecture Search ( RENAS ), which is an evolutionary method with the reinforced mutation for NAS.
Edit intent: fluency
Original:  Our method integrates reinforced mutation into an evolution algorithm for neural architecture exploration, in which a mutation controller  to learn the effects of slight modifications and make mutation actions.
Revised:  Our method integrates reinforced mutation into an evolution algorithm for neural architecture exploration, in which a mutation controller is introduced to learn the effects of slight modifications and make mutation actions.
Edit intent: clarity
Original:  The reinforced mutation controller instructs the model population to evolve efficiently in a suitable direction .
Revised:  The reinforced mutation controller guides the model population to evolve efficiently in a suitable direction .
Edit intent: clarity
Original:  The reinforced mutation controller instructs the model population to evolve efficiently in a suitable direction .
Revised:  The reinforced mutation controller instructs the model population to evolve efficiently .
Edit intent: clarity
Original:  We conduct the proposed search method on CIFAR-10 with 4 GPUs (Titan Xp) across 1.5 days and discover a powerful network architecture  .
Revised:  In experiments, we conduct the proposed search method on CIFAR-10 with 4 GPUs (Titan Xp) across 1.5 days and discover a powerful network architecture .
Edit intent: coherence
Original:  We conduct the proposed search method on CIFAR-10 with 4 GPUs (Titan Xp) across 1.5 days and discover a powerful network architecture  .
Revised:  We conduct the proposed search method on CIFAR-10 and obtain a powerful network architecture .
Edit intent: clarity
Original:  We further apply the explored network architecture to the mobile setting ImageNet .
Revised:  The explored network architecture to the mobile setting ImageNet .
Edit intent: clarity
Original:  However, the ever-growing size of programs and their continuous evolution require building fast and efficient analyzers . A promising solution is incrementality, so one only re-types those parts of the program that are new or changed , rather than the entire codebase.
Revised:  However, the ever-growing size of programs and their continuous evolution require building fast and efficient analysers . A promising solution is incrementality, so one only re-types those parts of the program that are new or changed , rather than the entire codebase.
Edit intent: fluency
Original:  However, the ever-growing size of programs and their continuous evolution require building fast and efficient analyzers . A promising solution is incrementality, so one only re-types those parts of the program that are new or changed , rather than the entire codebase.
Revised:  However, the ever-growing size of programs and their continuous evolution require building fast and efficient analyzers . A promising solution is incrementality, so one only re-types those parts of the program that are new , rather than the entire codebase.
Edit intent: clarity
Original:  We propose an algorithmic schema driving the definition of an incremental typing algorithm that exploits with no changes to the existing, standard ones  .
Revised:  We propose an algorithmic schema driving the definition of an incremental typing algorithm that exploits the existing, standard ones .
Edit intent: clarity
Original:  A prototypical implementation of an incremental type checker is available on the web .
Revised:  A prototypical implementation of an incremental type checker . Our experiments show that using the type checker incrementally is (almost) always rewarding .
Edit intent: coherence
Original: We develop the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders.
Revised: We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders.
Edit intent: clarity
Original:  There are many error correcting code constructions that achieve ]  large distance by starting with a base code C with moderate distance, and then amplifying the distance using a sampler , e. g., the ABNNR code construction IEEE Trans.
Revised:  There are many error correcting code constructions that achieve ] achieves large distance by starting with a base code C with moderate distance, and then amplifying the distance using a sampler , e. g., the ABNNR code construction IEEE Trans.
Edit intent: fluency
Original:  There are many error correcting code constructions that achieve ]  large distance by starting with a base code C with moderate distance, and then amplifying the distance using a sampler , e. g., the ABNNR code construction IEEE Trans.
Revised:  There are many error correcting code constructions that achieve ] large distance by starting with a base code C with moderate distance, and then amplifying the distance using a sampler IEEE Trans.
Edit intent: coherence
Original:  Another type of problem has to do with a sequence of messages handled by the (transmission) server wherein each message obsoletes all previous ones .
Revised:  Another type of problem has to do with a sequence of messages handled by the (transmission) server wherein each message obsoletes all previous messages .
Edit intent: clarity
Original:  We propose an initialization procedure derived from the Haar measure over unitary matrices that overcomes this limitation .
Revised:  To overcome this limitation, we propose an initialization procedure derived from the Haar measure over unitary matrices that overcomes this limitation .
Edit intent: fluency
Original:  We propose an initialization procedure derived from the Haar measure over unitary matrices that overcomes this limitation .
Revised:  We propose an initialization procedure derived from the Haar measure of the unitary group .
Edit intent: clarity
Original: Universal unitary photonic devices are capable of applying arbitrary unitary transformations to multi-port coherent light inputs and provide a promising hardware platform for fast and energy-efficient machine learning .
Revised: Universal unitary photonic devices can apply arbitrary unitary transformations to multi-port coherent light inputs and provide a promising hardware platform for fast and energy-efficient machine learning .
Edit intent: clarity
Original: Universal unitary photonic devices are capable of applying arbitrary unitary transformations to multi-port coherent light inputs and provide a promising hardware platform for fast and energy-efficient machine learning .
Revised: Universal unitary photonic devices are capable of applying arbitrary unitary transformations to a vector of input modes and provide a promising hardware platform for fast and energy-efficient machine learning .
Edit intent: clarity
Original:  In conclusion  we forecast that quantum supremacy will not be possible for gate-depths of less than 100 on systems of 80 to 150 qubits .
Revised:  In conclusion , we forecast that quantum supremacy will not be possible for gate-depths of less than 100 on systems of 80 to 150 qubits .
Edit intent: fluency
Original:  These findings are just above the entanglement interval lower-bound that we derived in the study.
Revised:  These findings are just above the entanglement interval lower-bound derived in the study.
Edit intent: clarity
Original:  These bounds make explicit a nuance implicit in other proposals with critical physical consequence.
Revised:  These bounds make explicit a nuance implicit in other proposals with physical consequence.
Edit intent: clarity