wanyu/IteraTeR_v2 huggingface dataset:
Original: In this paper, we bring together both the paradigms to develop an algorithm that morphs(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path~}[ [ [  between two planar straight-line grid drawings of an n-vertex tree T in sublinear number of morphing steps such that each intermediate morphing step produces a 3D straight-line crossing free grid drawing of T while maintaining the resolution.
Revised: In this paper, we bring together both the paradigms to develop an algorithm that morphs(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path~}[ [ [ between two planar drawings of an n-vertex tree T in sublinear number of morphing steps such that each intermediate morphing step produces a 3D straight-line crossing free grid drawing of T while maintaining the resolution.
Edit intent: fluency
Original:  We also ensure that each intermediate drawing lies in a 3D grid of polynomially-bounded volume.
Revised:  Each intermediate drawing lies in a 3D grid of polynomially-bounded volume.
Edit intent: coherence
Original:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path ~ [Alamdari et al.
Revised:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path [Alamdari et al.
Edit intent: coherence
Original:  \ 2017], while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al.
Revised:  , 2017], while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al.
Edit intent: fluency
Original:  \ 2019]. However, these morphs do not bound one practical parameter, the resolution.
Revised:  , 2019]. However, these morphs do not bound one practical parameter, the resolution.
Edit intent: fluency
Original:  \ 2019] a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Revised:  , 2019] a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Edit intent: fluency
Original:  A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at constant speed .
Revised:  A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at constant speeds .
Edit intent: fluency
Original:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Revised:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Edit intent: clarity
Original:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Revised:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path %DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Edit intent: coherence
Original:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Revised:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% using the third dimension it can be reduced to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Edit intent: clarity
Original:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. , 2019].
Revised:  A crossing-free morph is known between two drawings of an n-vertex planar graph G with O(n) morphing steps and sometimes \Omega(n) steps is necessary even when G is a path Alamdari et al., 2017%DIFDELCMD < ]%%% , while using 3D can reduce the number of steps to O(\log n) for an n-vertex tree [Arseneva et al. \ 2019].
Edit intent: fluency
Original:  Recently Barrera-Cruz et al., 2019%DIFDELCMD < ] %%% a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Revised:  Barrera-Cruz et al., 2019%DIFDELCMD < ] %%% a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Edit intent: fluency
Original:  Recently Barrera-Cruz et al., 2019%DIFDELCMD < ] %%% a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Revised:  Recently %DIFDELCMD < ] %%% a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Edit intent: coherence
Original:  Recently Barrera-Cruz et al., 2019%DIFDELCMD < ] %%% a 2D crossing-free morph was devised between two planar drawings of an n-vertex tree in O(n) steps with polynomial resolution, that is, all intermediate drawings are grid drawings on a grid of polynomial size.
Revised:  Recently Barrera-Cruz et al., 2019%DIFDELCMD < ] %%% 
Edit intent: coherence
Original:  Can the number of steps in this setting be reduced substantially by using 3D ? We answer this question in  affirmative and present a 3D non-crossing morph between two planar grid drawings of an n-vertex tree in O(n \log n) morphing steps.
Revised:  Can the number of steps be reduced substantially by using 3D ? We answer this question in affirmative and present a 3D non-crossing morph between two planar grid drawings of an n-vertex tree in O(n \log n) morphing steps.
Edit intent: clarity
Original:  Can the number of steps in this setting be reduced substantially by using 3D ? We answer this question in  affirmative and present a 3D non-crossing morph between two planar grid drawings of an n-vertex tree in O(n \log n) morphing steps.
Revised:  Can the number of steps in this setting be reduced substantially by using 3D ? We answer this question in an affirmative and present a 3D non-crossing morph between two planar grid drawings of an n-vertex tree in O(n \log n) morphing steps.
Edit intent: fluency
Original:  To overcome the challenges, we present SNALS that utilizes bipartite graph neural network with structural features to collectively tackle the two ambiguity issues.
Revised:  To overcome the challenges, we present SNALS that utilizes bipartite graph neural network with structural features to collectively tackle the two ambiguity issues.
Edit intent: fluency
Original: Biological agents have meaningful interactions with their environment despite the absence of a reward signal .
Revised: Biological agents have meaningful interactions with their environment despite the absence of immediate reward signals .
Edit intent: clarity
Original: Theories for autism spectrum disorder (ASD) have been formulated at different levels: ranging from physiological observations to perceptual and behavioural descriptions.
Revised: Theories for autism spectrum disorder (ASD) have been formulated at different levels: ranging from physiological observations to perceptual and behavioral descriptions.
Edit intent: fluency
Original:  Here we show how a recurrent neural circuit model which had been optimized to perform sampling-based inference and displays characteristic features of cortical dynamics can help bridge this gap.
Revised:  Here we show how a recurrent neural circuit model which was optimized to perform sampling-based inference and displays characteristic features of cortical dynamics can help bridge this gap.
Edit intent: coherence
Original: Federated learning (FL) is an emerging paradigm for machine learning , in which data owners can collaboratively train a model by sharing gradients instead of their raw data.
Revised: Federated learning (FL) is an emerging machine learning paradigm , in which data owners can collaboratively train a model by sharing gradients instead of their raw data.
Edit intent: clarity
Original: Federated learning (FL) is an emerging paradigm for machine learning , in which data owners can collaboratively train a model by sharing gradients instead of their raw data.
Revised: Federated learning (FL) is an emerging paradigm for machine learning , in which data owners can collaboratively train a model without sharing their raw data.
Edit intent: clarity
Original:  Two fundamental research problems in FL are  incentive mechanism and privacy protection.
Revised:  Two fundamental research problems in FL are the incentive mechanism and privacy protection.
Edit intent: fluency
Original:  However,  incentive mechanism and privacy protection in FL have been studied separately  and no work  solves both problems at the same time .
Revised:  However, the incentive mechanism and privacy protection in FL have been studied separately and no work solves both problems at the same time .
Edit intent: coherence
Original:  However,  incentive mechanism and privacy protection in FL have been studied separately  and no work  solves both problems at the same time .
Revised:  However, incentive mechanism and privacy protection in FL have been studied separately , and no work solves both problems at the same time .
Edit intent: coherence
Original:  However,  incentive mechanism and privacy protection in FL have been studied separately  and no work  solves both problems at the same time .
Revised:  However, incentive mechanism and privacy protection in FL have been studied separately and no work simultaneously solves both problems at the same time .
Edit intent: clarity
Original:  However,  incentive mechanism and privacy protection in FL have been studied separately  and no work  solves both problems at the same time .
Revised:  However, incentive mechanism and privacy protection in FL have been studied separately and no work solves both problems .
Edit intent: clarity
Original:  In this work, we address the two problems simultaneously by an FL-Market that incentivizes data owners' participation by providing appropriate payments and privacy protection.
Revised:  In this work, we address the two problems simultaneously with FL-Market that incentivizes data owners' participation by providing appropriate payments and privacy protection.
Edit intent: fluency
Original:  In this work, we address the two problems simultaneously by an FL-Market that incentivizes data owners' participation by providing appropriate payments and privacy protection.
Revised:  In this work, we address the two problems simultaneously by an FL-Market , which incentivizes data owners' participation by providing appropriate payments and privacy protection.
Edit intent: fluency
Original:  Our insight is that , by meeting data owners' personalized privacy preferences and providing appropriate payments, we can (1) incentivize privacy risk-tolerant data owners to set larger privacy parameters (i.e., gradients with less noise) and (2) provide preferred privacy protection for privacy risk-averse data owners.
Revised:  Our insight is that by meeting data owners' personalized privacy preferences and providing appropriate payments, we can (1) incentivize privacy risk-tolerant data owners to set larger privacy parameters (i.e., gradients with less noise) and (2) provide preferred privacy protection for privacy risk-averse data owners.
Edit intent: fluency
Original:  To achieve this, we design a personalized LDP-based FL framework with a deep learning-empowered auction mechanism for incentivizing trading gradients with less noise and optimal aggregation mechanisms for model updates .
Revised:  To achieve this, we design a personalized LDP-based FL framework with a deep learning-empowered auction mechanism for incentivizing trading gradients with less noise and an optimal aggregation mechanism for aggregating local gradients into an accurate global gradient .
Edit intent: clarity
Original: We present the task description and discussion on the results of the DCASE 2021 Challenge Task 2. Last year , we organized  unsupervised anomalous sound detection (ASD) task ;
Revised: We present the task description and discussion on the results of the DCASE 2021 Challenge Task 2. Last year , we organized an unsupervised anomalous sound detection (ASD) task ;
Edit intent: fluency
Original:  In this year, we organize an advanced unsupervised ASD task under domain-shift conditions  which focuses on the inevitable problem for the practical use of ASD systems.
Revised:  In this year, we organize an advanced unsupervised ASD task under domain-shift conditions , which focuses on the inevitable problem for the practical use of ASD systems.
Edit intent: fluency
Original:  In this year, we organize an advanced unsupervised ASD task under domain-shift conditions  which focuses on the inevitable problem for the practical use of ASD systems.
Revised:  In this year, we organize an advanced unsupervised ASD task under domain-shift conditions which focuses on the inevitable problem of the practical use of ASD systems.
Edit intent: clarity
Original:  The main challenge of this task is to detect unknown anomalous sounds where the acoustic characteristics of the training and testing samples are different, i.e.  domain-shifted.
Revised:  The main challenge of this task is to detect unknown anomalous sounds where the acoustic characteristics of the training and testing samples are different, i.e. , domain-shifted.
Edit intent: fluency
Original:  This problem is frequently occurs due to changes in seasons, manufactured products, and/or environmental noise.
Revised:  This problem frequently occurs due to changes in seasons, manufactured products, and/or environmental noise.
Edit intent: fluency
Original:  Our specification of the protocol is written in Communicating Sequential Processes (CSP), which is  well-suited approach to specifying agent communication protocols due to its focus on concurrent communicating systems.
Revised:  Our specification of the protocol is written in Communicating Sequential Processes (CSP), which is a well-suited approach to specifying agent communication protocols due to its focus on concurrent communicating systems.
Edit intent: fluency
Original:  We validate the specification's behaviour using five scenarios where the correct behaviour is known, and verify that eventually all the maps have merged.
Revised:  We validate the specification's behaviour using scenarios where the correct behaviour is known, and verify that eventually all the maps have merged.
Edit intent: clarity
Original:  We introduce a novel class of games that we call structured hierarchical games (SHGs) to capture these strategic interactions.
Revised:  We introduce a novel class of structured hierarchical games (SHGs) to capture these strategic interactions.
Edit intent: coherence
Original:  We introduce a novel class of games that we call structured hierarchical games (SHGs) to capture these strategic interactions.
Revised:  We introduce a novel class of games that we call structured hierarchical games (SHGs) that formally capture such hierarchical strategic interactions.
Edit intent: clarity
Original:  In an SHG, each player is represented as a vertex in a multi-layer decision treeand controls a real-valued action vector reacting to orders from its predecessors and influencing its descendants'behaviors strategically based on its own subjective utility.
Revised:  In an SHG, each player is a vertex in a multi-layer decision treeand controls a real-valued action vector reacting to orders from its predecessors and influencing its descendants'behaviors strategically based on its own subjective utility.
Edit intent: clarity
Original:  In an SHG, each player is represented as a vertex in a multi-layer decision treeand controls a real-valued action vector reacting to orders from its predecessors and influencing its descendants'behaviors strategically based on its own subjective utility.
Revised:  In an SHG, each player is represented as a vertex in a tree, and strategic choices of players are sequenced from root to leaves, with root moving first, followed by its children, then followed by their children, and so on until the leaves. A player's utility in an SHG depends on its own subjective utility.
Edit intent: clarity
Original:  By exploiting the hierarchical structure and strategic dependencies in payoffs, we derive a back propagation-style gradient-based algorithm which we call Differential Backward Induction to compute an equilibrium.
Revised:  By exploiting the hierarchical structure and strategic dependencies in payoffs, we derive a back propagation-style algorithm, which we call Differential Backward Induction to compute an equilibrium.
Edit intent: clarity
Original:  Finally, we demonstrate the effectiveness of our algorithm in findingglobally stable solutions and its scalability for a recently introduced class of SHGsfor pandemic policy making .
Revised:  Finally, we demonstrate the globally stable solutions and its scalability for a recently introduced class of SHGsfor pandemic policy making .
Edit intent: clarity
Original:  Finally, we demonstrate the effectiveness of our algorithm in findingglobally stable solutions and its scalability for a recently introduced class of SHGsfor pandemic policy making .
Revised:  Finally, we demonstrate the effectiveness of our algorithm in finding stable solutions and its scalability for a recently introduced class of SHGsfor pandemic policy making .
Edit intent: clarity
Original:  It studies the differential entropy of the minimum mean-square error (MMSE) estimator and provides a new lower bound which connects the entropy of the input , output, and conditional mean.
Revised:  It studies the differential entropy of the minimum mean-square error (MMSE) estimator and provides a new lower bound in terms of the differential entropies of the input , output, and conditional mean.
Edit intent: clarity
Original:  An application of the lower bound in the remote-source coding problem is discussed, and extensions of the lower and upper bounds to the vector Gaussian channel are given .
Revised:  Two applications of the lower bound in the remote-source coding problem is discussed, and extensions of the lower and upper bounds to the vector Gaussian channel are given .
Edit intent: fluency
Original:  An application of the lower bound in the remote-source coding problem is discussed, and extensions of the lower and upper bounds to the vector Gaussian channel are given .
Revised:  An application of the lower bound in the remote-source coding and CEO problem are discussed .
Edit intent: clarity
Original:  Our comprehensive experimental study reveals that both the community quality (modularity) and entropy are closely related to the deep learning models' performances, thus paves a novel way of explaining deep learning models directly from the neurons' activation pattern.
Revised:  Our comprehensive experimental study reveals that both the community quality and entropy can provide new insights into the deep learning models' performances, thus paves a novel way of explaining deep learning models directly from the neurons' activation pattern.
Edit intent: clarity
Original:  Following the spirit of Trefftz methods, trial and test spaces are spanned by non-polynomial complex wave functions that satisfy the Schr\"odinger equation locally on each element of the space-time mesh.
Revised:  Following the spirit of Trefftz methods, trial and test spaces are spanned by non-polynomial complex wave functions that satisfy the Schro\"odinger equation locally on each element of the space-time mesh.
Edit intent: fluency
Original:  This allows to significantly reduce the number of degrees of freedom in comparison with full polynomial spaces.
Revised:  This allows for a significant reduction in the number of degrees of freedom in comparison with full polynomial spaces.
Edit intent: fluency
Original:  We prove well-posedness and stability of the method, and, for the one- and two-dimensional cases, optimal, high-order, h-convergence error estimates in a skeleton norm.
Revised:  We prove well-posedness and stability of the method, and, for the one- and two- dimensional cases, optimal, high-order, h-convergence error estimates in a skeleton norm.
Edit intent: fluency
Original:  However, due to end-to-end encryption, there is currently no easy way to fact-check content on WhatsApp  at scale.
Revised:  However, due to end-to-end encryption, there is currently no easy way to fact-check content on WhatsApp and other end-to-end encrypted platforms at scale.
Edit intent: clarity
Original:  In this paper, we analyze the usefulness of a crowd-sourced system on WhatsApp through which users can submit  "tips" containing messages they want fact-checked.
Revised:  In this paper, we analyze the usefulness of a crowd-sourced "tipline" through which users can submit "tips" containing messages they want fact-checked.
Edit intent: clarity
Original:  In this paper, we analyze the usefulness of a crowd-sourced system on WhatsApp through which users can submit  "tips" containing messages they want fact-checked.
Revised:  In this paper, we analyze the usefulness of a crowd-sourced system on WhatsApp through which users can submit content ( "tips" containing messages they want fact-checked.
Edit intent: clarity
Original:  In this paper, we analyze the usefulness of a crowd-sourced system on WhatsApp through which users can submit  "tips" containing messages they want fact-checked.
Revised:  In this paper, we analyze the usefulness of a crowd-sourced system on WhatsApp through which users can submit "tips" ) that they want fact-checked.
Edit intent: clarity
Original:  Overall, the analysis suggests tiplines can be an effective source for discovering content to fact-check.
Revised:  Overall, our findings suggest tiplines can be an effective source for discovering content to fact-check.
Edit intent: clarity
Original:  The results show that the proposed method produces very accurate predictions (99.99\% and 81.87\% for 1 step (10 minutes) and 6 step (1 hour) ahead, respectively, and outperforms the benchmark approaches significantly (+22.4\% for one-step-ahead prediction and +6.2\% for 6 steps ahead).
Revised:  The results show that the proposed method produces very accurate predictions (99.99\% and 81.87\% for 1 step (10 minutes) and 6 steps (1 hour) ahead, respectively, and outperforms the benchmark approaches significantly (+22.4\% for one-step-ahead prediction and +6.2\% for 6 steps ahead).
Edit intent: fluency