wanyu/IteraTeR_v2 huggingface dataset:
Original:  In particular, we show a symmetric algorithm for proportional cake-cutting, an algorithm for 1-out-of-(2n-2) maximin-share allocation of discrete goods, and an algorithm for 1-out-of-%DIFDELCMD < \lfloor %%%  2n/3 %DIFDELCMD < \rfloor %%%  maximin-share allocation of discrete bads (chores) among n agents.
Revised:  In particular, we show a symmetric algorithm for proportional cake-cutting, an algorithm for 1-out-of-(2n-2) maximin-share allocation of discrete goods, and an algorithm for 1-out-of-%DIFDELCMD < \lfloor %%% 2n/3 %DIFDELCMD < \rfloor %%% ) maximin-share allocation of discrete bads (chores) among n agents.
Edit intent: fluency
Original:  In particular, we show a symmetric algorithm for proportional cake-cutting, an algorithm for 1-out-of-(2n-2) maximin-share allocation of discrete goods, and an algorithm for 1-out-of-%DIFDELCMD < \lfloor %%%  2n/3 %DIFDELCMD < \rfloor %%%  maximin-share allocation of discrete bads (chores) among n agents.
Revised:  In particular, we show a symmetric algorithm for proportional cake-cutting, an algorithm for 1-out-of-(2n-2) maximin-share allocation of discrete goods, and an algorithm for 1-out-of-%DIFDELCMD < \lfloor %%% 2n/3 %DIFDELCMD < \rfloor %%% maximin-share allocation of discrete bads among n agents.
Edit intent: clarity
Original:  This paper proposes a sound procedure to verify properties of communicating session automata (CSA), i.e., communicating automata that correspond to multiparty session types.
Revised:  This paper proposes a sound procedure to verify properties of communicating session automata (CSA), i.e., communicating automata that include multiparty session types.
Edit intent: clarity
Original:  We show that k-exhaustive systems soundly and completely characterise systems where each automaton behaves uniformly for any bound greater or equal to k.
Revised:  We show that k-exhaustive systems soundly and completely characterises systems where each automaton behaves uniformly for any bound greater or equal to k.
Edit intent: fluency
Original:  We show that k-exhaustive systems soundly and completely characterise systems where each automaton behaves uniformly for any bound greater or equal to k.
Revised:  We show that k-exhaustive systems soundly and completely characterise systems where each automaton behaves equivalently under bounds greater than or equal to k.
Edit intent: clarity
Original:  We show that checking k-MC is PSPACE-complete, but can be done efficiently over large systems by using partial order reduction techniques.
Revised:  We show that checking k-MC is PSPACE-complete, and demonstrate its performance empirically over large systems by using partial order reduction techniques.
Edit intent: clarity
Original:  We show that checking k-MC is PSPACE-complete, but can be done efficiently over large systems by using partial order reduction techniques.
Revised:  We show that checking k-MC is PSPACE-complete, but can be done efficiently over large systems using partial order reduction techniques.
Edit intent: fluency
Original: This paper is devoted to the construction of structure preserving stochastic Galerkin schemes for Fokker-Planck type equations with uncertainties and interacting with an external distribution called the background .
Revised: This paper is devoted to the construction of structure preserving stochastic Galerkin schemes for Fokker-Planck type equations with uncertainties and interacting with an external distribution , that we refer to as a background distribution .
Edit intent: clarity
Original: We present a consistent neural network based calibration method for a number of volatility models -- including the rough volatility family -- that performs the calibration task within a few milliseconds for the full implied volatility surface.
Revised: We present a neural network based calibration method for a number of volatility models -- including the rough volatility family -- that performs the calibration task within a few milliseconds for the full implied volatility surface.
Edit intent: clarity
Original: We present a consistent neural network based calibration method for a number of volatility models -- including the rough volatility family -- that performs the calibration task within a few milliseconds for the full implied volatility surface.
Revised: We present a consistent neural network based calibration method that performs the calibration task within a few milliseconds for the full implied volatility surface.
Edit intent: clarity
Original:  As customary for machine learning, the form in which information from available data is extracted and stored is crucial for network performance.
Revised:  The form in which information from available data is extracted and stored is crucial for network performance.
Edit intent: clarity
Original: The citation impact of scientific publications is usually seen as a one-dimensional concept.
Revised: The citation impact of a scientific publication is usually seen as a one-dimensional concept.
Edit intent: fluency
Original:  We introduce a three-dimensional perspective on the citation impact of publications .
Revised:  We introduce a multi-dimensional framework on the citation impact of publications .
Edit intent: clarity
Original:  We introduce a three-dimensional perspective on the citation impact of publications .
Revised:  We introduce a three-dimensional perspective on the citation impact of a publication .
Edit intent: fluency
Original:  This enables us to make a distinction between publications that have a deep impact concentrated in one specific field of research and publications that have a broad impact scattered over different research fields .
Revised:  This enables us to distinguish between publications that have a deep impact concentrated in one specific field of research and publications that have a broad impact scattered over different research fields .
Edit intent: clarity
Original:  This enables us to make a distinction between publications that have a deep impact concentrated in one specific field of research and publications that have a broad impact scattered over different research fields .
Revised:  This enables us to make a distinction between publications that have a deep impact concentrated in one specific research field and publications that have a broad impact scattered over different research fields .
Edit intent: clarity
Original:  This enables us to make a distinction between publications that have a deep impact concentrated in one specific field of research and publications that have a broad impact scattered over different research fields .
Revised:  This enables us to make a distinction between publications that have a deep impact concentrated in one specific field of research and publications that have a broad impact extending beyond a single research field .
Edit intent: clarity
Original:  It also allows us to distinguish between publications that are strongly dependent on earlier work and publications that make a more independent scientific contribution.
Revised:  It also allows us to make a distinction between publications that are strongly dependent on earlier work and publications that make a more independent scientific contribution.
Edit intent: fluency
Original:  We present a large-scale empirical analysis of the level, depth, and dependence of the citation impact of publications .
Revised:  Based on our multi-dimensional citation impact framework, we analyze the citation impact of publications .
Edit intent: clarity
Original:  In addition, we report a case study focusing on publications in the field of scientometrics.
Revised:  In addition, we present a case study focusing on publications in the field of scientometrics.
Edit intent: fluency
Original:  In addition, we report a case study focusing on publications in the field of scientometrics.
Revised:  In addition, we report a case study focusing on the field of scientometrics.
Edit intent: clarity
Original:  Our three-dimensional citation impact framework provides a more detailed understanding of the citation impact of a publication than a traditional one-dimensional perspective.
Revised:  The proposed citation impact framework provides a more detailed understanding of the citation impact of a publication than a traditional one-dimensional perspective.
Edit intent: clarity
Original:  We introduce a multi-dimensional framework on the citation impact of a publication.
Revised:  We introduce a multi-dimensional framework for characterizing the citation impact of a publication.
Edit intent: clarity
Original:  This enables us to distinguish between publications that have a deep impact concentrated in one specific research field and publications that have a broad impact extending beyond a single research field .
Revised:  This enables us to distinguish between publications that have a deep citation impact in a relatively narrow research area and publications that have a broad impact extending beyond a single research field .
Edit intent: clarity
Original:  This enables us to distinguish between publications that have a deep impact concentrated in one specific research field and publications that have a broad impact extending beyond a single research field .
Revised:  This enables us to distinguish between publications that have a deep impact concentrated in one specific research field and publications that have a broad citation impact in a wider research area .
Edit intent: clarity
Original:  Based on our multi-dimensional citation impact framework , we analyze the citation impact of highly cited publications in all scientific disciplines.
Revised:  We use our multi-dimensional citation impact framework , we analyze the citation impact of highly cited publications in all scientific disciplines.
Edit intent: coherence
Original:  In addition, we present a  case study focusing on the field of scientometrics.
Revised:  In addition, we present a detailed case study focusing on the field of scientometrics.
Edit intent: clarity
Original:  The proposed citation impact framework provides a more detailed understanding of the citation impact of a publication than a traditional one-dimensional perspective.
Revised:  The proposed citation impact framework provides a more in-depth understanding of the citation impact of a publication than a traditional one-dimensional perspective.
Edit intent: clarity
Original:  The proposed framework enables us to distinguish between publications that have a deep citation impact  in a relatively narrow research area  and publications that have a broad citation impact in a wider research area .
Revised:  The proposed framework distinguishes between publications that have a deep citation impact in a relatively narrow research area and publications that have a broad citation impact in a wider research area .
Edit intent: coherence
Original:  The proposed framework enables us to distinguish between publications that have a deep citation impact  in a relatively narrow research area  and publications that have a broad citation impact in a wider research area .
Revised:  The proposed framework enables us to distinguish between publications that have a deep citation impact in a relatively narrow research area , and publications that have a broad citation impact in a wider research area .
Edit intent: fluency
Original:  It also allows us to make a distinction between publications that are strongly dependent on earlier work and publications that make a more independent scientific contribution.
Revised:  It also makes a distinction between publications that are strongly dependent on earlier work and publications that make a more independent scientific contribution.
Edit intent: coherence
Original:  United State possesses the largest economy in the world , and thus serves as an ideal representation to investigate the motility model for the developed country . Early surveillance of the causes of death is critical which can allow the preparation of preventive steps against critical disease such as dengue fever.
Revised:  United State possesses the largest economy in the world and thus serves as an ideal representation to investigate the motility model for the developed country . Early surveillance of the causes of death is critical which can allow the preparation of preventive steps against critical disease such as dengue fever.
Edit intent: fluency
Original:  United State possesses the largest economy in the world , and thus serves as an ideal representation to investigate the motility model for the developed country . Early surveillance of the causes of death is critical which can allow the preparation of preventive steps against critical disease such as dengue fever.
Revised:  United State possesses the largest economy in the world , and thus serves as an ideal representation , is investigated . Early surveillance of the causes of death is critical which can allow the preparation of preventive steps against critical disease such as dengue fever.
Edit intent: clarity
Original:  The results include (1) the decoding trend, (2) the features importance, and (3) the accuracy of the decoding patterns.
Revised:  The results include the decoding trend, (2) the features importance, and (3) the accuracy of the decoding patterns.
Edit intent: fluency
Original:  The results include (1) the decoding trend, (2) the features importance, and (3) the accuracy of the decoding patterns.
Revised:  The results include (1) the decoding trend, the features importance, and (3) the accuracy of the decoding patterns.
Edit intent: coherence
Original:  The results include (1) the decoding trend, (2) the features importance, and (3) the accuracy of the decoding patterns.
Revised:  The results include (1) the decoding trend, (2) the features importance, and the accuracy of the decoding patterns.
Edit intent: coherence
Original:  Three scenarios regard predictors include the use of (1) all 19 features, (2) the top ten most periodic predictors, or (3) the ten predictors with highest weighting.
Revised:  Three scenarios regard predictors include the use of all 19 features, (2) the top ten most periodic predictors, or (3) the ten predictors with highest weighting.
Edit intent: coherence
Original:  Three scenarios regard predictors include the use of (1) all 19 features, (2) the top ten most periodic predictors, or (3) the ten predictors with highest weighting.
Revised:  Three scenarios regard predictors include the use of (1) all 19 features, the top ten most periodic predictors, or (3) the ten predictors with highest weighting.
Edit intent: coherence
Original:  Three scenarios regard predictors include the use of (1) all 19 features, (2) the top ten most periodic predictors, or (3) the ten predictors with highest weighting.
Revised:  Three scenarios regard predictors include the use of (1) all 19 features, (2) the top ten most periodic predictors, or the ten predictors with highest weighting.
Edit intent: coherence
Original:  The results show that search terms with either higher weight and annual periodic pattern contribute more in forecasting the word die;
Revised:  The results show that search terms with both higher weight and annual periodic pattern contribute more in forecasting the word die;
Edit intent: fluency
Original:  In this article we study spectral clustering based on the deformed Laplacian matrix D-rA , for sparse heterogeneous graphs (following a two-class degree-corrected stochastic block model)  .
Revised:  This article studies spectral clustering based on the deformed Laplacian matrix D-rA , for sparse heterogeneous graphs (following a two-class degree-corrected stochastic block model) .
Edit intent: coherence
Original:  In this article we study spectral clustering based on the deformed Laplacian matrix D-rA , for sparse heterogeneous graphs (following a two-class degree-corrected stochastic block model)  .
Revised:  In this article we study spectral clustering based on the deformed Laplacian matrix D-rA for sparse heterogeneous graphs (following a two-class degree-corrected stochastic block model) .
Edit intent: fluency
Original:  For a specific value r = \zeta, we show that, unlike competing methods such as the Bethe Hessian or non-backtracking operator approaches, clustering is insensitive to the graph heterogeneity.
Revised:  For a specific value r = \zeta, clustering is shown to be insensitive to the graph heterogeneity.
Edit intent: clarity
Original:  Based on heuristic arguments, we study the behavior of the informative eigenvector of D-\zeta A and, as a result, we accurately predict the clustering accuracy.
Revised:  Based on heuristic arguments, we study the behavior of the informative eigenvector of D-\zeta A and, as a result, predict the clustering accuracy.
Edit intent: clarity
Original: We consider the problem of scheduling "serverless computing" instances such as Amazon Lambda functions  .
Revised: We consider the problem of scheduling serverless-computing instances such as Amazon Lambda functions .
Edit intent: fluency
Original:  An earlier bound for a single service tier is extended to the case of multiple service tiers  .
Revised:  An earlier bound for a single service tier is extended to multiple service tiers .
Edit intent: clarity
Original:  In order to show utility, we prove that our mechanism maintains pairwise distances between points in expectation and also show that its variance is proportional to the the dimensionality of the subspace we project the data into.
Revised:  In order to show utility, we prove that our mechanism maintains pairwise distances between points in expectation and also show that its variance is proportional to the dimensionality of the subspace we project the data into.
Edit intent: fluency
Original: In this paper, a new technique is applied on deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem.
Revised: In this paper, a new technique is shown on deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem.
Edit intent: clarity
Original:  Moreover, a different cost functional is discussed with the same PDE-constraints.
Edit intent: coherence
Original:  The derivation of preconditioners for the minimal residual method for the new optimal control problem is discussed in more detail.
Revised:  The derivation of preconditioners for the minimal residual method for the new optimization problem is discussed in more detail.
Edit intent: clarity
Original:  Both upper and lower bounds are also derived for the second new cost functional subject to the same parabolic PDE-constraints  .
Revised:  Both upper and lower bounds are derived for the second new cost functional subject to the same parabolic PDE-constraints .
Edit intent: clarity
Original: In this paper, a new technique is shown on deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem.
Revised: In this paper, a new technique is shown for deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem.
Edit intent: fluency
Original: A growing number of neuromorphic spiking neural network processors that emulate biological neural networks create an imminent need for methods and tools to enable them to solve real-world signal processing problems.
Revised: A growing number of neuromorphic spiking neural network processors attempt to emulate biological neural networks create an imminent need for methods and tools to enable them to solve real-world signal processing problems.
Edit intent: clarity
Original: A growing number of neuromorphic spiking neural network processors that emulate biological neural networks create an imminent need for methods and tools to enable them to solve real-world signal processing problems.
Revised: A growing number of neuromorphic spiking neural network processors that emulate biological neural networks . These developments have created an imminent need for methods and tools to enable them to solve real-world signal processing problems.
Edit intent: coherence
Original: A growing number of neuromorphic spiking neural network processors that emulate biological neural networks create an imminent need for methods and tools to enable them to solve real-world signal processing problems.
Revised: A growing number of neuromorphic spiking neural network processors that emulate biological neural networks create an imminent need for methods and tools to enable such systems to solve real-world signal processing problems.
Edit intent: clarity
Original:  Like conventional neural networks, spiking neural networks are particularly efficient when trained on real, domain specific data.
Revised:  Like conventional neural networks, spiking neural networks can be trained on real, domain specific data.
Edit intent: clarity
Original: In this work we propose a model that enables controlled manipulation of visual attributes of real "target" images (e.g. lighting, expression or pose) using only implicit supervision with synthetic "source" exemplars.
Revised: In this work we propose a model that can manipulate individual visual attributes of real "target" images (e.g. lighting, expression or pose) using only implicit supervision with synthetic "source" exemplars.
Edit intent: clarity
Original:  Since our technique relies on triplets instead of explicit labels, it can be applied to shape, texture, lighting, or other properties that are difficult to measure or represent as explicit conditioners.
Revised:  Since our technique relies on triplets instead of explicit labels, it can be applied to shape, texture, lighting, and other properties that are difficult to measure or represent as explicit conditioners.
Edit intent: fluency
Original:  We quantitatively analyze the degree to which trained models learn to isolate the property of interest from other content features with a proof-of-concept digit dataset and demonstrate results in a far more difficult setting , learning to manipulate real faces using a synthetic 3D faces dataset.
Revised:  We quantitatively analyze the degree to which trained models learn to isolate the property of interest from other content features with a proof-of-concept digit dataset and demonstrate results in a far more difficult setting : learning to manipulate real faces using a synthetic 3D faces dataset.
Edit intent: fluency
Original:  We quantitatively analyze the degree to which trained models learn to isolate the property of interest from other content features with a proof-of-concept digit dataset and demonstrate results in a far more difficult setting , learning to manipulate real faces using a synthetic 3D faces dataset.
Revised:  We quantitatively analyze the degree to which trained models learn to isolate the property of interest from other content features with a proof-of-concept digit dataset and demonstrate results in a far more difficult setting , learning to manipulate real human faces using nonphotorealistic 3D faces dataset.
Edit intent: clarity
Original: Query expansion (QE) is a well known technique to enhance the effectiveness of information retrieval (IR) . QE reformulates the initial query by adding similar terms that helps in retrieving more relevant results.
Revised: Query expansion (QE) is a well-known technique used to enhance the effectiveness of information retrieval (IR) . QE reformulates the initial query by adding similar terms that helps in retrieving more relevant results.
Edit intent: clarity
Original: Query expansion (QE) is a well known technique to enhance the effectiveness of information retrieval (IR) . QE reformulates the initial query by adding similar terms that helps in retrieving more relevant results.
Revised: Query expansion (QE) is a well known technique to enhance the effectiveness of information retrieval . QE reformulates the initial query by adding similar terms that helps in retrieving more relevant results.
Edit intent: clarity