wanyu/IteraTeR_v2 huggingface dataset:
Original:  BGRL outperforms or matches the previous unsupervised state-of-the-art results on several established benchmark datasets.
Revised:  BGRL outperforms or matches prior methods on several established benchmark datasets.
Edit intent: clarity
Original: A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG) , motivated by a practical application in computer network security . MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for anomaly detection when assessing the significance of previously unobserved connections.
Revised: A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG) . MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for anomaly detection when assessing the significance of previously unobserved connections.
Edit intent: clarity
Original: A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG) , motivated by a practical application in computer network security . MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for anomaly detection when assessing the significance of previously unobserved connections.
Revised: A new class of models for dynamic networks is proposed, called mutually exciting point process graphs (MEG) , motivated by a practical application in computer network security . MEG is a scalable network-wide statistical model for point processes with dyadic marks, which can be used for anomaly detection when assessing the significance future events, including previously unobserved connections.
Edit intent: clarity
Original:  The model is tested on simulated graphs and real world computer network datasets, demonstrating excellent performance.
Revised:  The model is tested on simulated graphs and real world datasets, demonstrating excellent performance.
Edit intent: clarity
Original:  But what does this statement mean?
Revised:  But what do these statements mean? The reasons to call some neural activity a representation and the assumptions that come with this term are not generally made clear from its common uses in neuroscience.
Edit intent: coherence
Original:  Representation is a philosophical concept with a rich history going back at least to Aristotle.
Revised:  Representation is a central concept in philosophy of mind, with a rich history going back at least to Aristotle.
Edit intent: clarity
Original:  Finally, we propose a hybrid semantic web agent architecture, discuss the role played by existing semantic web standards, and point to existing work in the broader semantic web community any beyond that could help us to make the semantic web agent vision a reality.
Revised:  Finally, we propose a hybrid semantic web agent architecture, discuss the role played by existing semantic web standards, and point to existing work in the broader semantic web community and beyond that could help us to make the semantic web agent vision a reality.
Edit intent: clarity
Original: Semantic web technologies have shown their effectiveness, especially when it comes to knowledge representation, reasoning, and data integrations .
Revised: Semantic web technologies have shown their effectiveness, especially when it comes to knowledge representation, reasoning, and data integration .
Edit intent: fluency
Original:  Following on from this, we use the identified requirements to both further elaborate on the semantic web agent motivating use case scenario, and to summarise different perspectives on the requirements when it comes to semantic web agent literature.
Revised:  Following on from this, we use the identified requirements to both further elaborate on the semantic web agent motivating use case scenario, and to summarise different perspectives on the requirements from the semantic web agent literature.
Edit intent: clarity
Original:  We subsequently propose a hybrid semantic web agent architecture, and use the various components and subcomponents in order to provide a focused discussion on the role played by existing semantic web standards and community activities.
Revised:  We subsequently propose a hybrid semantic web agent architecture, and use the various components and subcomponents in order to provide a focused discussion in relation to existing semantic web standards and community activities.
Edit intent: clarity
Original: In society, many of our routines and activities are linked to our ability to move;
Revised: Many of our routines and activities are linked to our ability to move;
Edit intent: clarity
Original:  In this work, we leverage on a combination of computational, statistical  and information-theoretical approaches to investigate the existence of systematic discrepancies in the mobility diversity (i.e. the diversity of travel destinations) of (1) men and women from different socioeconomic backgrounds, and (2) work and non-work travels.
Revised:  In this work, we leverage on a combination of computational, statistical , and information-theoretical approaches to investigate the existence of systematic discrepancies in the mobility diversity (i.e. the diversity of travel destinations) of (1) men and women from different socioeconomic backgrounds, and (2) work and non-work travels.
Edit intent: fluency
Original:  In this paper we study the expressive power of NNs with rectified linear units from a combinatorial optimization perspective.
Revised:  In order to study the expressive power of NNs with rectified linear units from a combinatorial optimization perspective.
Edit intent: coherence
Original:  We then design a MAAP to exactly solve the Maximum Flow Problem, which translates to an NN of size O(m^2 n^2) .
Revised:  We then design MAAPs that exactly solve the Maximum Flow Problem, which translates to an NN of size O(m^2 n^2) .
Edit intent: fluency
Original:  In order to study the expressive power of NNs with rectified linear units , we propose to view them as a model of computation and investigate the complexity of combinatorial optimization problems in that model.
Revised:  In order to study the expressive power of NNs with rectified linear units . To study them as a model of computation and investigate the complexity of combinatorial optimization problems in that model.
Edit intent: coherence
Original:  Using a result from arithmetic circuit complexity , we show as a first immediate result that the value of a minimum spanning tree in a graph with n nodes can be computed by an NN of size O(n^3) .
Revised:  Using a result from arithmetic circuit complexity , we show as a first immediate result that the value of a minimum spanning tree in a graph with n nodes , there is an NN of size O(n^3) .
Edit intent: clarity
Original:  Our primary result, however, is that , given a directed graph with n nodes and m arcs, there exists an NN of size O(m^2n^2) that computes a maximum flow from any possible real-valued arc capacities as input .
Revised:  Our primary result, however, is that , given a directed graph with n nodes and m arcs, there is an NN of size O(m^2n^2) that computes a maximum flow from any possible real-valued arc capacities as input .
Edit intent: clarity
Original:  Our primary result, however, is that , given a directed graph with n nodes and m arcs, there exists an NN of size O(m^2n^2) that computes a maximum flow from any possible real-valued arc capacities as input .
Revised:  Our primary result, however, is that , given a directed graph with n nodes and m arcs, there exists an NN of size O(m^2n^2) that takes the arc capacities as input .
Edit intent: clarity
Original:  Some of these problems, such as matrix and array scaling, are convex in the Euclidean sense, but others such as operator scaling and tensor scaling are geodesically convex on a different Riemannian manifold.
Revised:  Some of these problems, such as matrix and array scaling, are convex in the Euclidean sense, but others such as operator scaling and tensor scaling are geodesically convex on a different Riemannian manifold.
Edit intent: fluency
Original:  We show that this is not the case by exhibiting instances with exponential diameter bound : we construct polynomial-size instances of 3-dimensional array scaling and 3-tensor scaling whose approximate solutions all have doubly exponential condition number.
Revised:  We show that this is not the case by exhibiting instances with exponential diameter bound : we construct polynomial-size instances of 3-dimensional array scaling and 3-tensor scaling whose approximate solutions all have doubly exponential condition number.
Edit intent: fluency
Original:  The two-scale feature is characterized by the property that the center of the traveling wave approaches to the origin at a slower rate than the rate of the collapse of the singularity.
Revised:  The two-scale feature is characterized by the property that the center of the traveling wave approaches the origin at a slower rate than the rate of the collapse of the singularity.
Edit intent: fluency
Original: Pulmonary hypertension (PH) is a debilitating disease that includes five main subgroups, but only one is curable: chronic thromboembolic pulmonary hypertension (CTEPH) . CTEPH is caused by recurrent or unresolved pulmonary thromboemboli, leading to perfusion defects and increased arterial wave reflections.
Revised: Chronic thromboembolic pulmonary hypertension (CTEPH) . CTEPH is caused by recurrent or unresolved pulmonary thromboemboli, leading to perfusion defects and increased arterial wave reflections.
Edit intent: coherence
Original: Pulmonary hypertension (PH) is a debilitating disease that includes five main subgroups, but only one is curable: chronic thromboembolic pulmonary hypertension (CTEPH) . CTEPH is caused by recurrent or unresolved pulmonary thromboemboli, leading to perfusion defects and increased arterial wave reflections.
Revised: Pulmonary hypertension (PH) is a debilitating disease that includes five main subgroups, but only one is curable: chronic thromboembolic pulmonary hypertension (CTEPH) is caused by recurrent or unresolved pulmonary thromboemboli, leading to perfusion defects and increased arterial wave reflections.
Edit intent: fluency
Original:  Instead, they are treated with balloon pulmonary angioplasty (BPA), a multi-session  surgery that disrupts the thromboembolic material  using a catheter balloon.
Revised:  Instead, these patients undergo balloon pulmonary angioplasty (BPA), a multi-session surgery that disrupts the thromboembolic material using a catheter balloon.
Edit intent: clarity
Original:  The goal of BPA is to reduce pulmonary arterial pressure and reestablish adequate blood flow to all regions of the lung.
Edit intent: coherence
Original:  However, there still lacks an integrative, holistic tool for identifying  target lesions for optimal treatment.
Revised:  However, there still lacks an integrative, holistic tool for identifying target lesions for treatment.
Edit intent: clarity
Original:  To address this insufficiency, we provide a proof of concept study simulating CTEPH hemodynamics and BPA therapy using a multiscale , one-dimensional (1D) fluid dynamics model.
Revised:  To address this insufficiency, we simulate CTEPH hemodynamics and BPA therapy using a multiscale , one-dimensional (1D) fluid dynamics model.
Edit intent: clarity
Original:  To address this insufficiency, we provide a proof of concept study simulating CTEPH hemodynamics and BPA therapy using a multiscale , one-dimensional (1D) fluid dynamics model.
Revised:  To address this insufficiency, we provide a proof of concept study simulating CTEPH hemodynamics and BPA therapy using a multiscale fluid dynamics model.
Edit intent: coherence
Original:  The large pulmonary arterial geometry is derived from a computed tomography (CT) image, whereas a structured tree represents the small vessels.
Revised:  The large pulmonary arterial geometry is derived from a computed tomography (CT) image, whereas a fractal tree represents the small vessels.
Edit intent: clarity
Original:  the latter includes 20 large artery lesions and introduces both local and global vascular remodeling.
Revised:  the latter includes both large artery lesions and introduces both local and global vascular remodeling.
Edit intent: clarity
Original:  the latter includes 20 large artery lesions and introduces both local and global vascular remodeling.
Revised:  the latter includes 20 large artery lesions and vascular remodeling.
Edit intent: clarity
Original: This paper is devoted , mainly, to show that the last quarter of the past century can be considered as the golden age of the Mathematical Finance.
Revised: This paper is devoted to show that the last quarter of the past century can be considered as the golden age of the Mathematical Finance.
Edit intent: coherence
Original:  They established the two fundamentals theorems of arbitrage theory, close formulas for options, the main modelling approaches and created the appropriate framework for the posterior development.12
Revised:  They established the two fundamentals theorems of arbitrage theory, close formulas for options, the main modelling a
Edit intent: coherence
Original: This paper considers decentralized stochastic optimization over a network of ~ n nodes, where each node possesses a smooth non-convex local cost function and the goal of the networked nodes is to find an ~ \epsilon-accurate first-order stationary point of the sum of the local costs.
Revised: This paper considers decentralized stochastic optimization over a network of n nodes, where each node possesses a smooth non-convex local cost function and the goal of the networked nodes is to find an ~ \epsilon-accurate first-order stationary point of the sum of the local costs.
Edit intent: fluency
Original: This paper considers decentralized stochastic optimization over a network of ~ n nodes, where each node possesses a smooth non-convex local cost function and the goal of the networked nodes is to find an ~ \epsilon-accurate first-order stationary point of the sum of the local costs.
Revised: This paper considers decentralized stochastic optimization over a network of ~ n nodes, where each node possesses a smooth non-convex local cost function and the goal of the networked nodes is to find an \epsilon-accurate first-order stationary point of the sum of the local costs.
Edit intent: fluency
Original:  In this context, we propose a novel single-loop decentralized hybrid variance-reduced stochastic gradient method, called GT-HSGD , that outperforms the existing approaches in terms of both the oracle complexity and practical implementation.
Revised:  In this context, we propose a novel single-loop decentralized hybrid variance-reduced stochastic gradient method, called GT-HSGD , that outperforms the existing approaches in terms of both the oracle complexity and practical implementation.
Edit intent: fluency
Original:  The GT-HSGD algorithm implements specialized local hybrid stochastic gradient estimators that are fused over the network to track the global gradient.
Revised:  The GT-HSGD algorithm implements specialized local hybrid stochastic gradient estimators that are fused over the network to track the global gradient.
Edit intent: fluency
Original:  Remarkably, GT-HSGD achieves a network-independent oracle complexity of ~ O(n^{-1}\epsilon^{-3}) when the required error tolerance ~ \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Revised:  Remarkably, achieves a network-independent oracle complexity of ~ O(n^{-1}\epsilon^{-3}) when the required error tolerance ~ \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Edit intent: clarity
Original:  Remarkably, GT-HSGD achieves a network-independent oracle complexity of ~ O(n^{-1}\epsilon^{-3}) when the required error tolerance ~ \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Revised:  Remarkably, GT-HSGD achieves a network-independent oracle complexity of O(n^{-1}\epsilon^{-3}) when the required error tolerance ~ \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Edit intent: fluency
Original:  Remarkably, GT-HSGD achieves a network-independent oracle complexity of ~ O(n^{-1}\epsilon^{-3}) when the required error tolerance ~ \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Revised:  Remarkably, GT-HSGD achieves a network-independent oracle complexity of ~ O(n^{-1}\epsilon^{-3}) when the required error tolerance \epsilon is small enough, leading to a linear speedup with respect to the centralized optimal online variance-reduced approaches that operate on a single node.
Edit intent: fluency
Original:  Various research communities are contributing methods for ITL and a large subset of this research is robot-centered with a focus on developing algorithms that can learn online, quickly.
Revised:  Various research communities are contributing methods for ITL and a large subset of this research is robot-centered with a focus on developing algorithms that can learn online, quickly.
Edit intent: fluency
Original:  This paper studies the ITL problem from a human-centered perspective to provide guidance for robot design so that human teachers can interact with ITL robotsnaturally .
Revised:  This paper studies the ITL problem from a human-centered perspective to provide guidance for robot design so that human teachers can interact with ITL robotsnaturally .
Edit intent: fluency
Original:  This paper studies the ITL problem from a human-centered perspective to provide guidance for robot design so that human teachers can interact with ITL robotsnaturally .
Revised:  This paper studies the ITL problem from a human-centered perspective to provide guidance for robot design so that human teachers can naturally teach ITL robots .
Edit intent: clarity
Original:  In this paper, we present 1) a cognitive task analysis of an interactive teaching study (N=10) that extracts and classify various actions intended and executed by human teachers when teaching a robot;
Revised:  In this paper, we present 1) a cognitive task analysis of an interactive teaching study (N=10) through which we characterize various aspects of actions intended and executed by human teachers when teaching a robot;
Edit intent: clarity
Original:  2)  in-depth discussion of the teaching approach employed by two participants to understand the need for personal adaptation to individual  styles;
Revised:  2) an in-depth discussion of the teaching approach employed by two participants to understand the need for personal adaptation to individual styles;
Edit intent: fluency
Original:  2)  in-depth discussion of the teaching approach employed by two participants to understand the need for personal adaptation to individual  styles;
Revised:  2) in-depth discussion of the teaching approach employed by two participants to understand the need for personal adaptation to individual teaching styles;
Edit intent: fluency
Original:  and 3) requirements for ITL robot design based on our analyses informed by plan-based theories of dialogue, specifically SharedPlans.
Revised:  and 3) requirements for ITL robot design based on our analyses and informed by a computational theory of collaborative interactions, SharedPlans.
Edit intent: clarity
Original:  We also observe that the opinions of individuals can sometimes jump from one opinion cluster to another in a single time step, a phenomenon (which we call "opinion jumping" ) that is not possible in standard dyadic BCMs.
Revised:  We demonstrate that the opinions of individuals can sometimes jump from one opinion cluster to another in a single time step, a phenomenon (which we call "opinion jumping" ) that is not possible in standard dyadic BCMs.
Edit intent: clarity
Original:  We also observe that the opinions of individuals can sometimes jump from one opinion cluster to another in a single time step, a phenomenon (which we call "opinion jumping" ) that is not possible in standard dyadic BCMs.
Revised:  We also observe that the opinions of individuals can sometimes jump from one opinion cluster to another in a single time step, a phenomenon (which we call ``opinion jumping'' ) that is not possible in standard dyadic BCMs.
Edit intent: fluency
Original:  We also show that there is a phase transition in the convergence time on the complete hypergraph when the variance \sigma^2 of the initial opinion distribution equals the confidence bound c  . Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
Revised:  Additionally, we observe that there is a phase transition in the convergence time on the complete hypergraph when the variance \sigma^2 of the initial opinion distribution equals the confidence bound c . Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
Edit intent: coherence
Original:  We also show that there is a phase transition in the convergence time on the complete hypergraph when the variance \sigma^2 of the initial opinion distribution equals the confidence bound c  . Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
Revised:  We also show that there is a phase transition in the convergence time on a complete hypergraph when the variance \sigma^2 of the initial opinion distribution equals the confidence bound c . Therefore, to determine the convergence properties of our hypergraph BCM when the variance and the number of hyperedges are both large, it is necessary to use analytical methods instead of relying only on Monte Carlo simulations.
Edit intent: fluency
Original: Data hiding is a technique to embed secret data into cover multimedia for covert communication.
Revised: Data hiding is referred to as the art of hiding secret data into cover multimedia for covert communication.
Edit intent: clarity
Original: Data hiding is a technique to embed secret data into cover multimedia for covert communication.
Revised: Data hiding is a technique to embed secret data into a digital cover for covert communication.
Edit intent: clarity
Original:  In this letter, we propose a  method to disguise the data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with  ordinary task.
Revised:  In this letter, we propose a novel method to disguise the data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with ordinary task.
Edit intent: clarity
Original:  In this letter, we propose a  method to disguise the data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with  ordinary task.
Revised:  In this letter, we propose a method to disguise data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with ordinary task.
Edit intent: fluency
Original:  In this letter, we propose a  method to disguise the data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with  ordinary task.
Revised:  In this letter, we propose a method to disguise the data hiding tools, including a data embedding tool and a data extraction tool, as a deep neural network (DNN) with an ordinary task.
Edit intent: fluency