wanyu/IteraTeR_v2 huggingface dataset:
Original: This study discusses choice behavior using a voting model in which voters can obtain information from a finite number r of previous voters.
Revised: This study discusses choice behavior using a voting model in which voters can obtain information from a finite number of previous r voters.
Edit intent: fluency
Original:  We obtain  Pitman sampling formula as the equilibrium distribution of r votes.
Revised:  We obtain the Pitman sampling formula as the equilibrium distribution of r votes.
Edit intent: fluency
Original:  We present the model as a process of making posts on a bulletin board system, 2ch.net, where users can choose one of many threads to create a post.
Revised:  We present the model as a process of posting on a bulletin board system, 2ch.net, where users can choose one of many threads to create a post.
Edit intent: clarity
Original:  We explore how this choice depends on the last r posts and the distribution of  r posts across threads.
Revised:  We explore how this choice depends on the last r posts and the distribution of these last r posts across threads.
Edit intent: clarity
Original:  We conclude that the posting process is described by our voting model  for a small r, which might correspond to the time horizon of users' response .
Revised:  We conclude that the posting process is described by our voting model for a small r, which might correspond to the time horizon of users' responses .
Edit intent: fluency
Original:  Finally , we determine that the smallest regular triangle-free 5-chromatic graphs have 24  vertices.
Revised:  Next to that , we determine that the smallest regular triangle-free 5-chromatic graphs have 24 vertices.
Edit intent: coherence
Original:  We also determine the complete set of all triangle-free 5-chromatic graphs up to 23 vertices and all triangle-free 5-chromatic graphs on 24 vertices with maximum degree at most 7.
Revised:  We also determine the complete set of all triangle-free 5-chromatic graphs up to 24 vertices with maximum degree at most 7.
Edit intent: coherence
Original:  These results suggests that curbing social bots may be an effective strategy for mitigating the spread of online misinformation.
Revised:  These results suggest that curbing social bots may be an effective strategy for mitigating the spread of online misinformation.
Edit intent: fluency
Original:  Communication, cognitive, social, and computer scientists are engaged in efforts to study the complex causes for the viral diffusion of digital misinformation and to develop solutions, while search and social media platforms are beginning to deploy countermeasures.
Revised:  Communication, cognitive, social, and computer scientists are engaged in efforts to study the complex causes for the viral diffusion of misinformation online and to develop solutions, while search and social media platforms are beginning to deploy countermeasures.
Edit intent: clarity
Original:  Automated accounts are particularly active in the early spreading phases of viral claims, and tend to target influential users . Humans are vulnerable to this manipulation, retweeting bots who post false news . Successful sources of false and biased claims are heavily supported by social bots.
Revised:  Automated accounts are particularly active in the early spreading phases of viral claims, and tend to target influential users . Humans are vulnerable to this manipulation, retweeting bots who post misinformation . Successful sources of false and biased claims are heavily supported by social bots.
Edit intent: clarity
Original:  Automated accounts are particularly active in the early spreading phases of viral claims, and tend to target influential users . Humans are vulnerable to this manipulation, retweeting bots who post false news . Successful sources of false and biased claims are heavily supported by social bots.
Revised:  Automated accounts are particularly active in the early spreading phases of viral claims, and tend to target influential users . Humans are vulnerable to this manipulation, retweeting bots who post false news . Successful sources of false and misleading claims are heavily supported by social bots.
Edit intent: clarity
Original:  However, to date, these efforts have been mainly informed by anecdotal evidence rather than systematic data.
Revised:  With few exceptions, these efforts have been mainly informed by anecdotal evidence rather than systematic data.
Edit intent: clarity
Original:  We find evidence that social bots play a disproportionate role in spreading and repeating misinformation.
Revised:  We find evidence that social bots played a disproportionate role in spreading and repeating misinformation.
Edit intent: fluency
Original:  Automated accounts are particularly active in amplifying misinformation in the very early spreading moments, before a claim goes viral.
Revised:  Automated accounts are particularly active in amplifying content in the very early spreading moments, before a claim goes viral.
Edit intent: clarity
Original:  Automated accounts are particularly active in amplifying misinformation in the very early spreading moments, before a claim goes viral.
Revised:  Automated accounts are particularly active in amplifying misinformation in the very early spreading moments, before an article goes viral.
Edit intent: clarity
Original:  Bots  target users with many followers through replies and mentions , and may disguise their geographic locations .
Revised:  Bots also target users with many followers through replies and mentions , and may disguise their geographic locations .
Edit intent: clarity
Original:  Bots  target users with many followers through replies and mentions , and may disguise their geographic locations .
Revised:  Bots target users with many followers through replies and mentions .
Edit intent: clarity
Original:  We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites.
Revised:  We determine closed-form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites.
Edit intent: fluency
Original:  We determine closed form expressions for the Euclidean distance degree of the steady state varieties associated to several different families of toric chemical reaction networks with arbitrarily many reaction sites.
Revised:  We determine closed form expressions for the Euclidean distance degree of the steady states of several families of chemical reaction networks with arbitrarily many reaction sites.
Edit intent: clarity
Original:  We show how our results can be used as a metric for the computational cost of solving the model testing and model selection problems.
Revised:  We show how our results can be used as a tool for estimating the computational cost of solving the model testing and model selection problems.
Edit intent: clarity
Original:  They are often used to answer speci c questions a user might have and to discover more about a topic of interest.
Revised:  They are often used to answer specific questions a user might have and to discover more about a topic of interest.
Edit intent: clarity
Original:  Discussions in these forums may evolve in intricate ways, making it di cult for users to follow the ow of ideas.
Revised:  Discussions in these forums may evolve in intricate ways, making it difficult for users to follow the ow of ideas.
Edit intent: fluency
Original:  Discussions in these forums may evolve in intricate ways, making it di cult for users to follow the ow of ideas.
Revised:  Discussions in these forums may evolve in intricate ways, making it di cult for users to follow the flow of ideas.
Edit intent: fluency
Original:  We propose a novel approach for auto- matically identifying the underlying thread structure of a forum discussion.
Revised:  We propose a novel approach for automatically identifying the underlying thread structure of a forum discussion.
Edit intent: clarity
Original:  Preliminary experi- ments demonstrate promising results outperforming a number of strong baseline methods.
Revised:  Preliminary experiments demonstrate promising results outperforming a number of strong baseline methods.
Edit intent: fluency
Original:  Specifically, we presentHyperQA , a parameter efficient neural network model that outperforms several parameter heavy models such as Attentive Pooling BiLSTMs and Multi Perspective CNN on multiple standard benchmark datasets such as TrecQA, WikiQA and YahooQA.
Revised:  Specifically, we present , a parameter efficient neural network model that outperforms several parameter heavy models such as Attentive Pooling BiLSTMs and Multi Perspective CNN on multiple standard benchmark datasets such as TrecQA, WikiQA and YahooQA.
Edit intent: clarity
Original: Many state-of-the-art deep learning models for question answer retrieval are highly complex, often having a huge number of parameters or complicated word interaction mechanisms.
Revised: The dominant neural architectures in question answer retrieval are highly complex, often having a huge number of parameters or complicated word interaction mechanisms.
Edit intent: clarity
Original:  This paper studies if it is possible to achieve equally competitive performance with smaller and faster neural architectures.
Revised:  This paper studies if it is possible to achieve competitive performance with smaller and faster neural architectures.
Edit intent: clarity
Original:  Overall , our proposed approach is a simple neural network that performs question-answer matching and ranking in Hyperbolic space.
Revised:  Overall , our proposed model, neural network that performs question-answer matching and ranking in Hyperbolic space.
Edit intent: clarity
Original:  In this paper, we propose a novel lossy compression scheme for time series.
Revised:  In this paper, we propose a novel compression scheme for time series.
Edit intent: clarity
Original:  The Joint Video Team (JVT) developed H.264/MVC to enhance the compression efficiency for multiview video, however, MVC encoded multiview video (MVC video) still requires the high bitrates for transmission.
Revised:  The Joint Video Team (JVT) developed H.264/MVC to enhance the compression efficiency for multiview video, however, MVC encoded multiview video (MVC video) still requires high bitrates for transmission.
Edit intent: clarity
Original: A key challenge for manipulation in unstructured environments is action selection .
Revised: Learning to act in unstructured environments is action selection .
Edit intent: clarity
Original: A key challenge for manipulation in unstructured environments is action selection .
Revised: A key challenge for manipulation in unstructured environments , such as cluttered piles of objects, poses a substantial challenge for manipulation robots .
Edit intent: clarity
Original:  Our network is trained from data collected through large-scale interaction of a PR2 robot with randomly organized tabletop scenes.
Revised:  Our network is trained from data collected through autonomous interaction of a PR2 robot with randomly organized tabletop scenes.
Edit intent: clarity
Original:  The model is designed to propose meaningful push actions based on segmented RGB-D images.
Revised:  The model is designed to propose meaningful push actions based on over-segmented RGB-D images.
Edit intent: clarity
Original:  Highlights of our experiments can be viewed in the following video: URL.
Revised:  Videos of our experiments can be viewed in the following video: URL.
Edit intent: fluency
Original:  Highlights of our experiments can be viewed in the following video: URL.
Revised:  Highlights of our experiments can be viewed at URL
Edit intent: clarity
Original: The halting probability of a Turing machine was introduced by Chaitin who also proved that it is an algorithmically random real number and named it Omega.
Revised: The halting probability of a Turing machine ,also known as Chaitin's Omega, is an algorithmically random real number and named it Omega.
Edit intent: clarity
Original:  Since his seminal work, many popular expositions have appeared  mainly focusing on the metamathematical or philosophical significance of this number (or debating against it).
Revised:  Since his seminal work, many popular expositions have appeared , mainly focusing on the metamathematical or philosophical significance of this number (or debating against it).
Edit intent: fluency
Original:  Since his seminal work, many popular expositions have appeared  mainly focusing on the metamathematical or philosophical significance of this number (or debating against it).
Revised:  Since his seminal work, many popular expositions have appeared mainly focusing on the metamathematical or philosophical significance of Omega (or debating against it).
Edit intent: clarity
Original:  The purpose of this survey is to expose these developments and tell a story about Omega  which outlines its multifaceted mathematical properties and roles in algorithmic randomness.
Revised:  The purpose of this survey is to expose these developments and tell a story about Omega , which outlines its multifaceted mathematical properties and roles in algorithmic randomness.
Edit intent: fluency
Original:  In this paper, we introduce Dual Rectified Linear Units (DReLUs), a novel type of rectified unit that comes with a positive and negative image that is unbounded.
Revised:  In this paper, we introduce a novel type of Rectified Linear Unit (ReLU), called a Dual Rectified Linear Unit (DReLU). A DReLU, which comes with an unbounded positive and negative image that is unbounded.
Edit intent: coherence
Original:  Therefore, we are able to stack up to eight quasi recurrent layers , making it possible to improve the current state-of-the-art in character-level language modeling over  architectures based on shallow Long Short-Term Memory (LSTM) .
Revised:  Therefore, we are able to stack up to eight quasi recurrent layers , making it possible to improve the current state-of-the-art in character-level language modeling over shallow architectures based on shallow Long Short-Term Memory (LSTM) .
Edit intent: fluency
Original:  Therefore, we are able to stack up to eight quasi recurrent layers , making it possible to improve the current state-of-the-art in character-level language modeling over  architectures based on shallow Long Short-Term Memory (LSTM) .
Revised:  Therefore, we are able to stack up to eight quasi recurrent layers , making it possible to improve the current state-of-the-art in character-level language modeling over architectures based on LSTMs .
Edit intent: coherence
Original:  We investigate if this noise has consequences on 1)  the rate of genetic drift, and 2)  the efficacy of selection.
Revised:  We investigate if this noise has consequences on 1) ~ the rate of genetic drift, and 2) the efficacy of selection.
Edit intent: fluency
Original:  We investigate if this noise has consequences on 1)  the rate of genetic drift, and 2)  the efficacy of selection.
Revised:  We investigate if this noise has consequences on 1) the rate of genetic drift, and 2) ~ the efficacy of selection.
Edit intent: fluency
Original:  Time scale analysis and dimension reduction methods allow us to reduce the corresponding Fokker-Planck equation to a one-dimensional diffusive Moran model.
Revised:  Time scale analysis and dimension reduction methods allow us to reduce the corresponding Fokker-Planck equation to a one-dimensional diffusion approximation of a Moran model.
Edit intent: clarity
Original: Social networking sites (SNS) provide innovative social bonding methods known as social grooming .
Revised: Humans use various social bonding methods known as social grooming .
Edit intent: clarity
Original:  Here we show two type social grooming (elaborate social grooming and lightweight social grooming)  discovered in a model constructed by thirty communication data-sets including face to face, SNS, mobile phones, and Chacma baboons.
Revised:  In this paper, I show that two types of social grooming (elaborate social grooming and lightweight social grooming) discovered in a model constructed by thirty communication data-sets including face to face, SNS, mobile phones, and Chacma baboons.
Edit intent: clarity
Original:  Here we show two type social grooming (elaborate social grooming and lightweight social grooming)  discovered in a model constructed by thirty communication data-sets including face to face, SNS, mobile phones, and Chacma baboons.
Revised:  Here we show two type social grooming (elaborate social grooming and lightweight social grooming) were discovered in a model constructed by thirty communication data-sets including face to face, SNS, mobile phones, and Chacma baboons.
Edit intent: clarity
Original:  Here we show two type social grooming (elaborate social grooming and lightweight social grooming)  discovered in a model constructed by thirty communication data-sets including face to face, SNS, mobile phones, and Chacma baboons.
Revised:  Here we show two type social grooming (elaborate social grooming and lightweight social grooming) discovered in a model constructed by thirty communication data-sets including face to face, SNS, and Chacma baboons.
Edit intent: clarity
Original:  This demarcation is caused by a  trade-off between the number and strength of social relationships on social grooming .
Revised:  This demarcation is caused by a difference in the trade-off between the number and strength of social relationships on social grooming .
Edit intent: clarity
Original:  This demarcation is caused by a  trade-off between the number and strength of social relationships on social grooming .
Revised:  This demarcation is caused by a trade-off between the number and strength of social relationships .
Edit intent: clarity
Original:  On the other hand, the cost of elaborate methods is higher than lightweight methods.
Revised:  On the other hand, the time and effort of elaborate methods is higher than lightweight methods.
Edit intent: clarity
Original:  On the other hand, the cost of elaborate methods is higher than lightweight methods.
Revised:  On the other hand, the cost of elaborate methods are higher than lightweight methods.
Edit intent: fluency
Original:  This model connects micro-social grooming behaviour and macro-social structures with these trade-offs.
Revised:  Additionally, my model connects social grooming behaviour and macro-social structures with these trade-offs.
Edit intent: clarity
Original:  This model connects micro-social grooming behaviour and macro-social structures with these trade-offs.
Revised:  This model connects micro-social grooming behaviour and social relationship forms with these trade-offs.
Edit intent: clarity
Original:  People tend to use elaborate social grooming to reinforce close relationships and construct deep limited societies (e.g. face to face and Chacma baboons).
Revised:  People tend to use elaborate social grooming to reinforce a few close relationships (e.g. face to face and Chacma baboons).
Edit intent: clarity
Original:  On the other hand , people tend to use lightweight social grooming to maintain many weak social relationships and construct expanded shallow societies (e.g. SNS).
Revised:  On the other hand , people tend to use lightweight social grooming to maintain many weak relationships (e.g. SNS).
Edit intent: clarity
Original:  In the case of finitely supported marginal laws, solving for the static part reduces to a semi-infinite linear program.
Edit intent: coherence
Original: Inside cells, cargos such as vesicles and organelles are transported by molecular motors to their correct locations via active motion on microtubule tracks and passive, Brownian diffusion.
Revised: Inside cells, cargos such as vesicles and organelles are transported by molecular motors to their correct locations via active motion on cytoskeletal tracks and passive, Brownian diffusion.
Edit intent: clarity
Original:  We construct a lattice model based on a Fokker Planck description of the two-state system, and study it using a kinetic Monte Carlo method .
Revised:  We construct a lattice model based on a Fokker Planck description of the two-state system, study it using a kinetic Monte Carlo method .
Edit intent: coherence
Original:  We compute transport properties such as the average velocity and the effective diffusivity of the MCC.
Revised:  We compute transport properties such as the average velocity and the binding kinetics of the MCC.
Edit intent: clarity
Original:  For constant binding and unbinding rates, we find that introducing confinement effectively enhances the unbinding rate and thereby reduces the motor processivity, leading to smaller effective diffusivity and average velocity .
Revised:  Confinement effectively reduces the effective diffusivity and average velocity .
Edit intent: clarity
Original:  However, confinement may lead to an enhancement in the average velocity if it results in a greater average binding rate than in the absence of confinement .
Revised:  However, confinement may lead to an enhancement in the average velocity if it results in an enhanced average binding rate than in the absence of confinement .
Edit intent: clarity
Original: In this paper, we present a quantum approach to solve the subset-sum problem on quantum computers and show that the approach is able to yield the  solution in polynomial time under described certain assumptions.
Revised: In this paper, we present a quantum approach to solve the subset-sum problem on quantum computers and show that the approach is able to yield the exact solution in polynomial time under described certain assumptions.
Edit intent: clarity
Original:  We  discuss the complexity of the approach and how it can be applied to the knapsack problem.
Revised:  We discuss the complexity of the approach and its application to the knapsack problem.
Edit intent: clarity
Original: In this paper, we present a quantum  approach to solve the subset-sum problem on quantum computers and show that the approach is able to yield the exact solution in polynomial time under described certain assumptions .
Revised: In this paper, we present a quantum approach to solve the subset-sum problem on quantum computers . Under described certain assumptions, we show that the approach is able to yield the exact solution in polynomial time under described certain assumptions .
Edit intent: coherence
Original:  We give an numerical example and discuss the complexity of the approach and its  application to the knapsack problem.
Revised:  We give a numerical example and discuss the complexity of the approach and its application to the knapsack problem.
Edit intent: fluency
Original:  We give an numerical example and discuss the complexity of the approach and its  application to the knapsack problem.
Revised:  We give an numerical example and discuss the complexity of the approach and its further application to the knapsack problem.
Edit intent: clarity
Original: In this paper, we present a quantum heuristic approach to solve the subset-sum problem on quantum computers . Under described certain assumptions, we show that the approach is able to yield the exact solution in polynomial time and may provide exponential speed-up over the classical algorithms  .
Revised: In this paper, we study the subset-sum problem by using a quantum heuristic approach to solve the subset-sum problem on quantum computers . Under described certain assumptions, we show that the approach is able to yield the exact solution in polynomial time and may provide exponential speed-up over the classical algorithms .
Edit intent: clarity