wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Our approach, which builds on a recent state-of-the-art Bayesian method, refines the modelling of comparison data, allowing disagreement probability parameters conditional on non-match status to be record-specific . To make this refinement computationally feasible , we implement a Gibbs sampler that achieves significant improvement in speed over comparable recent implementations .
Revised:  Our approach, which builds on a recent state-of-the-art Bayesian method, refines the modelling of comparison data, allowing disagreement probability parameters conditional on non-match status to be record-specific in the smaller of the two datasets. This flexibility significantly improves matching when many records share common field values. We show that our method is computationally feasible in practice, despite the added complexity, with an R/C++ implementation that achieves significant improvement in speed over comparable recent implementations .
Edit intent: meaning-changed
Original:  We also generalize the notion of comparison data to allow for treatment of very common first names that spuriously produce exact matches in record pairs and show how to estimate true positive rate and positive predictive value when ground truth is unavailable.
Revised:  We also suggest a lightweight method for treatment of very common first names that spuriously produce exact matches in record pairs and show how to estimate true positive rate and positive predictive value when ground truth is unavailable.
Edit intent: clarity
Original:  We also generalize the notion of comparison data to allow for treatment of very common first names that spuriously produce exact matches in record pairs and show how to estimate true positive rate and positive predictive value when ground truth is unavailable.
Revised:  We also generalize the notion of comparison data to allow for treatment of very common first names that spuriously produce exact matches in record pairs and show how to estimate true positive rate and positive predictive value when true match status is unavailable.
Edit intent: clarity
Original: In this paper, we consider infinite number of non atomic self-interested agentswith private valuation of a divisible good. We design a pricing mechanism that is easy to implement, is individually rational, weakly budget balanced and incentive compatible. In this mechanism, agentssend reports of their types , based on which, the designer solves a constrained optimization problem through Lagrange's mechanism.
Revised: Network utility maximization (NUM) is a general framework for designing distributed optimization algorithms for large-scale networks. An economic challenge arises in the presence of strategic agents' private information. Existing studies proposed (economic) mechanisms but largely neglected the issue of large-scale implementation. Specifically, they require certain modifications to the deployed algorithms, which may bring the significant cost. To tackle this challenge, we present the large-scale Vickery-Clark-Grove (VCG) Mechanism for NUM, with a simpler payment rule characterized by the shadow prices. The Large-Scale VCG Mechanism maximizes the network utility and achieves individual rationality and budget balance. With infinitely many agents, agents' truthful reports of their types , based on which, the designer solves a constrained optimization problem through Lagrange's mechanism.
Edit intent: meaning-changed
Original:  In this mechanism, agentssend reports of their types , based on which, the designer solves a constrained optimization problem through Lagrange's mechanism. The resulting optimal allocation and Lagrange's multiplier is sent as the allocation and prices to the respective agent. We show that reporting one's type truthfully is a dominant strategy of the players in this mechanism. We then extend this idea to the dynamic case, when player' s types are dynamically evolving as a controlled Markov process.
Revised:  In this mechanism, agentssend reports of their types are their dominant strategies; for the finite case, each agent's incentive to misreport converges quadratically to zero. For practical implementation, we introduce a modified mechanism that possesses an additional important technical property, superimposability, which makes it able to be built upon any (potentially distributed) algorithm that optimally solves the NUM Problem and ensures all agents to obey the algorithm. We then extend this idea to the dynamic case, when player' s types are dynamically evolving as a controlled Markov process.
Edit intent: meaning-changed
Original:  In their seminal work, Vytlacil and Yildiz (2007) showed how to identify and estimate the average treatment effect of a dummy endogenous variable in a weakly separable model under a monotonicity condition. We also consider similar weakly separable models , but relax the monotonicity condition for identification.
Revised:  In their seminal work, Vytlacil and Yildiz (2007) showed how to identify and estimate the average treatment effect of a dummy endogenous variable when the outcome is weakly separable in a single index. Their identification result builds on a monotonicity condition with respect to this single index. In comparison, we consider similar weakly separable models , but relax the monotonicity condition for identification.
Edit intent: meaning-changed
Original:  To illustrate the advantage of our approach, we provide several examples of models where our approach can identify parameters of interest whereas existing methods cannot be applied because monotonicity fails. These include models with multiple unobserved disturbance terms such as the Roy model and multinomial choice models with dummy endogenous variables, as well as potential outcome models with endogenous random coefficients.
Revised:  To illustrate the advantage of our approach, we provide several examples of models where our approach can identify parameters of interest whereas existing methods would fail. These examples include models with multiple unobserved disturbance terms such as the Roy model and multinomial choice models with dummy endogenous variables, as well as potential outcome models with endogenous random coefficients.
Edit intent: clarity
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  To achieve this goal, a series of smaller goals are required including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Edit intent: coherence
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of minor goals are required including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Edit intent: clarity
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of smaller goals are required to be met in advance including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Edit intent: clarity
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of smaller goals are required including determining benefits, costs of implement-ing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Edit intent: fluency
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of smaller goals are required including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Edit intent: fluency
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of smaller goals are required including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, the reduction in travel time and growth in travel speeds .
Edit intent: fluency
Original:  In order to achieve this goal, a series of smaller goals are required  including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time and growth in travel speeds .
Revised:  In order to achieve this goal, a series of smaller goals are required including determining benefits, costs of implementing new highway interchanges, quantifying the effective parameters, quantifying the increase in fuel consumption, quantifying the reduction in travel time , and finally influence on travel speed .
Edit intent: clarity
Original:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam highway was investigated just Macro from cloverleaf intersection with a low capacity to  three-level directional intersection and enhanced cloverleaf.
Revised:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam Highway were investigated in the Macro view from the cloverleaf inter-section with a low capacity to three-level directional intersection and enhanced cloverleaf.
Edit intent: clarity
Original:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam highway was investigated just Macro from cloverleaf intersection with a low capacity to  three-level directional intersection and enhanced cloverleaf.
Revised:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam highway was investigated just Macro from cloverleaf intersection with a low capacity to a three-level directional intersection and enhanced cloverleaf.
Edit intent: fluency
Original:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam highway was investigated just Macro from cloverleaf intersection with a low capacity to  three-level directional intersection and enhanced cloverleaf.
Revised:  In this study, geometric advancement of Hakim highway, and Yadegar-e-Emam highway was investigated just Macro from cloverleaf intersection with a low capacity to three-level directional intersection of the enhanced cloverleaf.
Edit intent: clarity
Original:  The results of the method  of net present value (NPV) were evaluated economically , and the benefit and cost of each one was stated precisely in different years (\%28 improvement). The sensitivity analysis indicated that the cost of fuel, cost of travel time, cost of accidents and cost of pollutants have the highest impact factor in this assessment respectively .
Revised:  The results of the method of net present value (NPV) were evaluated economically , and the benefit and cost of each one was stated precisely in different years . At the end, some suggestion has been provided .
Edit intent: coherence
Original:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Revised:  In this paper, motivated by the elder-rule for the zeroth homology of 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Edit intent: fluency
Original:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Revised:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode \mathrm{H . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Edit intent: meaning-changed
Original:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Revised:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, if n = |X|, the elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Edit intent: clarity
Original:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n = |X| number of staircase-like blocks in the plane.
Revised:  In this paper, motivated by the elder-rule for the zeroth homology of a 1-parameter filtration, we propose a barcode-like summary, called the elder-rule-staircode, as a way to encode the zeroth homology of the 2-parameter filtration induced by a finite augmented metric space . Specifically, given a finite (X, d_X, f_X), its elder-rule-staircode consists of n number of staircase-like blocks in the plane.
Edit intent: meaning-changed
Original:  We show that the fibered barcode , the fibered merge tree,_0(\mathcal{K}) is interval decomposable, then the barcode of \mathrm{H}_0(\mathcal{K}) is equal to the elder-rule-staircode.
Revised:  We show that if \mathrm{H_0(\mathcal{K}) is interval decomposable, then the barcode of \mathrm{H}_0(\mathcal{K}) is equal to the elder-rule-staircode.
Edit intent: clarity
Original:  Furthermore, regardless of the interval decomposability, the fibered barcode, the dimension function (a.k.a. the Hilbert function), } and the graded Betti numbers associated to the zeroth homology of the 2-parameter filtration induced by (X, d_X, f_X_0(\mathcal{K}} ) can all be efficiently computed once the elder-rule-staircode is given .
Revised:  Furthermore, regardless of the interval decomposability, the fibered barcode, the dimension function (a.k.a. the Hilbert function), } and the graded Betti numbers of \mathrm{H_0(\mathcal{K}} ) can all be efficiently computed once the elder-rule-staircode is given .
Edit intent: meaning-changed
Original:  Furthermore, regardless of the interval decomposability, the fibered barcode, the dimension function (a.k.a. the Hilbert function), } and the graded Betti numbers associated to the zeroth homology of the 2-parameter filtration induced by (X, d_X, f_X_0(\mathcal{K}} ) can all be efficiently computed once the elder-rule-staircode is given . Furthermore, for certain special cases, this staircode corresponds exactly to the set of indecomposables of the zeroth homology of the 2-parameter filtration .
Revised:  Furthermore, regardless of the interval decomposability, the fibered barcode, the dimension function (a.k.a. the Hilbert function), } and the graded Betti numbers associated to the zeroth homology of the 2-parameter filtration induced by (X, d_X, f_X_0(\mathcal{K}} ) can all be efficiently computed once the elder-rule-staircode is given .
Edit intent: meaning-changed
Original: We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set  in linear time and space.
Revised: The known linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set in linear time and space.
Edit intent: meaning-changed
Original: We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set  in linear time and space.
Revised: We improve two linear-time kernelizations for d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set in linear time and space.
Edit intent: clarity
Original: We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set  in linear time and space.
Revised: We improve two linear-time data reduction algorithms for the d-Hitting Set guarantee linear worst-case running times using a quadratic-size data structure (that is not fully initialized). Getting rid of this data structure, we show that problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set in linear time and space.
Edit intent: meaning-changed
Original: We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set  in linear time and space.
Revised: We improve two linear-time data reduction algorithms for the d-Hitting Set problem to work in linear space, thus obtaining the first algorithms for computing problem kernels of asymptotically optimal size O(k^d) for d-Hitting Set are computable in linear time and space.
Edit intent: meaning-changed
Original:  In such a setting we obtain a sublinear pricing measure for additional contracts  . Similar to the forward measure approach, we define a forward sublinear expectation to simplify the valuation of cashflows.
Revised:  In such a setting we obtain a sublinear pricing measure for additional contracts , which yields either a single price or a range of prices . Similar to the forward measure approach, we define a forward sublinear expectation to simplify the valuation of cashflows.
Edit intent: meaning-changed
Original:   With these tools, we derive robust pricing rules for the most common interest rate derivatives : fixed coupon bonds, floating rate notes, interest rate swaps, swaptions, caps, and floors.
Revised:  In addition, we develop pricing methods for contracts consisting of a stream of cashflows, since the nonlinearity of the pricing measure implies that we cannot price a stream of cashflows by pricing each cashflow separately. With these tools, we derive robust pricing rules for the most common interest rate derivatives : fixed coupon bonds, floating rate notes, interest rate swaps, swaptions, caps, and floors.
Edit intent: meaning-changed
Original:   With these tools, we derive robust pricing rules for the most common interest rate derivatives : fixed coupon bonds, floating rate notes, interest rate swaps, swaptions, caps, and floors. For fixed coupon bonds, floating rate notes, and interest rate swaps, we obtain a single price, which is the same as in traditional models. For swaptions, caps, and floors, we obtain a range of prices, which is bounded by the prices from traditional models with the highest and lowest possible volatility . Due to these pricing formulas, the model naturally exhibits unspanned stochastic volatility.
Revised:  With these tools, we derive robust pricing rules for the most common interest rate derivatives . The pricing formulas provide a link to the pricing formulas of traditional models without volatility uncertainty and show that volatility uncertainty naturally leads to unspanned stochastic volatility.
Edit intent: clarity
Original: Learning graph representations of n-ary relational data has a number of real world applications like anti-money laundering, fraud detection, risk assessment etc.
Revised: Learning graph representations of n-ary relational data has a number of real world applications like anti-money laundering, fraud detection, and customer due diligence. Contact tracing of COVID19 positive persons could also be posed as a Link Prediction problem. Predicting links between people using
Edit intent: meaning-changed
Original:  Graph Neural Networks have been shown to be effective in predicting links with few or no node features. While a number of datasets exist for link prediction, their features are considerably different from real world applications. Temporal information on entities and relations are often unavailable. We introduce a new dataset with 10 subgraphs, 20912 nodes, 67564 links, 70 attributes and 9 relation types. We also present novel improvements to graph models to adapt them for industry scale applications .
Revised:  Graph Neural Networks requires careful ethical and privacy considerations than in domains where GNNs have typically been applied so far. We introduce novel methods for anonymizing data, model training, explainability and verification for Link Prediction in Master Data Management, and discuss our results .
Edit intent: coherence