wanyu/IteraTeR_v2 huggingface dataset:
Original:  A main implication of our construction is that technical correctness provides a complementary perspective on science that is as fundamental there as it is for pure mathematics , provided mature reductionism exists .
Revised:  A main implication of our construction is that technical correctness provides a complementary perspective on science that is as fundamental there as for pure mathematics , provided mature reductionism exists .
Edit intent: fluency
Original:  Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our setting is arbitrary and a priory unknown to the parties.
Revised:  Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our setting is arbitrary and a priori unknown to the parties.
Edit intent: clarity
Original:  Namely, in case the channel erases T transmissions, the coding scheme will take N+2T transmissions (using alphabet of size 4  ) to correctly simulate any binary protocol that takes N transmissions assuming a noiseless channel.
Revised:  Namely, in case the channel erases T transmissions, the coding scheme will take N+2T transmissions using an alphabet of size 4 ) to correctly simulate any binary protocol that takes N transmissions assuming a noiseless channel.
Edit intent: fluency
Original:  We can further reduce the communication to N+T if we relax the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than transmitting a message in each and every round of the coding scheme.
Revised:  We can further reduce the communication to N+T by relaxing the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than transmitting a message in each and every round of the coding scheme.
Edit intent: coherence
Original:  We can further reduce the communication to N+T if we relax the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than transmitting a message in each and every round of the coding scheme.
Revised:  We can further reduce the communication to N+T if we relax the communication model and allowing parties to remain silent rather than transmitting a message in each and every round of the coding scheme.
Edit intent: coherence
Original:  We can further reduce the communication to N+T if we relax the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than transmitting a message in each and every round of the coding scheme.
Revised:  We can further reduce the communication to N+T if we relax the communication model in a similar way to the adaptive setting of Agrawal et al. (2016), and allow the parties to remain silent rather than forcing them to communicate in every round of the coding scheme.
Edit intent: clarity
Original:  Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the amount of erasures T.
Revised:  Our coding schemes are efficient, deterministic, have linear overhead both in their communication and round complexity, and succeed (with probability 1) regardless of the number of erasures T.
Edit intent: clarity
Original:  The NRM uses the given CNN to design the prior distribution in the probabilistic model.
Revised:  The DGM uses a CNN to design the prior distribution in the probabilistic model.
Edit intent: clarity
Original:  It introduces a small set of latent variables at each level , and enforces dependencies among all the latent variables via a conjugate prior distribution.
Revised:  It introduces a small set of latent variables at each scale , and enforces dependencies among all the latent variables via a conjugate prior distribution.
Edit intent: clarity
Original: The failure of conventional electronic architectures to  solve large combinatorial problems motivates the development of novel computational architectures .
Revised: The inability of conventional electronic architectures to solve large combinatorial problems motivates the development of novel computational architectures .
Edit intent: clarity
Original: The failure of conventional electronic architectures to  solve large combinatorial problems motivates the development of novel computational architectures .
Revised: The failure of conventional electronic architectures to solve large combinatorial problems motivates the development of novel computational hardware .
Edit intent: clarity
Original:  There has been much effort recently in developing photonic networks which can exploit fundamental properties enshrined in the wave nature of light and of its interaction with matter: high-speed, low-power, optical passivity, and parallelization.
Revised:  There has been much effort recently toward developing photonic networks which can exploit fundamental properties enshrined in the wave nature of light and of its interaction with matter: high-speed, low-power, optical passivity, and parallelization.
Edit intent: clarity
Original:  There has been much effort recently in developing photonic networks which can exploit fundamental properties enshrined in the wave nature of light and of its interaction with matter: high-speed, low-power, optical passivity, and parallelization.
Revised:  There has been much effort recently in developing photonic networks which exploit fundamental properties enshrined in the wave nature of light and of its interaction with matter: high-speed, low-power, optical passivity, and parallelization.
Edit intent: clarity
Original:  However, unleashing the true potential of photonic architectures requires the development of featured algorithms which largely exploit these fundamental properties.
Revised:  However, unleashing the true potential of photonic architectures requires the development of featured algorithms which optimally exploit these fundamental properties.
Edit intent: clarity
Original:  We here present the Photonic Recurrent Ising Sampler (PRIS), an algorithm tailored for photonic parallel networks that can sample combinatorially hard distributions of Ising problems, in a fast and efficient manner .
Revised:  We here present the Photonic Recurrent Ising Sampler (PRIS), an algorithm tailored for photonic parallel networks that allows for fast and efficient sampling from distributions of combinatorially hard Ising problems .
Edit intent: clarity
Original:  However, unleashing the true potential of photonic architectures requires the development of featured algorithms which optimally exploit these fundamental properties.
Revised:  However, unleashing the true potential of such novel architectures requires the development of featured algorithms which optimally exploit these fundamental properties.
Edit intent: clarity
Original:  However, unleashing the true potential of photonic architectures requires the development of featured algorithms which optimally exploit these fundamental properties.
Revised:  However, unleashing the true potential of photonic architectures requires the development of featured algorithms which optimally exploit their fundamental properties.
Edit intent: fluency
Original:  We here present the Photonic Recurrent Ising Sampler (PRIS), a heuristic method tailored for photonic parallel networks that allows for fast and efficient sampling from distributions of combinatorially hard Ising problems.
Revised:  We here present the Photonic Recurrent Ising Sampler (PRIS), a heuristic method tailored for parallel architectures that allows for fast and efficient sampling from distributions of combinatorially hard Ising problems.
Edit intent: clarity
Original:   The PRIS provides sample solutions which converge in probability to the ground state of arbitrary Ising models  . By running the PRIS at various noise levels, we probe the critical behavior of universality classes and their critical exponents.
Revised:  The PRIS provides sample solutions to the ground state of arbitrary Ising models . By running the PRIS at various noise levels, we probe the critical behavior of universality classes and their critical exponents.
Edit intent: clarity
Original:  Our work paves the way to orders-of-magnitude speedups in heuristic methods via photonic implementations of the PRIS.
Revised:  Our work suggests speedups in heuristic methods via photonic implementations of the PRIS.
Edit intent: clarity
Original: Low power and lossy networks (LLNs) enable diverse applications integrating many  embedded devices, often requiring interconnectivity between LLNs and existing TCP/IP networks .
Revised: Low-power and lossy networks (LLNs) enable diverse applications integrating many embedded devices, often requiring interconnectivity between LLNs and existing TCP/IP networks .
Edit intent: fluency
Original: Low power and lossy networks (LLNs) enable diverse applications integrating many  embedded devices, often requiring interconnectivity between LLNs and existing TCP/IP networks .
Revised: Low power and lossy networks (LLNs) enable diverse applications integrating many embedded devices, often requiring interconnectivity with existing TCP/IP networks .
Edit intent: clarity
Original: Biochemical networks, under mass-action kinetics, containing reactions with three or more reactants (called high-molecular reactions) are investigated.
Revised: Biochemical reactions involving three or more reactants (called high-molecular reactions) are investigated.
Edit intent: clarity
Original:  Properties of the algorithm and convergence are established by applying singular perturbation theory on the underlying chemical master equation .
Revised:  Properties of the algorithm and convergence are established via singular perturbation theory on the underlying chemical master equation .
Edit intent: clarity
Original:  Properties of the algorithm and convergence are established by applying singular perturbation theory on the underlying chemical master equation .
Revised:  Properties of the algorithm and convergence are established by applying singular perturbation theory .
Edit intent: clarity
Original:  We illustrate the novel simulation capabilities provided by our simulator through a case study exploring programming models based on a unified multi-GPU system ~ (U-MGPU) and a discrete multi-GPU system ~ (D-MGPU) that both utilize unified memory space and cross-GPU memory access.
Revised:  We illustrate the novel simulation capabilities provided by our simulator through a case study exploring programming models based on a unified multi-GPU system (U-MGPU) and a discrete multi-GPU system ~ (D-MGPU) that both utilize unified memory space and cross-GPU memory access.
Edit intent: fluency
Original:  We illustrate the novel simulation capabilities provided by our simulator through a case study exploring programming models based on a unified multi-GPU system ~ (U-MGPU) and a discrete multi-GPU system ~ (D-MGPU) that both utilize unified memory space and cross-GPU memory access.
Revised:  We illustrate the novel simulation capabilities provided by our simulator through a case study exploring programming models based on a unified multi-GPU system ~ (U-MGPU) and a discrete multi-GPU system (D-MGPU) that both utilize unified memory space and cross-GPU memory access.
Edit intent: fluency
Original: We introduce Flexible Representative Democracy (FRD), a novel hybrid of Representative Democracy (RD) and Direct Democracy (DD), in which voters can alter the issue-dependent weights of a set of elected representatives.
Revised: We introduce Flexible Representative Democracy (FRD), a novel hybrid of Representative Democracy (RD) and direct democracy (DD), in which voters can alter the issue-dependent weights of a set of elected representatives.
Edit intent: fluency
Original:  In line with the literature on Interactive Democracy, our model allows the voters to actively determine the degree to which the democracy is direct versus representative.
Revised:  In line with the literature on Interactive Democracy, our model allows the voters to actively determine the degree to which the system is direct versus representative.
Edit intent: clarity
Original:  We provide NP-Hardness results for electing an ideal set of representatives, discuss pathologies, and demonstrate empirically that common polynomial-time multi-winner election rules for selecting representatives do not perform well in expectation.
Revised:  We provide NP-Hardness results for electing an ideal set of representatives, discuss pathologies, and demonstrate empirically that common multi-winner election rules for selecting representatives do not perform well in expectation.
Edit intent: clarity
Original: Over the past few years, extensive anecdotal evidence emerged that suggests the involvement of state-sponsored actors (or "trolls") in online political campaigns with the goal to manipulate public opinion and sow discord.
Revised: Recent evidence has emerged linking coordinated campaigns by state-sponsored actors (or "trolls") in online political campaigns with the goal to manipulate public opinion and sow discord.
Edit intent: clarity
Original: Over the past few years, extensive anecdotal evidence emerged that suggests the involvement of state-sponsored actors (or "trolls") in online political campaigns with the goal to manipulate public opinion and sow discord.
Revised: Over the past few years, extensive anecdotal evidence emerged that suggests the involvement of state-sponsored actors to manipulate public opinion and sow discord.
Edit intent: clarity
Original:  In this paper, we analyze these ground truth datasets across several axes to understand how these actors operate, how they evolve over time, who are their targets, how their strategies changed over time, and what is their influence to the Web's information ecosystem.
Revised:  In this paper, we analyze these ground truth datasets across several axes to understand how these actors operate, how they evolve over time, who are their targets, how their strategies evolve over time, and what is their influence to the Web's information ecosystem.
Edit intent: clarity
Original:  In this paper, we analyze these ground truth datasets across several axes to understand how these actors operate, how they evolve over time, who are their targets, how their strategies changed over time, and what is their influence to the Web's information ecosystem.
Revised:  In this paper, we analyze these ground truth datasets across several axes to understand how these actors operate, how they evolve over time, who are their targets, how their strategies changed over time, and how they influence the Web's information ecosystem.
Edit intent: clarity
Original:   Among other things  we find: a) campaigns of these actors were influenced by real-world events;
Revised:  Among other things , we find: a) campaigns of these actors were influenced by real-world events;
Edit intent: fluency
Original:  b) these actors were employing different tactics and had different targets over time, thus their automated detection is not straightforward;
Revised:  and 3) that the behavior of such actors is not consistent over time, thus their automated detection is not straightforward;
Edit intent: clarity
Original:  b) these actors were employing different tactics and had different targets over time, thus their automated detection is not straightforward;
Revised:  b) these actors were employing different tactics and had different targets over time, hence automated detection is not straightforward;
Edit intent: clarity
Original:  Finally, using Hawkes Processes , we quantified the influence that these actors had to four Web communities: Reddit, Twitter, 4chan's Politically Incorrect board (/pol/), and Gab , finding that Russian trolls were more influential than Iranians with the exception of /pol/  .
Revised:  Finally, using Hawkes Processes , Reddit, 4chan's Politically Incorrect board (/pol/), and Gab , finding that Russian trolls were more influential than Iranians with the exception of /pol/ .
Edit intent: clarity
Original:  Finally, using Hawkes Processes , we quantified the influence that these actors had to four Web communities: Reddit, Twitter, 4chan's Politically Incorrect board (/pol/), and Gab , finding that Russian trolls were more influential than Iranians with the exception of /pol/  .
Revised:  Finally, using Hawkes Processes , we quantified the influence that these actors had to four Web communities: Reddit, Twitter, 4chan's Politically Incorrect board (/pol/), and Gab . In general, Russian trolls were more influential than Iranians with the exception of /pol/ .
Edit intent: clarity
Original:  This problem assumes a large image which is cut into equal square pieces that are arbitrarily rotated and shuffled and asks to recover the original image given the transformed pieces.
Revised:  This problem assumes a large image which is cut into equal square pieces that are arbitrarily rotated and shifted and asks to recover the original image given the transformed pieces.
Edit intent: clarity
Original:  Iterative application of this method and other methods for recovering the unknown shuffles result in a solution for the large jigsaw puzzle problem.
Revised:  Iterative application of this method and other methods for recovering the unknown shifts result in a solution for the large jigsaw puzzle problem.
Edit intent: clarity
Original:  This problem assumes a large image  which is cut into equal square pieces that are arbitrarily rotated and shifted and asks to recover the original image given the transformed pieces.
Revised:  This problem assumes a large image , which is cut into equal square pieces that are arbitrarily rotated and shifted and asks to recover the original image given the transformed pieces.
Edit intent: fluency
Original:  The main contribution of this work is a theoretically-guaranteed method for recovering the unknown orientations of the puzzle pieces by using the graph connection Laplacian associated with the puzzle.
Revised:  The main contribution of this work is a method for recovering the unknown orientations of the puzzle pieces by using the graph connection Laplacian associated with the puzzle.
Edit intent: clarity
Original:  Iterative application of this method and other methods for recovering the unknown shifts result in a solution for the large jigsaw puzzle problem.
Revised:  Iterative application of this method and other methods for recovering the unknown shifts result in a solution for the jigsaw puzzle problem.
Edit intent: clarity
Original:  This solution is not greedy, unlike many other solutions.
Edit intent: coherence
Original:  Numerical experiments demonstrate the competitive performance of the proposed method .
Revised:  Numerical experiments demonstrate the competitive performance of this solution .
Edit intent: clarity
Original:  Numerical experiments demonstrate the competitive performance of this solution  .
Revised:  Numerical experiments demonstrate the competitive accuracy of this solution .
Edit intent: clarity
Original:  We guarantee some robustness of the latter estimate to measurement errors.
Edit intent: coherence
Original:   Numerical experiments demonstrate the competitive accuracy of this solution, its robustness to corruption and  its computational advantage for large puzzles.
Revised:  Numerical experiments demonstrate the competitive accuracy of this solution, its robustness to corruption and , its computational advantage for large puzzles.
Edit intent: fluency
Original: Smart home connects tens of home devices into the Internet, running a smart algorithm in the cloud that sends remote commands to the devices .
Revised: A smart home connects tens of home devices into the Internet, running a smart algorithm in the cloud that sends remote commands to the devices .
Edit intent: fluency
Original: Smart home connects tens of home devices into the Internet, running a smart algorithm in the cloud that sends remote commands to the devices .
Revised: Smart home connects tens of home devices to the Internet, running a smart algorithm in the cloud that sends remote commands to the devices .
Edit intent: clarity
Original: Smart home connects tens of home devices into the Internet, running a smart algorithm in the cloud that sends remote commands to the devices .
Revised: Smart home connects tens of home devices into the Internet, where an IoT cloud runs various home automation applications .
Edit intent: clarity
Original:  While bringing unprecedented convenience , accessibility, and efficiency, it also introduces safety hazards to users.
Revised:  While bringing unprecedented convenience and accessibility, it also introduces safety hazards to users.
Edit intent: clarity
Original:  While bringing unprecedented convenience , accessibility, and efficiency, it also introduces safety hazards to users.
Revised:  While bringing unprecedented convenience , accessibility, and efficiency, it also introduces various security hazards to users.
Edit intent: clarity
Original:  Prior research studied smart home security from various aspects.
Revised:  Prior research studied smart home security from several aspects.
Edit intent: fluency
Original:  However, we found that the complexity of the interactions among the participating entities ( device, IoT cloud , and mobile app ) has not yet been systematically investigated.
Revised:  However, we found that the complexity of the interactions among the participating entities ( i.e., devices, IoT clouds , and mobile app ) has not yet been systematically investigated.
Edit intent: clarity
Original:  However, we found that the complexity of the interactions among the participating entities ( device, IoT cloud , and mobile app ) has not yet been systematically investigated.
Revised:  However, we found that the complexity of the interactions among the participating entities ( device, IoT cloud , and mobile apps ) has not yet been systematically investigated.
Edit intent: fluency
Original:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware reverse-engineering , network traffic interception, and black-box testing, we distill the general state transitions representing the complex interactions among the three entities.
Revised:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware analysis , network traffic interception, and black-box testing, we distill the general state transitions representing the complex interactions among the three entities.
Edit intent: clarity
Original:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware reverse-engineering , network traffic interception, and black-box testing, we distill the general state transitions representing the complex interactions among the three entities.
Revised:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware reverse-engineering , network traffic interception, and blackbox testing, we distill the general state transitions representing the complex interactions among the three entities.
Edit intent: fluency
Original:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware reverse-engineering , network traffic interception, and black-box testing, we distill the general state transitions representing the complex interactions among the three entities.
Revised:  In this work, we conducted an in-depth analysis to four widely used smart home solutions . Combining firmware reverse-engineering , network traffic interception, and black-box testing, we reverse-engineered the details of the interactions among the three entities.
Edit intent: clarity