wanyu/IteraTeR_v2 huggingface dataset:
Original:  How do we know the best way to navigate from one place to another?
Revised:  We visit a variety of locations both during our daily lives and when we're on vacation. How can we find the best way to navigate from one place to another?
Edit intent: clarity
Original:  Perhaps we could test all of the different ways of traveling between two places, but another method is using mathematics and computation to find a shortest path.
Revised:  Perhaps we can test all of the different ways of traveling between two places, but another method is using mathematics and computation to find a shortest path.
Edit intent: fluency
Original:  Perhaps we could test all of the different ways of traveling between two places, but another method is using mathematics and computation to find a shortest path.
Revised:  Perhaps we could test all of the different ways of traveling between two places, but another method is to use mathematics and computation to find a shortest path.
Edit intent: fluency
Original:  We discuss how to find a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance or travel time .
Revised:  We discuss how to construct a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance or travel time .
Edit intent: clarity
Original:  We discuss how to find a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance or travel time .
Revised:  We discuss how to find a shortest path and introduce Dijkstra's algorithm to minimize the total cost of a path, where the cost may be the travel distance , travel time, or some other measurement .
Edit intent: clarity
Original:  We also discuss how shortest paths can be used in the real world to save time and increase traveling efficiency.
Revised:  We also discuss how to use shortest paths in the real world to save time and increase traveling efficiency.
Edit intent: clarity
Original:  Our long-term goal is to understand the relationship between the complexity of such polyhedra and their symmetry breaking ability .
Revised:  Our long-term goal is to understand the relationship between the complexity of such polyhedra and their symmetry breaking capability .
Edit intent: fluency
Original:  Borrowing ideas from geometric group theory, we provide structural properties that relate the action of the group to the geometry of the facets of fundamental domains.
Revised:  Borrowing ideas from geometric group theory, we provide structural properties that relate the action of the group with the geometry of the facets of fundamental domains.
Edit intent: fluency
Original:  Finally, we prove that the Schreier-Sims inequalities can contain an exponential number of isomorphic binary vectors for a given permutation group G, which shows evidence of the lack of symmetry breaking effectiveness of this fundamental domain.
Revised:  Finally, we prove that the Schreier-Sims inequalities can contain an exponential number of isomorphic binary vectors for a given permutation group G, which provides evidence of the lack of symmetry breaking effectiveness of this fundamental domain.
Edit intent: clarity
Original:  Conversely, a suitably constructed GDD for  G has linearly many inequalities and contains unique representatives for isomorphic binary vectors.
Revised:  Conversely, a suitably constructed GDD for this G has linearly many inequalities and contains unique representatives for isomorphic binary vectors.
Edit intent: coherence
Original: Consider the problem of implementing a revenue-optimal, Bayesian Incentive Compatible auction when buyers ' values are drawn from distributions  \times_i D_i on a particular instance .
Revised: Consider the problem of implementing a revenue-optimal, Bayesian Incentive Compatible auction for buyers with valuations drawn from \times_i D_i on a particular instance .
Edit intent: clarity
Original: Consider the problem of implementing a revenue-optimal, Bayesian Incentive Compatible auction when buyers ' values are drawn from distributions  \times_i D_i on a particular instance .
Revised: Consider the problem of implementing a revenue-optimal, Bayesian Incentive Compatible auction when buyers ' values are drawn from distributions \times_i D_i .
Edit intent: clarity
Original:  Optimal single-dimensional mechanisms are local: in order to allocate the item correctly on a particular valuation profile v , only bits are needed from each player (specifically, their Myersonvirtual value (}v [Mye81] ), rather than the entire distribution.
Revised:  Optimal single-dimensional mechanisms are local: in order to allocate the item correctly on a particular valuation profile v bits are needed from each player (specifically, their Myersonvirtual value (}v [Mye81] ), rather than the entire distribution.
Edit intent: clarity
Original:  We show that optimal multi-dimensional mechanisms are not local : in order to allocate the item correctly on a particular valuation profile \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D} \Omega(n) bits are necessary from each bidder .
Revised:  We show that optimal multi-dimensional mechanisms are not locally-implementable : in order to allocate the item correctly on a particular valuation profile \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D} \Omega(n) bits are necessary from each bidder .
Edit intent: clarity
Original:  We show that optimal multi-dimensional mechanisms are not local : in order to allocate the item correctly on a particular valuation profile \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D} \Omega(n) bits are necessary from each bidder .
Revised:  We show that optimal multi-dimensional mechanisms are not local : in order to determine the output Opt_{\vec{D \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D} \Omega(n) bits are necessary from each bidder .
Edit intent: clarity
Original:  We show that optimal multi-dimensional mechanisms are not local : in order to allocate the item correctly on a particular valuation profile \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D} \Omega(n) bits are necessary from each bidder .
Revised:  We show that optimal multi-dimensional mechanisms are not local : in order to allocate the item correctly on a particular valuation profile \vec{v} \vec{v} , one still needs to know (essentially) the entire distribution . Specifically, if the distributions have support-size n, then \vec{D}. Formally, \Omega(n) bits are necessary from each bidder .
Edit intent: fluency
Original:  We show that this phenomenon already occurs with just two bidders, even when one bidder is single-dimensional, and even when the other bidder is barely multi-dimensional.
Revised:  We show that this phenomenon already occurs with just two bidders, even when one bidder is single-dimensional, and when the other bidder is barely multi-dimensional.
Edit intent: fluency
Original:  More specifically, the multi-dimensional bidder is " inter-dimensional " from the FedEx setting with just two days [FGKK16]  .
Revised:  More specifically, the multi-dimensional bidder is `` inter-dimensional " from the FedEx setting with just two days [FGKK16] .
Edit intent: fluency
Original:  More specifically, the multi-dimensional bidder is " inter-dimensional " from the FedEx setting with just two days [FGKK16]  .
Revised:  More specifically, the multi-dimensional bidder is " inter-dimensional '' from the FedEx setting with just two days [FGKK16] .
Edit intent: fluency
Original: We consider a class of  multi-agent optimization problems, where each agent is associated with an action vector and a local cost, and the goal is to cooperatively find the joint action profile that minimizes the average of the local costs.
Revised: We study a class of multi-agent optimization problems, where each agent is associated with an action vector and a local cost, and the goal is to cooperatively find the joint action profile that minimizes the average of the local costs.
Edit intent: clarity
Original: We consider a class of  multi-agent optimization problems, where each agent is associated with an action vector and a local cost, and the goal is to cooperatively find the joint action profile that minimizes the average of the local costs.
Revised: We consider a class of cooperative multi-agent optimization problems, where each agent is associated with an action vector and a local cost, and the goal is to cooperatively find the joint action profile that minimizes the average of the local costs.
Edit intent: clarity
Original:  In many of these problems, gradient information may not be readily available, and the agents may only observe their local costs incurred by their actions \%corresponding to their actions as a feedback to determine their new actions.
Revised:  In many of these problems, gradient information may not be readily available, and the agents may only observe their local costs incurred by their actions as a feedback to determine their new actions.
Edit intent: clarity
Original:  Nevertheless , the air--mucus interaction justifies several common chest physiotherapy technics used to help the draining of the mucus in prevalent diseases such as asthma, bronchiolitis or cystic fibrosis .
Revised:  Nevertheless , the air--mucus interaction justifies common technics of CP used to help the draining of the mucus in prevalent diseases such as asthma, bronchiolitis or cystic fibrosis .
Edit intent: clarity
Original:  Nevertheless , the air--mucus interaction justifies several common chest physiotherapy technics used to help the draining of the mucus in prevalent diseases such as asthma, bronchiolitis or cystic fibrosis .
Revised:  Nevertheless , the air--mucus interaction justifies several common chest physiotherapy technics used to help the draining of the mucus in prevalent diseases .
Edit intent: clarity
Original:  Hence, understanding how the wall shear stress distributes in the lung could bring interesting highlights on these therapies .
Revised:  Hence, the determination of the distribution of the shear stress in the lung could bring interesting highlights on these therapies .
Edit intent: clarity
Original:  Hence, understanding how the wall shear stress distributes in the lung could bring interesting highlights on these therapies .
Revised:  Hence, understanding how the wall shear stress distributes in the lung is crucial for understanding the effects of these therapies and, potentially, improve their efficiency .
Edit intent: clarity
Original:  We develop a mathematical model to study the distribution of the wall shear stress  induced by an outgoing air flow in an airway tree.
Revised:  We develop a mathematical model to study the distribution of the wall shear stress induced by an air flow exiting an airway tree.
Edit intent: clarity
Original:  This model accounts for the main physical processes that determines the wall shear stresses , more particularly the compliance of the airways and the air inertia  .
Revised:  This model accounts for the main physical processes that determines the WSS , more particularly the compliance of the airways and the air inertia .
Edit intent: clarity
Original:  This model accounts for the main physical processes that determines the wall shear stresses , more particularly the compliance of the airways and the air inertia  .
Revised:  This model accounts for the main physical processes that determines the wall shear stresses , more particularly the compliance of the airways , the air inertia .
Edit intent: fluency
Original:  We show that the wall shear stress exhibits a maximum within the tree whose amplitude and location depend on the amount of air flow and on the "tissue" pressure surrounding the airways.
Revised:  We show that the wall shear stress exhibits a maximum whose amplitude and location depend on the amount of air flow and on the "tissue" pressure surrounding the airways.
Edit intent: clarity
Original:  Our analysis suggests that a tuning of the air flow and tissue pressure might allow to control, at least partially, the air--mucus interaction in the lung.
Revised:  Our analysis suggests that a tuning of the airflow and of the tissue pressure during a CP maneuver might allow to control, at least partially, the air--mucus interaction in the lung.
Edit intent: clarity
Original: The group testing approach that can achieve significant cost reduction over the individual testing approach has received a lot of interest lately for massive testing of COVID-19.
Revised: The group testing approach that achieves significant cost reduction over the individual testing approach has received a lot of interest lately for massive testing of COVID-19.
Edit intent: clarity
Original:  Traditionally, the samples mixed in a group are assumed to be independentand identically distributed Bernoulli random variables .
Revised:  Many studies simply assume samples mixed in a group are assumed to be independentand identically distributed Bernoulli random variables .
Edit intent: clarity
Original:  Traditionally, the samples mixed in a group are assumed to be independentand identically distributed Bernoulli random variables .
Revised:  Traditionally, the samples mixed in a group are independent .
Edit intent: clarity
Original:  However, this  may not be the case for a contagious disease like COVID-19 , as people within a family tend to infect each other .
Revised:  However, this assumption may not be the case for a contagious disease like COVID-19 , as people within a family tend to infect each other .
Edit intent: coherence
Original:  However, this  may not be the case for a contagious disease like COVID-19 , as people within a family tend to infect each other .
Revised:  However, this may not be reasonable for a contagious disease like COVID-19 , as people within a family tend to infect each other .
Edit intent: clarity
Original:  However, this  may not be the case for a contagious disease like COVID-19 , as people within a family tend to infect each other .
Revised:  However, this may not be the case for a contagious disease like COVID-19 . Specifically, people within a family tend to infect each other .
Edit intent: clarity
Original:  By exploiting positive correlation, we show by rigorous mathematical proof that further cost reduction can be achieved by using the simple Dorfman two-stage method .
Revised:  By exploiting positive correlation, we show by rigorous mathematical proof that further cost reduction can be achieved by using the Dorfman two-stage method .
Edit intent: clarity
Original:  For pooled testing with a social graph, we propose a hierarchical agglomerative algorithm and show that such an algorithm can lead to significant cost reduction (roughly 20\%-35\%) compared to random pooling when the Dorfman two-stage algorithm is used .
Revised:  Such an algorithm leads to notable cost reduction (roughly 20\%-35\%) compared to random pooling when the Dorfman two-stage algorithm is used .
Edit intent: clarity
Original:  For pooled testing with a social graph, we propose a hierarchical agglomerative algorithm and show that such an algorithm can lead to significant cost reduction (roughly 20\%-35\%) compared to random pooling when the Dorfman two-stage algorithm is used .
Revised:  For pooled testing with a social graph, we propose a hierarchical agglomerative algorithm and show that such an algorithm can lead to significant cost reduction (roughly 20\%-35\%) compared to random pooling when the Dorfman two-stage algorithm is applied .
Edit intent: clarity
Original:  The PAC decoder can be clocked at 384.6 MHz and reach an  information throughput of 9.34 MB /s at 3.5 dB signal-to-noise ratio for a block length of 128 and code rate of 1/2.
Revised:  The PAC decoder can be clocked at 384.6 MHz and reach an average information throughput of 9.34 MB /s at 3.5 dB signal-to-noise ratio for a block length of 128 and code rate of 1/2.
Edit intent: clarity
Original: This paper proposes a hardware implementation architecture for Fano decoding of polarization-adjusted convolutional (PAC) codes.
Revised: This brief proposes a hardware implementation architecture for Fano decoding of polarization-adjusted convolutional (PAC) codes.
Edit intent: clarity
Original:  The performance of the proposed decoder is evaluated on FPGAand ASIC using Xilinx Nexys 4 Artix-7 and TSMC 28 nm 0.72 V library , respectively.
Revised:  The performance of the proposed decoder is tested on FPGA, and its performance is evaluated on ASIC using TSMC 28 nm 0.72 V library , respectively.
Edit intent: clarity
Original:  The PAC decoder can be clocked at 400 MHz and reach an average information throughput of 15.10 Mb/s at 3.5 dB signal-to-noise ratio for a block length of 128 and  code rate of 1/2.
Revised:  The PAC decoder can be clocked at 400 MHz and reach an average information throughput of 15.10 Mb/s at 3.5 dB signal-to-noise ratio for a block length of 128 and a code rate of 1/2.
Edit intent: fluency
Original: The edge connectivity of a simple graph is the least number of edges whose removal disconnects the graph.
Revised: The minimum cut problem in an undirected and weighted graph G is to find the minimum total weight of a set of edges whose removal disconnects the graph.
Edit intent: clarity
Original: We design a series of experiments on credit scoring and employ SHAP values to demonstrate that the use of location information may introduce racial biases.
Revised: We dissect an experimental credit scoring model developed with real data and demonstrate -- without having access to protected attributes -- how the use of location information may introduce racial biases.
Edit intent: clarity
Original:  The present work helps to discuss how to track racial biases when protected attributes are not available and points in interesting directions towards the development of procedures to yield more ethical credit scoring models in the Brazilian context .
Revised:  The present experiment testifies to the importance of developing methods and language that goes beyond the need of access to protected attributes when auditing ML models, the necessity of considering regional specifics when reflecting on racial issues, and the importance of census data to the AI research community. To the best of our knowledge, this is the first documented case of how algorithmic racial bias may easily emerge in a ML credit scoring model built with Brazilian data, a country with the largest Black population outside Africa .
Edit intent: coherence
Original: The last decade has witnessed the rapid growth of open source software ~ (OSS).
Revised: The last decade has witnessed the rapid growth of open source software (OSS).
Edit intent: fluency
Original:  In this paper, we introduce time-series snapshot network ~ (TSSN) which is a mixture network to model the interactions among users and developers.
Revised:  In this paper, we introduce time-series snapshot network (TSSN) which is a mixture network to model the interactions among users and developers.
Edit intent: fluency
Original:  Based on the established TSSN, we perform temporal biased walk ~ (TBW) to automatically capture both temporal and structural information of the email network, i.e., the behavioral similarity between individuals in the OSS email network.
Revised:  Based on the established TSSN, we perform temporal biased walk (TBW) to automatically capture both temporal and structural information of the email network, i.e., the behavioral similarity between individuals in the OSS email network.
Edit intent: fluency
Original: The request-trip-vehicle assignment problem is at the heart of popular decomposition strategies for online vehicle routing.
Revised: The request-trip-vehicle assignment problem is at the heart of a popular decomposition strategy for online vehicle routing.
Edit intent: fluency
Original:  We study an integer linear programming formulation and its linear programming relaxation.
Revised:  We study an integer linear programming formulation and its LP relaxation.
Edit intent: clarity
Original:  If trip-vehicle assignment costs can only be \alpha-approximated , we pay an additional factor of \alpha in the expected cost.
Revised:  If trip-vehicle assignment costs are \alpha-approximate , we pay an additional factor of \alpha in the expected cost.
Edit intent: clarity
Original:  Unassigned requests are assigned in future rounds with high probability.
Edit intent: clarity
Original:  We conclude with observations and open questions related to this phenomenon.
Edit intent: coherence
Original:  We extend the model to mixtures of subpopulations differing in their diffusion coefficients, which we estimate by using the expectation-maximization algorithm.
Revised:  We extend the model to mixtures of subpopulations differing in their diffusion coefficients, which we estimate with the help of the expectation-maximization algorithm.
Edit intent: clarity
Original:  To facilitate use by practitioners, we provide a data analysis script .
Revised:  To facilitate use by practitioners, we provide a fast open-source implementation of the theory for the efficient analysis of multiple trajectories in arbitrary dimensions simultaneously .
Edit intent: clarity
Original:  Experiments are performed, which validates our theoretical analysis and provides further insights.
Revised:  Experiments are performed, which validate our theoretical analysis and provides further insights.
Edit intent: fluency
Original:  Experiments are performed, which validates our theoretical analysis and provides further insights.
Revised:  Experiments are performed, which validates our theoretical analysis and provide further insights.
Edit intent: fluency
Original:  The redesign was done through creation of new classes for linear and nonlinear solvers  , enhancements to the vector class, and the creation of modern Fortran interfaces that leverage interoperability features of the Fortran 2003 standard .
Revised:  The redesign was done through the addition of new linear and nonlinear solvers , enhancements to the vector class, and the creation of modern Fortran interfaces that leverage interoperability features of the Fortran 2003 standard .
Edit intent: clarity
Original:  The redesign was done through creation of new classes for linear and nonlinear solvers  , enhancements to the vector class, and the creation of modern Fortran interfaces that leverage interoperability features of the Fortran 2003 standard .
Revised:  The redesign was done through creation of new classes for linear and nonlinear solvers , enhancements to the vector class, and the creation of modern Fortran interfaces .
Edit intent: clarity
Original:  However, these changes now allow advanced users to create highly customized solvers that exploit their problem structure, enabling SUNDIALS use on extreme-scale, heterogeneous computational architectures.
Revised:  However, these changes now allow advanced users to create highly customized solvers , enabling greater flexibility on extreme-scale, heterogeneous computational architectures.
Edit intent: clarity
Original:  These connection weights are determined via a modified back-propagation algorithm that we designed for such types of networks .
Revised:  These connection weights are determined via a back-propagation algorithm that we designed for such types of networks .
Edit intent: clarity
Original:  Our approach fully recovers standard Deep Neural Networks (DNN), encompasses sparse DNNs, and extends the DNN concept toward dynamical systems implementations.
Revised:  Our approach can fully represent standard Deep Neural Networks (DNN), encompasses sparse DNNs, and extends the DNN concept toward dynamical systems implementations.
Edit intent: clarity