wanyu/IteraTeR_v2 huggingface dataset:
Original: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Revised: Essentially all Internet communication relies on the Domain Name System (DNS), which translates a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Edit intent: clarity
Original: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Revised: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable name to an IP address before two endpoints establish a connection to exchange data .
Edit intent: clarity
Original: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints establish a connection to exchange data .
Revised: Essentially all Internet communication relies on the Domain Name System (DNS), which first maps a human-readable Internet destination or service to an IP address before two endpoints can communicate .
Edit intent: clarity
Original:  Today, most DNS queries and responses are transmitted in cleartext, making them vulnerable to eavesdroppers and traffic analysis . Past work has demonstrated that DNS queries can reveal everything from browsing activity to user activity in a smart home.
Revised:  Today, DNS traffic is unencrypted, leaving users vulnerable to eavesdropping and tampering . Past work has demonstrated that DNS queries can reveal everything from browsing activity to user activity in a smart home.
Edit intent: clarity
Original:  Rather than sending queries and responses as cleartext, these protocols establish encrypted tunnels between clients and resolvers.
Revised:  Rather than sending queries and responses in the clear, DoH and DoT establish encrypted connections between users and resolvers.
Edit intent: clarity
Original:  This fundamental architectural change has implications for the performance of DNS, as well as for content delivery .
Revised:  By doing so, these protocols provide privacy and security guarantees that traditional DNS (Do53) lacks .
Edit intent: clarity
Original:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Revised:  We find that although DoH and DoT response times are generally higher than Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Edit intent: clarity
Original:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Revised:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 , both protocols can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Edit intent: fluency
Original:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Revised:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than Do53 in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Edit intent: clarity
Original:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Revised:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Edit intent: coherence
Original:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, when network conditions degrade, webpages load quickest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Revised:  We find that although DoH and DoT response times can be higher than for conventional DNS ( Do53 ), DoT can perform better than both protocols in terms of page load times , and DoH can at best perform indistinguishably from Do53 . However, as throughput decreases and substantial packet loss and latency are introduced, web pages load fastest with Do53 , with a median of almost 0.5 seconds faster compared to DoH.
Edit intent: clarity
Original:  Furthermore, in a substantial amount of cases, a webpage may not load at all with DoH, while it loads successfully with DoT and Do53 . Our in-depth analysis reveals various opportunities to readily improve DNS performance, for example through opportunistic partial responses and wire format caching.
Revised:  Furthermore, in a substantial amount of cases, a webpage may not load at all with DoH, while it loads successfully with DoT and Do53 . Our in-depth analysis reveals various opportunities to readily improve DNS performance, such as opportunistic partial responses and wire format caching.
Edit intent: coherence
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different uncertain parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different parameters in a computational model . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different parameters in a data-set . Such a model is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different parameters in a data-set . Such a data-set is characterized by a set of input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and an output quantity of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different  parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their joint density can be obtained.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different parameters in a data-set . Such a data-set is characterized by a set of vector-valued input parameters and a set of scalar-valued output quantities of interest, where we typically assume that the inputs are independent and information on their marginal densities can be obtained.
Edit intent: clarity
Original:  In this paper, we build on these previously well-known ideas by studying two different aspects of this paradigm.
Revised:  In this paper, we build on these previously well-known ideas by examining two different aspects of this paradigm.
Edit intent: clarity
Original:  First, we study whether sensitivity indices can be computed efficiently if one leverages a polynomial ridge approximation---a polynomial least squares fit over a subspace.
Revised:  First, we study whether sensitivity indices can be computed efficiently if one leverages a polynomial ridge approximation, a polynomial least squares fit over a subspace.
Edit intent: fluency
Original:  We discuss a recipe that utilizes this special dependence structure  to reduce the number of model evaluations required for this process .
Revised:  We discuss a recipe that exploits a special dependence structure to reduce the number of model evaluations required for this process .
Edit intent: clarity
Original:  We discuss a recipe that utilizes this special dependence structure  to reduce the number of model evaluations required for this process .
Revised:  We discuss a recipe that utilizes this special dependence structure to reduce the number of model evaluations .
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different uncertain parameters in a computational model.
Revised: Global sensitivity analysis is a powerful set of ideas and heuristics for understanding the importance and interplay between different uncertain parameters in a computational model.
Edit intent: clarity
Original: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between different uncertain parameters in a computational model.
Revised: Global sensitivity analysis is a powerful set of ideas and computational heuristics for understanding the importance and interplay between uncertain parameters in a computational model.
Edit intent: clarity
Original:  Such a model is characterized by a set of input parameters and an output quantity of interest, where we typically assume that the inputs are independent and information on their marginal densities can be obtained .
Revised:  Such a model is characterized by a set of input parameters and an output quantity of interest, where we typically assume that the inputs are independent and their marginal densities can be obtained .
Edit intent: clarity
Original:  Such a model is characterized by a set of input parameters and an output quantity of interest, where we typically assume that the inputs are independent and information on their marginal densities can be obtained .
Revised:  Such a model is characterized by a set of input parameters and an output quantity of interest, where we typically assume that the inputs are independent and information on their marginal densities are known .
Edit intent: clarity
Original:  If the output quantity of interest is smoothand continuous, polynomial least squares approximations can be used to extract Sobol' indices.
Revised:  If the output quantity is smooth, polynomial chaos can be used to extract Sobol' indices.
Edit intent: clarity
Original:  In this paper, we build on these previously well-known ideas by examining two different aspects of this paradigm.
Revised:  In this paper, we build on these well-known ideas by examining two different aspects of this paradigm.
Edit intent: clarity
Original:  First, we study whether sensitivity indices can be computed efficiently if one leverages a polynomial ridge approximation , a polynomial least squares fit over a subspace.
Revised:  First, we study whether sensitivity indices can be computed efficiently if one leverages a polynomial ridge approximation -- a polynomial fit over a subspace.
Edit intent: clarity
Original:  Second, we discuss two heuristics for evaluating input sensitivities when constrained near output extrema : skewness-based sensitivity indices and variance reduction indices based on Monte Carlo filtering .
Revised:  Second, we discuss methods for evaluating sensitivities when constrained near output extrema : skewness-based sensitivity indices and variance reduction indices based on Monte Carlo filtering .
Edit intent: clarity
Original: Designing  fast and reliable distributed consensus protocols is a key to enabling mission-critical and real-time controls of industrial Internet of Things (IIoT) nodes communicating over wireless links .
Revised: Designing fast and reliable wireless consensus protocols is a key to enabling mission-critical and real-time controls of industrial Internet of Things (IIoT) nodes communicating over wireless links .
Edit intent: clarity
Original: Designing  fast and reliable distributed consensus protocols is a key to enabling mission-critical and real-time controls of industrial Internet of Things (IIoT) nodes communicating over wireless links .
Revised: Designing fast and reliable distributed consensus protocols is instrumental in enabling mission-critical and real-time controls of industrial Internet of Things (IIoT) nodes communicating over wireless links .
Edit intent: clarity
Original:  However, chasing both low-latency and reliability of a consensus protocol at once is a challenging task.
Revised:  However, chasing both low-latency and reliability of consensus protocols is a challenging task.
Edit intent: clarity
Original:  The problem is even aggravated under wireless connectivity that is slower and less reliable, compared to wired connections presumed in traditional consensus protocols .
Revised:  The problem is aggravated under wireless connectivity that is slower and less reliable, compared to wired connections presumed in traditional consensus protocols .
Edit intent: clarity
Original:  The problem is even aggravated under wireless connectivity that is slower and less reliable, compared to wired connections presumed in traditional consensus protocols .
Revised:  The problem is even aggravated under wireless connectivity that may be slower and less reliable, compared to wired connections presumed in traditional consensus protocols .
Edit intent: clarity
Original:  The problem is even aggravated under wireless connectivity that is slower and less reliable, compared to wired connections presumed in traditional consensus protocols .
Revised:  The problem is even aggravated under wireless connectivity that is slower and less reliable, compared to wired connections .
Edit intent: clarity
Original:  To tackle this issue, we investigate fundamental relationships between consensus latency and reliability under wireless connectivity, and thereby co-design communication and consensus protocols for low-latency and reliable IIoT systems.
Revised:  To tackle this issue, we investigate fundamental relationships between consensus latency and reliability through the lens of wireless connectivity, and thereby co-design communication and consensus protocols for low-latency and reliable IIoT systems.
Edit intent: clarity
Original:  To tackle this issue, we investigate fundamental relationships between consensus latency and reliability under wireless connectivity, and thereby co-design communication and consensus protocols for low-latency and reliable IIoT systems.
Revised:  To tackle this issue, we investigate fundamental relationships between consensus latency and reliability under wireless connectivity, and co-design communication and consensus protocols for low-latency and reliable IIoT systems.
Edit intent: coherence
Original:  To this end, we derive  closed-form end-to-end (E2E) latency expression of  R2C that guarantees a target reliability, and compare this with a baseline consensus protocol, referred to as Referendum Consensus (RC)  .
Revised:  To this end, we derive a closed-form end-to-end (E2E) latency expression of R2C that guarantees a target reliability, and compare this with a baseline consensus protocol, referred to as Referendum Consensus (RC) .
Edit intent: fluency
Original:  To this end, we derive  closed-form end-to-end (E2E) latency expression of  R2C that guarantees a target reliability, and compare this with a baseline consensus protocol, referred to as Referendum Consensus (RC)  .
Revised:  To this end, we derive closed-form end-to-end (E2E) latency expression of the R2C that guarantees a target reliability, and compare this with a baseline consensus protocol, referred to as Referendum Consensus (RC) .
Edit intent: fluency
Original:  To this end, we derive  closed-form end-to-end (E2E) latency expression of  R2C that guarantees a target reliability, and compare this with a baseline consensus protocol, referred to as Referendum Consensus (RC)  .
Revised:  To this end, we derive closed-form end-to-end (E2E) latency expression of R2C that guarantees a target reliability, and compare it with a baseline consensus protocol, referred to as Referendum Consensus (RC) .
Edit intent: fluency
Original: We investigate the presence (and the influence) of disinformation spreading on online social networks in Italy, in the 5-month period preceding the 2019 European Parliament elections.
Revised: We investigate the presence (and the influence) of disinformation spreading on online social networks in Italy, in the5-month period preceding the 2019 European Parliament elections.
Edit intent: fluency
Original:  To this aim we collected a large-scale dataset of tweets associated to thousands of news articles published on Italian disinformation websites.
Revised:  To this aim we collected a large-scale dataset oftweets associated to thousands of news articles published on Italian disinformation websites.
Edit intent: fluency
Original:  In the observation period,a few outlets accounted for most of the deceptive information circulating on Twitter, which was driven by controversial and polarizing topics of debate such as immigration, national safety and (Italian) nationalism.
Revised:  In the observation period,a few outlets accounted for most of the deceptive information circulating on Twitter, which focused on controversialand polarizing topics of debate such as immigration, national safety and (Italian) nationalism.
Edit intent: clarity
Original:  We unraveled the existence of an intricate network of connections between different disinformation outlets across Europe, U.S. and Russia, which seemingly acted in a coordinated manner in the period before the elections.
Revised:  We found evidence ofconnections between different disinformation outlets across Europe, U.S. and Russia, which seemingly acted in a coordinated manner in the period before the elections.
Edit intent: clarity
Original:  Overall, the spread of disinformation on Twitter was confined in a limited community, strongly (and explicitly) related to the Italian conservative and far-right political environment, who seldom focused online discussions on the up-coming elections.
Revised:  Overall, the spread of disinformation onTwitter was confined in a limited community, strongly (and explicitly) related to the Italian conservative and far-right political environment, who seldom focused online discussions on the up-coming elections.
Edit intent: fluency
Original:  Overall, the spread of disinformation on Twitter was confined in a limited community, strongly (and explicitly) related to the Italian conservative and far-right political environment, who seldom focused online discussions on the up-coming elections.
Revised:  Overall, the spread of disinformation on Twitter was confined in a limited community, strongly (and explicitly) related to the Italian conservative and far-rightpolitical environment, who seldom focused online discussions on the up-coming elections.
Edit intent: fluency