wanyu/IteraTeR_v2 huggingface dataset:
Original:  Using the connection with unequal probability random sampling, we also highlight a confusion about the process via which nodes are selected on each time step, for which -- despite being implicitly indicated in the original paper -- current literature appears fragmented.
Revised:  Using the connection with unequal probability random sampling, we also highlight a confusion about the process via which nodes are selected on each time step, for which -- despite being implicitly indicated in the original paper - current literature appears fragmented.
Edit intent: fluency
Original:  We seek  conflict-free schedules in which the transit times of no two jobs on machines in close proximity intersect.
Revised:  We seek for conflict-free schedules in which the transit times of no two jobs on machines in close proximity intersect.
Edit intent: fluency
Original:  We show that, unless P = NP, the problem does not allow for a constant factor approximation even for(m^{1-\varepsilon})-approximation algorithm for any \varepsilon>0, even in the case of } identical jobs and every choice of fixed positive parameters, including the unit case.
Revised:  We show that, unless P = NP, the problem does not allow for a constant factor approximation even for(m^{1-\varepsilon})-approximation algorithm for any \varepsilon>0, even in the case of } identical jobs and every choice of fixed positive parameters, including the unit case.
Edit intent: fluency
Original:  We show that, unless P = NP, the problem does not allow for a constant factor approximation even for(m^{1-\varepsilon})-approximation algorithm for any \varepsilon>0, even in the case of } identical jobs and every choice of fixed positive parameters, including the unit case.
Revised:  We show that, unless P = NP does not allow for a constant factor approximation even for(m^{1-\varepsilon})-approximation algorithm for any \varepsilon>0, even in the case of } identical jobs and every choice of fixed positive parameters, including the unit case.
Edit intent: clarity
Original:  Moreover , we present optimal and near optimal schedules for unit jobs on several graph classes.
Revised:  Moreover , we present polynomial time algorithms to solve the problem for the case of unit jobs on several graph classes.
Edit intent: clarity
Original:  Moreover , we present optimal and near optimal schedules for unit jobs on several graph classes.
Revised:  Moreover , we present optimal and near optimal schedules for unit jobs on special graph classes.
Edit intent: clarity
Original:  Compared to the state-of-the-art techniques under different real-application traffics and configuration scenarios, AdEle improves the network latency by 14.9 \% on average (up to 21.4 \%) with less than 10.5 \% energy consumption overhead.
Revised:  Compared to the state-of- the-art techniques under different real-application traffics and configuration scenarios, AdEle improves the network latency by 14.9 \% on average (up to 21.4 \%) with less than 10.5 \% energy consumption overhead.
Edit intent: fluency
Original:  However, content delivery networks, DNS-based load balancing, co-hosting of different websites on the same server, and IP  churn, all contribute towards making domain-IP mappings unstable, and prevent straightforward IP-based browsing tracking for the majority of websites.
Revised:  However, content delivery networks, DNS-based load balancing, co-hosting of different websites on the same server, and IP address churn, all contribute towards making domain-IP mappings unstable, and prevent straightforward IP-based browsing tracking for the majority of websites.
Edit intent: clarity
Original:  We show that this instability is not a roadblock for browsing tracking (assuming a universal DoTH and ESNI deployment), by introducing an IP-based  fingerprinting technique that allows a network-level observer to identify  the website a user visits with high accuracy, based solely on the IP address information obtained from the encrypted traffic .
Revised:  We show that this instability is not a roadblock (assuming a universal DoTH and ESNI deployment), by introducing an IP-based fingerprinting technique that allows a network-level observer to identify the website a user visits with high accuracy, based solely on the IP address information obtained from the encrypted traffic .
Edit intent: clarity
Original:  We show that this instability is not a roadblock for browsing tracking (assuming a universal DoTH and ESNI deployment), by introducing an IP-based  fingerprinting technique that allows a network-level observer to identify  the website a user visits with high accuracy, based solely on the IP address information obtained from the encrypted traffic .
Revised:  We show that this instability is not a roadblock for browsing tracking (assuming a universal DoTH and ESNI deployment), by introducing an IP-based fingerprinting technique that allows a network-level observer to identify the website a user visits .
Edit intent: coherence
Original:  We also evaluated the fingerprints' robustness over time, and demonstrate that they are still effective at identifying 70\% of the tested websites after two months.
Revised:  We also evaluated the robustness of the generated fingerprints over time, and demonstrate that they are still effective at identifying 70\% of the tested websites after two months.
Edit intent: clarity
Original:  We also evaluated the fingerprints' robustness over time, and demonstrate that they are still effective at identifying 70\% of the tested websites after two months.
Revised:  We also evaluated the fingerprints' robustness over time, and demonstrate that they are still effective at successfully identifying about 70\% of the tested websites after two months.
Edit intent: clarity
Original:  We conclude by discussing strategies for website owners and hosting providers to hinder IP-based website fingerprinting and maximize the privacy benefits offered by domain name encryption .
Revised:  We conclude by discussing strategies for website owners and hosting providers towards hindering IP-based website fingerprinting and maximize the privacy benefits offered by domain name encryption .
Edit intent: clarity
Original:  We conclude by discussing strategies for website owners and hosting providers to hinder IP-based website fingerprinting and maximize the privacy benefits offered by domain name encryption .
Revised:  We conclude by discussing strategies for website owners and hosting providers to hinder IP-based website fingerprinting and maximizing the privacy benefits offered by domain name encryption .
Edit intent: fluency
Original: We generalize gradient descent with momentum for learning in differentiable games to have complex-valued momentum.
Revised: We generalize gradient descent with momentum for optimization in differentiable games to have complex-valued momentum.
Edit intent: clarity
Original:  We further argue that documenting the reasoning behind the respective decisions in the course of this process can help to build trust from the user through explaining and justifying the implemented fairness.
Revised:  We argue that documenting the reasoning behind the respective decisions in the course of this process can help to build trust from the user through explaining and justifying the implemented fairness.
Edit intent: clarity
Original:  Some of them are in conflict with each other and there is no uniformly accepted notion of fairness .
Revised:  Some of them are in conflict with each other . In the absence of an uniformly accepted notion of fairness .
Edit intent: clarity
Original:  The most appropriate fairness definition for an artificial intelligence system is often a matter of application and the right choice depends on ethical standards and legal requirements.
Revised:  The most appropriate fairness metric for a particular application? The answer is often a matter of application and the right choice depends on ethical standards and legal requirements.
Edit intent: clarity
Original:  The most appropriate fairness definition for an artificial intelligence system is often a matter of application and the right choice depends on ethical standards and legal requirements.
Revised:  The most appropriate fairness definition for an artificial intelligence system is often a matter of context, and the best choice depends on ethical standards and legal requirements.
Edit intent: clarity
Original:  Furthermore, we propose the "Fairness Compass", a tool which formalises the selection process and makes identifying the most appropriate fairness metric for a given system a simple, straightforward procedure.
Revised:  Furthermore, we propose the "Fairness Compass", a tool which formalises the selection process and makes identifying the most appropriate fairness definition for a given system a simple, straightforward procedure.
Edit intent: clarity
Original:  We argue that documenting the reasoning behind the respective decisions in the course of this process can help to build trust from the user through explaining and justifying the implemented fairness.
Revised:  Because this process also allows to document the reasoning behind the respective decisions in the course of this process can help to build trust from the user through explaining and justifying the implemented fairness.
Edit intent: clarity
Original:  We argue that documenting the reasoning behind the respective decisions in the course of this process can help to build trust from the user through explaining and justifying the implemented fairness.
Revised:  We argue that documenting the reasoning behind the respective decisions , we argue that this approach can help to build trust from the user through explaining and justifying the implemented fairness.
Edit intent: clarity
Original:  Here, we present two interface modules to facilitate a more intuitive assessment of model reliability.
Revised:  Here, we present two visual analytics modules that facilitate an intuitive assessment of model reliability.
Edit intent: clarity
Original:  Compared to a baseline feature importance interface, we find that 9 physicians are better able to align the model's uncertainty with clinically relevant factors and build intuition about its capabilities and limitations.
Revised:  Compared to a baseline feature importance interface, we find that 9 physicians are better able to align the model's uncertainty with domain-relevant factors and build intuition about its capabilities and limitations.
Edit intent: clarity
Original:  The parameter controlling the ratio of these two collision mechanisms is selected adaptively on every grid cell at every time step.
Revised:  The parameter controlling the ratio of the high-frequency part and the low-frequency part is selected adaptively on every grid cell at every time step.
Edit intent: clarity
Original:  This self-adaptation is based on a heuristic error indicator describing the difference between the model collision term and the original binary collision term.
Revised:  This self-adaptation is based on an error indicator describing the difference between the model collision term and the original binary collision term.
Edit intent: clarity
Original:  Our numerical experiments show that such  error indicator is effective and computationally affordable.
Revised:  Our numerical experiments show that such an error indicator is effective and computationally affordable.
Edit intent: fluency
Original:  The algorithm is adapted from [Zhou, Labahn  and Storjohann, Journal of Complexity, 2015], and we replace some of its intermediate steps with faster rectangular matrix multiplication algorithms.
Revised:  The algorithm is adapted from [Zhou, Labahn , and Storjohann, Journal of Complexity, 2015], and we replace some of its intermediate steps with faster rectangular matrix multiplication algorithms.
Edit intent: fluency
Original:  In this representation, range-restricted logic programs correspond to quantifier-free theories, making asymptotic quantifier results avilable for use.
Revised:  In this representation, determinate logic programs correspond to quantifier-free theories, making asymptotic quantifier results avilable for use.
Edit intent: clarity
Original:  In particular, the asymptotic behaviour of statistical relational representations has come under scrutiny, and projectivity was isolated as the strongest form of domain size independence .
Revised:  In particular, the asymptotic behaviour of statistical relational representations has come under scrutiny, and projectivity was investigated as the strongest form of domain size independence .
Edit intent: clarity
Original:   To facilitate the application of classical results from finite model theory, we introduce the abstract distribution semantics, defined as an arbitrary logical theory over probabilistic facts to bridge the gap to the distribution semantics underlying probabilistic logic programming.
Revised:  To facilitate the application of classical results from finite model theory, we introduce the abstract distribution semantics, defined as an arbitrary logical theory over probabilistic facts . This bridges the gap to the distribution semantics underlying probabilistic logic programming.
Edit intent: coherence
Original:  We demonstrate empirically that CRaWl matches or outperforms state-of-the-art GNN architectures across a multitude of benchmark datasets for graph learning .
Revised:  We demonstrate empirically that CRaWl matches or outperforms state-of-the-art GNN architectures across a multitude of benchmark datasets for classification and regression on graphs .
Edit intent: clarity
Original:  Through forecasting experiments using deep neural networks, we show that while MBO-driven and LOB-driven models individually provide similar performance, ensembles of the two can lead to improvements in forecasting accuracy -- indicating that MBO data is additive to LOB-based features.
Revised:  Through forecasting experiments using deep neural networks, we show that while MBO-driven and LOB-driven models individually provide similar performance, ensembles of the two can lead to improvements in forecasting accuracy - indicating that MBO data is additive to LOB-based features.
Edit intent: fluency
Original: Spherical Mat\'ern--Whittle Gaussian random fields are considered as solutions to fractional elliptic stochastic partial differential equations on the sphere.
Revised: Spherical Whittle--Mat\'ern Gaussian random fields are considered as solutions to fractional elliptic stochastic partial differential equations on the sphere.
Edit intent: fluency
Original:  There is a majority of well-behaving agents, but since voting is costly, they may want to abstain or delegate their vote to other agents  . Misbehaving agents always vote.
Revised:  There is a majority of well-behaving agents, but they may abstain or delegate their vote to other agents . Misbehaving agents always vote.
Edit intent: clarity
Original:  There is a majority of well-behaving agents, but since voting is costly, they may want to abstain or delegate their vote to other agents  . Misbehaving agents always vote.
Revised:  There is a majority of well-behaving agents, but since voting is costly, they may want to abstain or delegate their vote to other agents since voting is costly . Misbehaving agents always vote.
Edit intent: coherence
Original:  Preferences of voters are private information and a positive outcome is achieved if well-behaving voters win.
Revised:  Preferences of voters are private information and a positive outcome is achieved if well-behaving agents win.
Edit intent: clarity
Original:  Third, if #X is low, delegation delivers a positive outcome with a higher probability than conventional voting.
Revised:  Third, if #X is low, delegation delivers a positive outcome with higher probability than conventional voting.
Edit intent: fluency
Original:  Large amounts of (private) domestic or urban audio data  raise significant logistical and privacy concerns.
Revised:  The large amounts of (private) domestic or urban audio data raise significant logistical and privacy concerns.
Edit intent: coherence
Original:  The inherently distributed nature of these tasks, make federated learning (FL) a promising approach to take advantage of large-scale data while mitigating privacy issues.
Revised:  The inherently distributed nature of these tasks, make federated learning (FL) a promising approach to take advantage of largescale data while mitigating privacy issues.
Edit intent: fluency
Original:  However, when the fraction of delegators increases, the probability that the ex-ante minority wins under free and capped delegation converges to the one under conventional voting--albeit non-monotonically.
Revised:  However, when the number of delegators increases, the probability that the ex-ante minority wins under free and capped delegation converges to the one under conventional voting--albeit non-monotonically.
Edit intent: clarity
Original:  The same--but to a lesser degree--occurs if the number of voting rights  actual voters can have is capped.
Revised:  The same occurs if the number of voting rights actual voters can have is capped.
Edit intent: clarity
Original:  The same--but to a lesser degree--occurs if the number of voting rights  actual voters can have is capped.
Revised:  The same--but to a lesser degree--occurs if the number of voting rights that actual voters can have is capped.
Edit intent: fluency
Original:  However, when the number of delegators increases, the probability that the ex-ante minority wins under free and capped delegation converges to the one under conventional voting--albeit non-monotonically.
Revised:  When the number of delegators increases, the probability that the ex-ante minority wins under free and capped delegation converges to the one under conventional voting--albeit non-monotonically.
Edit intent: coherence
Original:  We introduce a novel fingerprinting method, IoTDevID, for device identification that uses machine learning to model the behaviour of IoT devices based on network packets.
Revised:  In this study, we present a machine learning-based method, IoTDevID, for device identification that uses machine learning to model the behaviour of IoT devices based on network packets.
Edit intent: clarity
Original:  We introduce a novel fingerprinting method, IoTDevID, for device identification that uses machine learning to model the behaviour of IoT devices based on network packets.
Revised:  We introduce a novel fingerprinting method, IoTDevID, that recognizes devices through characteristics of their network packets.
Edit intent: clarity
Original: We consider the problem of maximizing social welfare by allocating indivisible items to a set of agents subject to network externalities.
Revised: We consider the problem of allocating multiple indivisible items to a set of agents subject to network externalities.
Edit intent: clarity
Original: We consider the problem of maximizing social welfare by allocating indivisible items to a set of agents subject to network externalities.
Revised: We consider the problem of maximizing social welfare by allocating indivisible items to a set of networked agents to maximize the social welfare subject to network externalities.
Edit intent: clarity
Original:   We first provide a general formulation that captures some of the known models as a special case.
Revised:  We first provide a general formulation that captures some of the existing models as a special case.
Edit intent: clarity
Original:  That allows us to devise simple polynomial-time approximation algorithms using Lov\'asz extension and multilinear extension of the objective function .
Revised:  That allows us to devise polynomial-time approximation algorithms using Lov\'asz extension and multilinear extension of the objective function .
Edit intent: clarity
Original:  That allows us to devise simple polynomial-time approximation algorithms using Lov\'asz extension and multilinear extension of the objective function .
Revised:  That allows us to devise simple polynomial-time approximation algorithms using the Lovasz extension and multilinear extension of the objective function .
Edit intent: fluency
Original:  That allows us to devise simple polynomial-time approximation algorithms using Lov\'asz extension and multilinear extension of the objective function .
Revised:  That allows us to devise simple polynomial-time approximation algorithms using Lov\'asz extension and multilinear extension of the objective functions .
Edit intent: fluency
Original:  Our principled approach recovers or improves some of the existing algorithms and provides a simple unifying method for maximizing social welfare subject to network externalities.
Revised:  Our principled approach recovers or improves some of the existing algorithms and provides a simple and unifying framework for maximizing social welfare subject to network externalities.
Edit intent: clarity
Original:  A formal analysis will show the dependence of this confound on the temporal correlation model of the sequential observations, motivating a data-driven approach that avoids the problem of misspecification of this model.
Revised:  A formal analysis will show the existence of a dependency of this confound on the temporal correlation model of the sequential observations, motivating a data-driven approach that avoids the problem of misspecification of this model.
Edit intent: clarity
Original:  However, where the autocorrelation locally diverges from the volume average , bias may be difficult to control for exactly (local bias) , given the difficulties of estimating the precise form of the confound at each voxel.
Revised:  However, where the autocorrelation locally diverges from its volume estimate , bias may be difficult to control for exactly (local bias) , given the difficulties of estimating the precise form of the confound at each voxel.
Edit intent: clarity
Original:  However, where the autocorrelation locally diverges from the volume average , bias may be difficult to control for exactly (local bias) , given the difficulties of estimating the precise form of the confound at each voxel.
Revised:  However, where the autocorrelation locally diverges from the volume average , bias may be difficult to control for exactly , given the difficulties of estimating the precise form of the confound at each voxel.
Edit intent: coherence
Original: The number of connected Internet of Things (IoT) devices  grows at an increasing rate , revealing shortcomings of current IoT networks for cyber-physical infrastructure systems to cope with ensuing device management and security issues.
Revised: The number of connected Internet of Things (IoT) devices within cyber-physical infrastructure systems grows at an increasing rate , revealing shortcomings of current IoT networks for cyber-physical infrastructure systems to cope with ensuing device management and security issues.
Edit intent: clarity
Original: The number of connected Internet of Things (IoT) devices  grows at an increasing rate , revealing shortcomings of current IoT networks for cyber-physical infrastructure systems to cope with ensuing device management and security issues.
Revised: The number of connected Internet of Things (IoT) devices grows at an increasing rate . This poses significant device management and security challenges to current IoT networks for cyber-physical infrastructure systems to cope with ensuing device management and security issues.
Edit intent: clarity
Original: The number of connected Internet of Things (IoT) devices  grows at an increasing rate , revealing shortcomings of current IoT networks for cyber-physical infrastructure systems to cope with ensuing device management and security issues.
Revised: The number of connected Internet of Things (IoT) devices grows at an increasing rate , revealing shortcomings of current IoT networks . Among several approaches to cope with ensuing device management and security issues.
Edit intent: clarity