wanyu/IteraTeR_v2 huggingface dataset:
Original: A simulation of an interactive protocol entails the use of interactive communication to produce the output of the protocolto within a fixed statistical distance \epsilon.
Revised: Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical distance \epsilon.
Edit intent: clarity
Original:  We fill this gap and show that the distributional communication complexity of \epsilon-simulating a protocol is bounded below by the \epsilon-tail \lambda_\epsilon of the information complexity density , a random variable with information complexity as its expected value.
Revised:  We fill this gap and show that the distributional communication complexity of simulating a protocol to tail bounds for information complexity density , a random variable with information complexity as its expected value.
Edit intent: clarity
Original: Interpersonal physiological entrainment is increasingly argued to underlie rapport, empathy and even team performance.
Revised: Interpersonally shared physiological dynamics are increasingly argued to underlie rapport, empathy and even team performance.
Edit intent: clarity
Original:  Inspired by the model of interpersonal synergy, we  investigate the presence, temporal development, possible mechanisms and impact of  interpersonal heart rate entrainment during individual and collective creative LEGO construction tasks.
Revised:  Inspired by the model of interpersonal synergy, we investigate the presence, temporal development, possible mechanisms and impact of interpersonal heart rate dynamics during individual and collective creative LEGO construction tasks.
Edit intent: clarity
Original:  In Study 1 we show how HR entrainment is driven by a plurality of sources including task constraints and behavioral coordination.
Revised:  In Study 1 we show how shared HR dynamics are driven by a plurality of sources including task constraints and behavioral coordination.
Edit intent: clarity
Original:  Generally, HR entrainment is more prevalent in individual trials (involving participants doing the same things) than in collective ones (involving participants taking turns and performing complementary actions).
Revised:  Generally, shared HR dynamics are more prevalent in individual trials (involving participants doing the same things) than in collective ones (involving participants taking turns and performing complementary actions).
Edit intent: clarity
Original:  However, when contrasted against virtual pairs, collective trials display more stable HR entrainment supporting the idea that online social interaction plays a role.
Revised:  However, when contrasted against virtual pairs, collective trials display more stable shared HR dynamics suggesting that online social interaction plays a role.
Edit intent: clarity
Original:  However, when contrasted against virtual pairs, collective trials display more stable HR entrainment supporting the idea that online social interaction plays a role.
Revised:  However, when contrasted against virtual pairs, collective trials display more stable HR entrainment supporting the idea that online social interaction plays an important role.
Edit intent: clarity
Original:  In Study 2 we further show that in collective trials the dynamics of HR entrainment is statistically predicted by interpersonal speech and building coordination.
Revised:  In Study 2 investigates which aspects of social interaction might drive these effects. We show that shared HR dynamics are statistically predicted by interpersonal speech and building coordination.
Edit intent: clarity
Original:  In Study 3, we explore the relation between HR entrainment , behavioral coordination, and rapport and perceived group competence.
Revised:  In Study 3, we explore the relation between HR entrainment , behavioral coordination, and self-reported measures of rapport and group competence.
Edit intent: clarity
Original:  Behavioral coordination - at least in tasks requiring forms of joint action - seems to be more informative of both physiological entrainment and collective experience.
Revised:  Behavioral coordination - on the other hand - seems to be more informative of both physiological entrainment and collective experience.
Edit intent: clarity
Original:  Behavioral coordination - at least in tasks requiring forms of joint action - seems to be more informative of both physiological entrainment and collective experience.
Revised:  Behavioral coordination - at least in tasks requiring forms of joint action - seems to be more informative of both shared physiological dynamics and collective experience.
Edit intent: clarity
Original: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Revised: Given \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Edit intent: clarity
Original: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Revised: Given an undirected graph G = (V, E), a total ordering %DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Edit intent: fluency
Original: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Revised: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% a graph G with a total order defined on its vertices, the Maximum Pagenumber-k Subgraph Problem asks for a maximum subgraph G' of G such that G' can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Edit intent: clarity
Original: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to \prec .
Revised: Given an undirected graph G = (V, E), a total ordering \prec%DIFDELCMD < } %%% on V, and an integer K \geq 0, the Maximum Pagenumber-2 Subgraph problem is to decide whether there is a subset E' \subseteq E such that |E'| \geq K and G' = (V, E') can be embedded into a 2-book such that the vertices are placed on the spine according to the specified total order .
Edit intent: clarity
Original:  We prove that for large (bounded) average degree \gamma , the value of this semidefinite program (SDP) is -with high probability- 2n \sqrt{\gamma + n\, o( \sqrt{\gamma )+o(n).
Revised:  We prove that for large (bounded) average degree \gamma , the value of this semidefinite program (SDP) is --with high probability-- 2n \sqrt{\gamma + n\, o( \sqrt{\gamma )+o(n).
Edit intent: fluency
Original:   Our proof is based on two tools from different research areas .
Revised:  Our proof is based on tools from different research areas .
Edit intent: clarity
Original:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Fickr8K and Flick30K databases significantly outperform the state-of-the-art approaches.
Revised:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Flickr8K and Flickr30K databases significantly outperform the state-of-the-art approaches.
Edit intent: fluency
Original:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Flickr8K and Flickr30K databases significantly outperform the state-of-the-art approaches .
Revised:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Flickr30K databases significantly outperform the state-of-the-art approaches .
Edit intent: clarity
Original:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Flickr8K and Flickr30K databases significantly outperform the state-of-the-art approaches .
Revised:  Specifically, our proposed m-CNNs for bidirectional image and sentence retrieval on Flickr8K and Flickr30K databases significantly outperform the state-of-the-art performances .
Edit intent: clarity
Original:  In this paper, we prove that every triangle-free 1-planar graph G admits an acyclic edge coloring with \Delta(G) + 17 colors.
Revised:  In this paper, we prove that every triangle-free 1-planar graph G has an acyclic edge coloring with \Delta(G) + 17 colors.
Edit intent: clarity
Original:  We, thereof, propose an improved high-degree centrality measure (named DegreeDistance ) and improve it to enhance accuracy in two phases, FIDD and SIDD, by put a threshold on the number of common neighbors of already-selected seed nodes and a non-seed node which is under investigation to be selected as a seed as well as considering the influence score of seed nodes directly or through their common neighbors over the non-seed node.
Revised:  We, thereof, propose an improved high-degree centrality measure (named DegreeDistance ) and improve it to enhance accuracy in two phases, FIDD and SIDD, by put a threshold on the number of common neighbors of already-selected seed nodes and a non-seed node which is under investigation to be selected as a seed as well as considering the influence score of seed nodes directly or through their common neighbors over the non-seed node.
Edit intent: fluency
Original:  We, thereof, propose an improved high-degree centrality measure (named DegreeDistance ) and improve it to enhance accuracy in two phases, FIDD and SIDD, by put a threshold on the number of common neighbors of already-selected seed nodes and a non-seed node which is under investigation to be selected as a seed as well as considering the influence score of seed nodes directly or through their common neighbors over the non-seed node.
Revised:  We, thereof, propose an improved high-degree centrality measure (named DegreeDistance ) and improve it to enhance accuracy in two phases, FIDD and SIDD, by putting a threshold on the number of common neighbors of already-selected seed nodes and a non-seed node which is under investigation to be selected as a seed as well as considering the influence score of seed nodes directly or through their common neighbors over the non-seed node.
Edit intent: fluency
Original:  We introduce and justify finite approximations m_k that have already been used in  applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity.
Revised:  We introduce and justify finite approximations m_k that have been used in applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity.
Edit intent: clarity
Original:  We introduce and justify finite approximations m_k that have already been used in  applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity.
Revised:  We introduce and justify finite approximations m_k that have already been used in some applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity.
Edit intent: clarity
Original:  Finally, we provide error estimations of m_k with respect to m  .
Revised:  We provide error estimations of m_k with respect to m .
Edit intent: fluency
Original:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions .
Revised:  We used the Liapunov method which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions .
Edit intent: fluency
Original:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions .
Revised:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODEs) around the equilibrium , when submitted to perturbations in the initial conditions .
Edit intent: fluency
Original:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions .
Revised:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium when they submitted to perturbations in the initial conditions .
Edit intent: clarity
Original:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions .
Revised:  We used the Liapunov method , which consists in analyzing the stability of systems of ordinary differential equations ( ODE's) , around the equilibrium , when submitted to perturbations in the initial conditions 
Edit intent: fluency
Original:  In particular, some direct impacts are listed in the form of abandoning non-functional best practices , such as micro-registration, which would be implicitly required for functioning before arrival these new access technologies.
Revised:  In particular, some direct impacts are listed in the form of abandoning non-functional technologies , such as micro-registration, which would be implicitly required for functioning before arrival these new access technologies.
Edit intent: clarity
Original:  In particular, some direct impacts are listed in the form of abandoning non-functional best practices , such as micro-registration, which would be implicitly required for functioning before arrival these new access technologies.
Revised:  In particular, some direct impacts are listed in the form of abandoning non-functional best practices , such as micro-registration, which would be implicitly required for having a functioning operation before arrival the new high-bandwidth access technologies.
Edit intent: clarity
Original:  It is shown than such abandonment of non-functional best practices, which are mainly at the management level of ICT, immediately results in additional consumption and environmental footprint, and also some new innovations that might have been ` missed.'
Revised:  It is shown that such abandonment of non-functional best practices, which are mainly at the management level of ICT, immediately results in additional consumption and environmental footprint, and also some new innovations that might have been ` missed.'
Edit intent: fluency
Original:  It is shown than such abandonment of non-functional best practices, which are mainly at the management level of ICT, immediately results in additional consumption and environmental footprint, and also some new innovations that might have been ` missed.'
Revised:  It is shown than such abandonment of non-functional best practices, which are mainly at the management level of ICT, immediately results in additional consumption and environmental footprint, and also there is a chance that some other new innovations might be ' missed.'
Edit intent: clarity
Original:  Therefore  these access technologies are not aligned with a  sustainable ICT picture, except if they are regulated.
Revised:  Therefore these access technologies is not aligned with a sustainable ICT picture, except if they are regulated.
Edit intent: fluency
Original:  An approach to pricing the best practices, at both functional and non-functional levels , is proposed in order to develop a regulation and policy framework for a sustainable broadband access.
Revised:  An approach to pricing the best practices, including both functional and non-functional levels , is proposed in order to develop a regulation and policy framework for a sustainable broadband access.
Edit intent: clarity
Original:  An approach to pricing the best practices, at both functional and non-functional levels , is proposed in order to develop a regulation and policy framework for a sustainable broadband access.
Revised:  An approach to pricing the best practices, at both functional and non-functional technologies , is proposed in order to develop a regulation and policy framework for a sustainable broadband access.
Edit intent: clarity
Original: Alice and Bob want to run a protocol over an unreliable channel, where a certain number of bits are flipped adversarially.
Revised: Alice and Bob want to run a protocol over a noisy channel, where a certain number of bits are flipped adversarially.
Edit intent: clarity
Original:  However, his algorithm critically requires "a priori" knowledge of the number of bits that will be flipped by the adversary.
Revised:  However, his algorithm critically requires a \ priori knowledge of the number of bits that will be flipped by the adversary.
Edit intent: fluency
Original:  Here, we describe an algorithm requiring no such knowledge.
Revised:  We describe an algorithm requiring no such knowledge.
Edit intent: coherence
Original:  If an adversary flips T bits, our algorithm sends L + O\left( (T + \sqrt{LT+L)\log(LT+L)}  \right) bits in expectation and succeeds with high probability in L. It does so without any "a priori" knowledge of T. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors.
Revised:  If an adversary flips T bits, our algorithm sends L + O\left( (T + )\log(LT+L)} \right) bits in expectation and succeeds with high probability in L. It does so without any "a priori" knowledge of T. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors.
Edit intent: clarity
Original:  If an adversary flips T bits, our algorithm sends L + O\left( (T + \sqrt{LT+L)\log(LT+L)}  \right) bits in expectation and succeeds with high probability in L. It does so without any "a priori" knowledge of T. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors.
Revised:  If an adversary flips T bits, our algorithm sends L + O\left( (T + \sqrt{LT+L)\log(LT+L)} \right) bits in expectation and succeeds with high probability in L. It does so without any a \ priori knowledge of T. Assuming a conjectured lower bound by Haeupler, our result is optimal up to logarithmic factors.
Edit intent: fluency
Original:  We show that such an assumption is necessary when the amount of noise is unknown.
Revised:  We show that privacy is necessary when the amount of noise is unknown.
Edit intent: clarity
Original: Reverse pricing has been recognized as an effective tool to handle the uncertainty of users' demands in the travel industry (e.g., airlines and hotels).
Revised: Reverse pricing has been recognized as an effective tool to handle demand uncertainty in the travel industry (e.g., airlines and hotels).
Edit intent: clarity
Original:  To investigate its viability in cellular networks, we study the practical limitations of (operator-driven) time-dependent pricing that has been recently introduced, taking into account demand uncertainty.
Revised:  To investigate its viability for communication networks, we study the practical limitations of (operator-driven) time-dependent pricing that has been recently introduced, taking into account demand uncertainty.
Edit intent: clarity
Original:  Then, we endeavor to design the reverse pricing mechanism to resolve the weakness of the time-dependent pricing scheme.
Revised:  Compared to (operator-driven) time-dependent pricing scheme.
Edit intent: clarity
Original:  Our findings provide a new outlook on resource management , and design guidelines for adopting the reverse pricing scheme.
Revised:  Our findings provide a new outlook on resource allocation , and design guidelines for adopting the reverse pricing scheme.
Edit intent: clarity
Original:  In this paper, we derive a universal expression for the copy error as a function of entropy production and dissipated work of the process {\cred  .
Revised:  In this paper, we derive a universal expression for the copy error as a function of entropy production and {\cred .
Edit intent: clarity
Original:  whereas it scales as a power-law or slower for sequential binding, asymptotically.
Revised:  in contrast, it scales as a power-law or slower for sequential binding, asymptotically.
Edit intent: coherence
Original: Relation classification is an important semantic processing task whose state-of-the-art systems still rely on the use of costly handcrafted features.
Revised: Relation classification is an important semantic processing task for which state-ofthe-art systems still rely on the use of costly handcrafted features.
Edit intent: clarity
Original: Relation classification is an important semantic processing task whose state-of-the-art systems still rely on the use of costly handcrafted features.
Revised: Relation classification is an important semantic processing task whose state-of-the-art systems still rely on costly handcrafted features.
Edit intent: clarity
Original:  We perform experiments using the the SemEval-2010 Task 8 dataset, which encodes the task of classifying the relationship between two nominals marked in a sentence.
Revised:  We perform experiments using the the SemEval-2010 Task 8 dataset, which is designed for the task of classifying the relationship between two nominals marked in a sentence.
Edit intent: clarity
Original:  Additionally, our experimental results also evidence that: (1) our approach is more effective than CNN followed by a softmax classifier;
Revised:  Additionally, our experimental results show that: (1) our approach is more effective than CNN followed by a softmax classifier;
Edit intent: clarity
Original:  We suggest that the global perspective remains intact in OCD but there is a dysfunction at  sub-linguistic levels of cognition.
Revised:  We suggest that the global perspective remains intact in OCD but there is a dysfunction at a sub-linguistic levels of cognition.
Edit intent: fluency
Original:  We suggest that the global perspective remains intact in OCD but there is a dysfunction at  sub-linguistic levels of cognition.
Revised:  We suggest that the global perspective remains intact in OCD but there is a dysfunction at sub-linguistic level of cognition.
Edit intent: fluency
Original: We present a new algorithm for detecting overlapping communities in graphs .
Revised: We present a new algorithm for community detection .
Edit intent: clarity
Original:  The algorithm uses random walks to embed the graph in a space of measures, after which a modification of k-means for that space is applied.
Revised:  The algorithm uses random walks to embed the graph in a space of measures, after which a modification of k-means in that space is applied.
Edit intent: clarity
Original:  It is therefore fast and easily parallelizable.
Revised:  The algorithm is therefore fast and easily parallelizable.
Edit intent: clarity