wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our findings challenge the generality of widespread popularity dynamics patterns as well as common assumptions of attention economy, suggesting the need to critically reconsider the assumption that collective attention is inherently limited .
Revised:  Our findings challenge the universal applicability of popularity dynamics patterns as well as common assumptions of attention economy, suggesting the need to critically reconsider the assumption that collective attention is inherently limited .
Edit intent: clarity
Original:  For this, two numerical strategies are presented:  A Lagrange multiplier formulation and a penalty regularization.
Revised:  For this, two numerical strategies are presented: For this, two numerical strategies are presented: A Lagrange multiplier formulation and a penalty regularization.
Edit intent: fluency
Original:  and  if e\ne f, then e intersects \gamma_f at most once, either  a crossing or an end of e.
Revised:  and if e\ne f, then e intersects \gamma_f at most once, either in a crossing or an end of e.
Edit intent: clarity
Original:  In order to achieve good performance , a preprocessing step of frequency selection to remove the deleterious influences of highly noisy measurements is often adopted.
Revised:  In order to obtain good reconstructions , a preprocessing step of frequency selection to remove the deleterious influences of highly noisy measurements is often adopted.
Edit intent: clarity
Original:  In order to achieve good performance , a preprocessing step of frequency selection to remove the deleterious influences of highly noisy measurements is often adopted.
Revised:  In order to achieve good performance , a preprocessing step of frequency selection to remove the deleterious influences of the noise is often adopted.
Edit intent: clarity
Original:  Experiments with a public domain dataset, i.e., Open MPI dataset, show that it can give accurate reconstructions, and is less prone to noisy measurements, which is clearly illustrated by the quantitative (PSNR / SSIM) and qualitative comparisons with the standard approach .
Revised:  Experiments with a public domain dataset, i.e., Open MPI dataset, show that it can give accurate reconstructions, and is less prone to noisy measurements, which is illustrated by quantitative (PSNR / SSIM) and qualitative comparisons with the standard approach .
Edit intent: coherence
Original: Forms of human communication are not static --- we expect some evolution in the way information is conveyed over time because of advances in technology.
Revised: Forms of human communication are not static -- we expect some evolution in the way information is conveyed over time because of advances in technology.
Edit intent: fluency
Original:  We argue that the resulting logic, strong-separation logic, can be used for compositional program verification and bi-abductive static analysis just like "standard" separation logic, while remaining decidable even in the presence of both the magic wand and the list-segment predicate---a combination of features that leads to undecidability assuming the standard semantics.
Revised:  We argue that the resulting logic, strong-separation logic, can be used for compositional program verification and bi-abductive static analysis just like "standard" separation logic, while remaining decidable even in the presence of both the magic wand and the list-segment predicate -- a combination of features that leads to undecidability assuming the standard semantics.
Edit intent: fluency
Original: Community detection in a network plays a crucial role in the economic and financial contexts, specifically when applied to the World Trade Network.
Revised: In this paper, we investigate the mesoscale structure of the World Trade Network.
Edit intent: clarity
Original:  The numerical analyses highlight peculiar relationships between countries and provide a rich set of information that can hardly be achieved within alternative clustering approaches.
Revised:  The numerical analysis highlights peculiar relationships between countries and provide a rich set of information that can hardly be achieved within alternative clustering approaches.
Edit intent: fluency
Original:  The numerical analyses highlight peculiar relationships between countries and provide a rich set of information that can hardly be achieved within alternative clustering approaches.
Revised:  The numerical analyses highlight peculiar relationships between countries and provides a rich set of information that can hardly be achieved within alternative clustering approaches.
Edit intent: fluency
Original:  It is based on standard notions from probability theory known as stochastic kernels and Markov processes  .
Revised:  It is based on standard notions from probability theory known as stochastic kernels and Markov processes - standard notions from probability theory .
Edit intent: clarity
Original:  We cast our semantics in the framework of infinite probabilistic databases (Grohe and Lindner, ICDT 2020), and we show that the semantics remains meaningful even when the input of a probabilistic Datalog program is an arbitrary probabilistic database.
Revised:  We cast our semantics in the framework of infinite probabilistic databases (Grohe and Lindner, ICDT 2020), and show that the semantics remains meaningful even when the input of a probabilistic Datalog program is an arbitrary probabilistic database.
Edit intent: fluency
Original:  Instead of separating  two-speaker signal in signal space like speech source separation, the proposed approach separates different speaker properties from  two-speaker signal in embedding space.
Revised:  Instead of separating a two-speaker signal in signal space like speech source separation, the proposed approach separates different speaker properties from two-speaker signal in embedding space.
Edit intent: fluency
Original:  Instead of separating  two-speaker signal in signal space like speech source separation, the proposed approach separates different speaker properties from  two-speaker signal in embedding space.
Revised:  Instead of separating two-speaker signal in signal space like speech source separation, the proposed approach separates different speaker properties from a two-speaker signal in embedding space.
Edit intent: fluency
Original:  In step two, the two-speaker signal and the embedding of one of the speakers are  input to a speaker embedding de-mixing network.
Revised:  In step two, the two-speaker signal and the embedding of one of the speakers are both input to a speaker embedding de-mixing network.
Edit intent: clarity
Original:  The de-mixing network is trained to generate the embedding of the other speaker of the by reconstruction loss.
Revised:  The de-mixing network is trained to generate the embedding of the other speaker by reconstruction loss.
Edit intent: clarity
Original:  Speaker identification accuracy on the de-mixed speaker embeddings is used to evaluate the quality of the obtained embeddings.
Revised:  Speaker identification accuracy on the de-mixed embeddings are used to evaluate the quality of the obtained embeddings.
Edit intent: clarity
Original:  Thus existing analyses either incur a penalty for multiply-honest rounds , or treat them neutrally.
Revised:  Thus existing analyses either incur a penalty for multiply-honest rounds or treat them neutrally.
Edit intent: fluency
Original:  We emphasize that these thresholds determine the critical tradeoff between  honest majority, network delays, and consistency error.
Revised:  We emphasize that these thresholds determine the critical tradeoff between the honest majority, network delays, and consistency error.
Edit intent: fluency
Original:  We complement our results with a consistency analysis in the setting where uniquely honest slots are rare, event letting p_h = 0, under the added assumption that honest players adopt a consistent chain selection rule.
Revised:  We complement our results with a consistency analysis in the setting where uniquely honest slots are rare, even letting p_h = 0, under the added assumption that honest players adopt a consistent chain selection rule.
Edit intent: coherence
Original: We improve the fundamental security threshold of  Proof-of-Stake (PoS) blockchain protocols , reflecting for the first time  the positive effect of rounds with multiple honest leaders.
Revised: We improve the fundamental security threshold of Proof-of-Stake (PoS) blockchain protocols , reflecting for the first time , the positive effect of rounds with multiple honest leaders.
Edit intent: fluency
Original:  Current analyses of the longest-chain rule in PoS blockchain protocols reduce consistency to the dynamics of an abstract, round-based block creation process  determined by three probabilities: p_A, the probability that a roundhas at least one adversarial leader ;
Revised:  Current security analyses reduce consistency to the dynamics of an abstract, round-based block creation process determined by three probabilities: p_A, the probability that a roundhas at least one adversarial leader ;
Edit intent: clarity
Original:  Current analyses of the longest-chain rule in PoS blockchain protocols reduce consistency to the dynamics of an abstract, round-based block creation process  determined by three probabilities: p_A, the probability that a roundhas at least one adversarial leader ;
Revised:  Current analyses of the longest-chain rule in PoS blockchain protocols reduce consistency to the dynamics of an abstract, round-based block creation process that is determined by three probabilities: p_A, the probability that a roundhas at least one adversarial leader ;
Edit intent: clarity
Original:  This is a first in the literature and can be applied to both the simple synchronous setting and the setting with bounded delays.
Revised:  This is a first in the literature and can be applied to both the simple synchronous communication as well as communication with bounded delays.
Edit intent: clarity
Original:  We emphasize that these thresholds determine the critical tradeoff between the honest majority, network delays, and consistency error.
Revised:  We emphasize that these thresholds determine the critical trade-off between the honest majority, network delays, and consistency error.
Edit intent: fluency
Original:  We complement our results with a consistency analysis in the setting where uniquely honest slots are rare, even letting p_h = 0, under the added assumption that honest players adopt a consistent chain selection rule.
Revised:  We complement our results with a consistency analysis in the setting where S is rare, even letting p_h = 0, under the added assumption that honest players adopt a consistent chain selection rule.
Edit intent: clarity
Original:  Our analysis provides a direct connection between the Ouroboros analysis focusing on "relative margin" and the Sleepy analysis focusing on "strong pivots."
Edit intent: clarity
Original:  Our counterexample also invalidates the corresponding (but more general) rewritten equations in the more recent Friston (2019 , arXiv:1906.10184v1 ).
Revised:  Our counterexample also invalidates the corresponding (but more general) rewritten equations in the more recent Friston (2019 ).
Edit intent: coherence
Original:  The second error is the lack of a proof of the existence of the free energy as claimed by the Free Energy Lemma  .
Revised:  The second error concerns the Free Energy Lemma .
Edit intent: clarity
Original:  We prove  the non-equivalence with a counterexample that exhibits a Markov blanket but does not satisfy the rewritten equations.
Revised:  We prove by counterexample that the non-equivalence with a counterexample that exhibits a Markov blanket but does not satisfy the rewritten equations.
Edit intent: clarity
Original:  In this note, we arrive at the European Call price under the consider the Constant Elasticity of Variance (CEV) model driven by a mixed sub-fractional Brownian motion  .
Revised:  In this note, we arrive at the European Call price under the Constant Elasticity of Variance (CEV) model driven by a mixed sub-fractional Brownian motion .
Edit intent: clarity
Original:  Moreover, we have defined and evaluated local and global Nash equilibrium points in our structured population by including the concepts of homophily and heterogeneity.
Revised:  Moreover, we have defined and evaluated local and global Nash equilibrium points by including the concepts of homophily and heterogeneity.
Edit intent: clarity
Original:  We have analytically defined and measured novel statistical measures of QoI and user reputation scores based on the evolutionary dynamics.
Revised:  We have analytically defined and measured novel statistical measures of social honesty, QoI and users' behavioural reputation scores based on the evolutionary dynamics.
Edit intent: clarity
Original:  Through the proposed methodology we have defined the core of a DSS for designing novel incentive mechanisms by operating on the policies in terms of QoI and user reputation scores .
Revised:  Through the proposed methodology we have defined the Decision Support System and a novel incentive mechanism by operating on the policies in terms of QoI and user reputation scores .
Edit intent: clarity
Original:  However, rendering volumetric videos as 3D representations (mesh or point cloud) requires lots of computational power and transmission of such volumetric data requires lots of bandwidth .
Revised:  However, rendering volumetric videos as 3D representations (mesh or point cloud) requires lots of computational power which is challenging especially for mobile devices .
Edit intent: clarity
Original:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Revised:  To mitigate this , we developed a streaming system that renders a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Edit intent: clarity
Original:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Revised:  To mitigate this issue, rendering a 2D view from the volumetric video at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Edit intent: clarity
Original:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Revised:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud server and streams a 2D video is a feasible solution .
Edit intent: clarity
Original:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video is a feasible solution .
Revised:  To mitigate this issue, rendering a 2D view from the volumetric data at a cloud /edge server and streaming that as a 2D video stream to the client .
Edit intent: clarity
Original:  However,  network-based processing brings additional network and processing latency .
Revised:  However, such network-based processing brings additional network and processing latency .
Edit intent: clarity
Original:  However,  network-based processing brings additional network and processing latency .
Revised:  However, network-based processing increases the motion-to-photon (M2P) latency due to the additional network and processing latency .
Edit intent: clarity
Original:  However,  network-based processing brings additional network and processing latency .
Revised:  However, network-based processing brings additional network and processing delays .
Edit intent: clarity
Original:  In order to reduce the motion-to-photon latency, prediction of the future user pose is necessary.
Revised:  In order to compensate the added latency, prediction of the future user pose is necessary.
Edit intent: clarity
Original:  We developed a 6DoF user movement prediction model for very low latency streaming services and investigated its potential to further reduce the motion-to-photon latency for different prediction windows .
Revised:  We developed a head motion prediction model and investigated its potential to further reduce the motion-to-photon latency for different prediction windows .
Edit intent: clarity
Original:  We developed a 6DoF user movement prediction model for very low latency streaming services and investigated its potential to further reduce the motion-to-photon latency for different prediction windows .
Revised:  We developed a 6DoF user movement prediction model for very low latency streaming services and investigated its potential to reduce the M2P latency for different prediction windows .
Edit intent: clarity
Original:  We developed a 6DoF user movement prediction model for very low latency streaming services and investigated its potential to further reduce the motion-to-photon latency for different prediction windows .
Revised:  We developed a 6DoF user movement prediction model for very low latency streaming services and investigated its potential to further reduce the motion-to-photon latency for different look-ahead times .
Edit intent: clarity
Original:  Our results show that the developed prediction model on average reduces the positional rendering errors caused by the motion-to-photon latency compared to a baseline system in which no prediction is performed.
Revised:  Our results show that the presented model reduces the rendering errors caused by the motion-to-photon latency compared to a baseline system in which no prediction is performed.
Edit intent: clarity
Original:  Our results show that the developed prediction model on average reduces the positional rendering errors caused by the motion-to-photon latency compared to a baseline system in which no prediction is performed.
Revised:  Our results show that the developed prediction model on average reduces the positional rendering errors caused by the M2P latency compared to a baseline system in which no prediction is performed.
Edit intent: clarity
Original:  A method for variable selection in multiblock analysis, called multiblock variable influence on orthogonal projections ( i.e., Multiblock-VIOP or MB-VIOP) is explained in this paper.
Revised:  A method for variable selection in multiblock analysis, called multiblock variable influence on orthogonal projections ( MB-VIOP) is explained in this paper.
Edit intent: coherence
Original:  We present hierarchical pathway enrichment results stemming from aligned p values , which are compared with results derived from enrichment analysis, as an external validation of our method.
Revised:  We present hierarchical pathway enrichment results stemming from aligned p-values , which are compared with results derived from enrichment analysis, as an external validation of our method.
Edit intent: fluency
Original: In this paper, we demonstrate the interpretative power of partial least square models and how robust interpretability can lead to new quantitative insights.
Revised: In this paper, we demonstrate the interpretative power of partial least square models and how robust interpretability can lead to quantitative insights.
Edit intent: clarity
Original:  Interpretability methods for partial least square decomposition are useful by virtue of OPLS being popular in multivariate analysis, describing specificity of latent variables for corresponding effects.
Edit intent: coherence
Original:  We discuss the statistical properties of the OPLS weights, p-values associated with specific axes, as well as their alignment properties.
Revised:  We discuss the statistical properties of the PLS weights, p-values associated with specific axes, as well as their alignment properties.
Edit intent: clarity
Original: Anomaly detection aims to recognize samples with anomalous and unusual patterns with respect to a set of normal data , which is significant for numerous domain applications, e.g. in industrial inspection, medical imaging, and security enforcement.
Revised: Anomaly detection aims to recognize samples with anomalous and unusual patterns with respect to a set of normal data . This is significant for numerous domain applications, e.g. in industrial inspection, medical imaging, and security enforcement.
Edit intent: coherence
Original: Anomaly detection aims to recognize samples with anomalous and unusual patterns with respect to a set of normal data , which is significant for numerous domain applications, e.g. in industrial inspection, medical imaging, and security enforcement.
Revised: Anomaly detection aims to recognize samples with anomalous and unusual patterns with respect to a set of normal data , which is significant for numerous domain applications, such as industrial inspection, medical imaging, and security enforcement.
Edit intent: clarity
Original:  There are two key research challenges associated with existing anomaly detention approaches: (1) many of them perform well on low-dimensional problems however the performance on high-dimensional instances is limited , such as images  ;
Revised:  There are two key research challenges associated with existing anomaly detection approaches: (1) many of them perform well on low-dimensional problems however the performance on high-dimensional instances is limited , such as images ;
Edit intent: fluency
Original:  There are two key research challenges associated with existing anomaly detention approaches: (1) many of them perform well on low-dimensional problems however the performance on high-dimensional instances is limited , such as images  ;
Revised:  There are two key research challenges associated with existing anomaly detention approaches: (1) many approaches perform well on low-dimensional problems however the performance on high-dimensional instances is limited , such as images ;
Edit intent: clarity
Original:  There are two key research challenges associated with existing anomaly detention approaches: (1) many of them perform well on low-dimensional problems however the performance on high-dimensional instances is limited , such as images  ;
Revised:  There are two key research challenges associated with existing anomaly detention approaches: (1) many of them perform well on low-dimensional problems however the performance on high-dimensional instances , such as images ;
Edit intent: clarity
Original:  (2) many of them depend on often still rely on traditional supervised approaches and manual engineering of features, while the topic has not been fully explored yet using modern deep learning approaches, even when the well-label samples are limited.
Revised:  (2) many approaches often rely on traditional supervised approaches and manual engineering of features, while the topic has not been fully explored yet using modern deep learning approaches, even when the well-label samples are limited.
Edit intent: clarity
Original:  Our key insight is that the impact of small perturbation on the latent representation can be bounded for normal samples while anomaly images are usually outside such bounded intervals, called structure consistency.
Revised:  Our key insight is that the impact of small perturbation on the latent representation can be bounded for normal samples while anomaly images are usually outside such bounded intervals, referred to as structure consistency.
Edit intent: coherence
Original:  It can also %DIF > of anomalies while maintaining a low false alarm rate.
Revised:  %DIF > of anomalies while maintaining a low false alarm rate.
Edit intent: clarity
Original:  At the local level, these three aspects have been simultaneously captured only in the theoretical framework proposed by Mergel et al. (2019) (arXiv:1803.00046) .
Revised:  At the local level, these three aspects are rarely captured simultaneously, but included in the theoretical framework proposed by Mergel et al. (2019) (arXiv:1803.00046) .
Edit intent: clarity
Original:  At the local level, these three aspects have been simultaneously captured only in the theoretical framework proposed by Mergel et al. (2019) (arXiv:1803.00046) .
Revised:  At the local level, these three aspects have been simultaneously captured only in the theoretical models by Mergel et al. (2019) (arXiv:1803.00046) .
Edit intent: clarity