wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g.  journals and publishers, and prosumers, e.g. authors.
Revised:  Here, we probe the impact of questionable publications through a systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g. journals and publishers, and prosumers, e.g. authors.
Edit intent: fluency
Original:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g.  journals and publishers, and prosumers, e.g. authors.
Revised:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis with various participants from academia and compare the results with those of their unaccused counterparts using billions of citation records : the brokers, e.g. journals and publishers, and prosumers, e.g. authors.
Edit intent: clarity
Original:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g.  journals and publishers, and prosumers, e.g. authors.
Revised:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records , including liaisons, e.g. journals and publishers, and prosumers, e.g. authors.
Edit intent: clarity
Original:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g.  journals and publishers, and prosumers, e.g. authors.
Revised:  Here, we probe the impact of questionable publications through the systematic and comprehensive analysis for the various participants in academia compared with their most similar unquestioned counterparts using billions of citation records : the brokers, e.g. , journals and publishers, and prosumers, e.g. authors.
Edit intent: fluency
Original:  Our analysis reveals that the questionable publishers decorate their citation score by the publisher-level self-citations to their journals while they control the journal-level self-citations to evade the evaluation of the journal indexing services;
Revised:  Our analysis reveals that questionable publications embellished their citation scores by attributing publisher-level self-citations to their journals while they control the journal-level self-citations to evade the evaluation of the journal indexing services;
Edit intent: clarity
Original:  Our analysis reveals that the questionable publishers decorate their citation score by the publisher-level self-citations to their journals while they control the journal-level self-citations to evade the evaluation of the journal indexing services;
Revised:  Our analysis reveals that the questionable publishers decorate their citation score by the publisher-level self-citations to their journals while also controlling the journal-level self-citations to evade the evaluation of the journal indexing services;
Edit intent: clarity
Original:  Our analysis reveals that the questionable publishers decorate their citation score by the publisher-level self-citations to their journals while they control the journal-level self-citations to evade the evaluation of the journal indexing services;
Revised:  Our analysis reveals that the questionable publishers decorate their citation score by the publisher-level self-citations to their journals while they control the journal-level self-citations to circumvent the evaluation of the journal indexing services;
Edit intent: clarity
Original:  We also show that both novelty and influence are lower for the questionable publications  than their counterparts implying the negative effect of questionable publications in the academic ecosystem, which provides a valuable basis for future policy-making .
Revised:  We also demonstrate that the questionable publications than their counterparts implying the negative effect of questionable publications in the academic ecosystem, which provides a valuable basis for future policy-making .
Edit intent: coherence
Original:  We also show that both novelty and influence are lower for the questionable publications  than their counterparts implying the negative effect of questionable publications in the academic ecosystem, which provides a valuable basis for future policy-making .
Revised:  We also show that both novelty and influence are lower for the questionable publications than their counterparts . This indicates the negative effect of questionable publications in the academic ecosystem, which provides a valuable basis for future policy-making .
Edit intent: coherence
Original:  We also show that both novelty and influence are lower for the questionable publications  than their counterparts implying the negative effect of questionable publications in the academic ecosystem, which provides a valuable basis for future policy-making .
Revised:  We also show that both novelty and influence are lower for the questionable publications than their counterparts implying the negative effect of suspicious publishers in the academia. The findings provide a basis for actionable policy making against questionable publications .
Edit intent: clarity
Original:  In our evaluation, DIT outperforms an industrial-grade sensor fusion baseline by 10x (90th percentile) and a state-of-the-art adversarial DA technique by > 2.5x in performance (90th percentile) and >10x in training time .
Revised:  In our evaluation, continuous OT DA outperforms a continuous adversarial DA baseline, while also showing quantifiable learning benefits over simple data augmentation. We will release our dataset to help foster future research .
Edit intent: clarity
Original: Neural cellular automata  are a recent model used to model biological phenomena emerging from multicellular organisms.
Revised: Neural cellular automata are a recent framework used to model biological phenomena emerging from multicellular organisms.
Edit intent: clarity
Original:  In these models , artificial neural networks are used as update rules for cellular automata.
Revised:  In these systems , artificial neural networks are used as update rules for cellular automata.
Edit intent: clarity
Original:  They are end-to-end differentiable systems where the parameters of the neural network can be optimized to achieve a particular task.
Revised:  Neural CA are end-to-end differentiable systems where the parameters of the neural network can be optimized to achieve a particular task.
Edit intent: clarity
Original:  They are end-to-end differentiable systems where the parameters of the neural network can be optimized to achieve a particular task.
Revised:  They are end-to-end differentiable systems where the parameters of the neural network can be learned to achieve a particular task.
Edit intent: clarity
Original:  The observations of the environment are transmitted in inputs cells, while the values of output cells are used as  readout of the system.
Revised:  The observations of the environment are transmitted in input cells, while the values of output cells are used as readout of the system.
Edit intent: fluency
Original:  The observations of the environment are transmitted in inputs cells, while the values of output cells are used as  readout of the system.
Revised:  The observations of the environment are transmitted in inputs cells, while the values of output cells are used as a readout of the system.
Edit intent: fluency
Original:  We trained the model using deep-Q learning, where the states of the output cells were used as the q-value estimates to be optimized.
Revised:  We trained the model using deep-Q learning, where the states of the output cells were used as the Q-value estimates to be optimized.
Edit intent: fluency
Original:  Such efforts gave birth, among the others, to the two-variable fragment , the guarded fragment, depending on the type of restriction imposed on formulae from the language.
Revised:  Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of restriction imposed on formulae from the language.
Edit intent: fluency
Original:  Despite the success of the mentioned logics in  formal verification and knowledge representation, such first-order fragments are too weak to express even the simplest statistical constraints, required for modelling of influence networks or in statistical reasoning.
Revised:  Despite the success of the mentioned logics in areas like formal verification and knowledge representation, such first-order fragments are too weak to express even the simplest statistical constraints, required for modelling of influence networks or in statistical reasoning.
Edit intent: clarity
Original:  In this work we investigate the extensions of these classical decidable logics with percentage quantifiers, specifying how frequent a formula is satisfied in the indented model.
Revised:  In this work we investigate the extensions of these classical decidable logics with percentage quantifiers, specifying how frequently a formula is satisfied in the indented model.
Edit intent: fluency
Original: In recent years, the growth of Machine Learning algorithms in a variety of different applications has raised numerous studies on the applicability of these algorithms in real scenarios.
Revised: In recent years, the growth of Machine Learning (ML) algorithms has raised the number of studies including their applicability in a variety of different scenarios.
Edit intent: clarity
Original:  Among all, one of the hardest scenarios , due to its physical requirements, is the aerospace one .
Revised:  Among all, one of the hardest ones is the aerospace , due to its physical requirements, is the aerospace one .
Edit intent: clarity
Original:  Among all, one of the hardest scenarios , due to its physical requirements, is the aerospace one .
Revised:  Among all, one of the hardest scenarios , due to its peculiar physical requirements .
Edit intent: clarity
Original:  In this context, the authors of this work aim to propose a first prototype and a study of feasibility for an AI model to be 'loaded' on board .
Revised:  In this context, a feasibility study and a first prototype for an Artificial Intelligence (AI) model to be 'loaded' on board .
Edit intent: clarity
Original:  As a case study, the authors decided to investigate the detection of volcanic eruptions  as a method to swiftly produce alerts  .
Revised:  As a case study, the detection of volcanic eruptions as a method to swiftly produce alerts .
Edit intent: clarity
Original:  Two Convolutional Neural Networks  have been proposed and created, also showing how to correctly implement them on real hardware and how the complexity of a CNN can be adapted to fit computational requirements.
Revised:  Two Convolutional Neural Networks (CNNs) have been proposed and created, also showing how to correctly implement them on real hardware and how the complexity of a CNN can be adapted to fit computational requirements.
Edit intent: clarity
Original:  Two Convolutional Neural Networks  have been proposed and created, also showing how to correctly implement them on real hardware and how the complexity of a CNN can be adapted to fit computational requirements.
Revised:  Two Convolutional Neural Networks have been proposed and designed, showing how to correctly implement them on real hardware and how the complexity of a CNN can be adapted to fit computational requirements.
Edit intent: clarity
Original: Compressive phase retrieval is a popular variant of the standard compressive sensing problem , in which the measurements only contain magnitude information.
Revised: Compressive phase retrieval is a popular variant of the standard compressive sensing problem in which the measurements only contain magnitude information.
Edit intent: fluency
Original:  In this paper, motivated by recent advances in deep generative models, we provide recovery guarantees with order-optimal sample complexity bounds for phase retrieval with generative priors.
Revised:  In this paper, motivated by recent advances in deep generative models, we provide recovery guarantees with near-optimal sample complexity for phase retrieval with generative priors.
Edit intent: clarity
Original:  We first show that when using i.i.d. Gaussian measurements and an L-Lipschitz continuous generative model with bounded k-dimensional inputs, roughly O(k \log L) samples suffice to guarantee that the signal is close to any vector that minimizes an amplitude-based empirical loss function  .
Revised:  We first show that when using i.i.d. Gaussian measurements and an L-Lipschitz continuous generative model with bounded k-dimensional inputs, roughly O(k \log L) samples suffice to guarantee that any signal minimizing an amplitude-based empirical loss function .
Edit intent: clarity
Original:  To partially address this, we further show that roughly O(k \log L) samples ensure sufficient closeness between the  signal and any {\em globally optimal} solution to an optimization problem designed for spectral initialization (though finding such a solution may still be challenging).
Revised:  To partially address this, we further show that roughly O(k \log L) samples ensure sufficient closeness between the underlying signal and any {\em globally optimal} solution to an optimization problem designed for spectral initialization (though finding such a solution may still be challenging).
Edit intent: clarity
Original:  We  adapt this result to sparse phase retrieval, and show that O(s \log n) samples are sufficient for a similar guarantee when the underlying signal is s-sparse and n-dimensional, matching an information-theoretic lower bound.
Revised:  We also adapt this result to sparse phase retrieval, and show that O(s \log n) samples are sufficient for a similar guarantee when the underlying signal is s-sparse and n-dimensional, matching an information-theoretic lower bound.
Edit intent: clarity
Original:  While our guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe significant performance gains over various existing spectral initialization methods of sparse phase retrieval.
Revised:  While these guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe significant performance gains over various existing spectral initialization methods of sparse phase retrieval.
Edit intent: fluency
Original:  While our guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe significant performance gains over various existing spectral initialization methods of sparse phase retrieval.
Revised:  While our guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe performance gains over various existing spectral initialization methods of sparse phase retrieval.
Edit intent: clarity
Original:  While our guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe significant performance gains over various existing spectral initialization methods of sparse phase retrieval.
Revised:  While our guarantees do not directly correspond to a practical algorithm, we propose a practical spectral initialization method motivated by our findings, and experimentally observe significant performance gains over various existing spectral initialization methods for sparse phase retrieval.
Edit intent: fluency
Original:  Performance is demonstrated using a multi-floor multi-room indoor experiment, a large-scale outdoor experiment and a simulated dataset . Relative to our baseline, the presented approach demonstrates improved scalability and accuracy.
Revised:  Performance is demonstrated using a multi-floor multi-room indoor experiment, a large-scale outdoor experiment and simulated datasets . Relative to our baseline, the presented approach demonstrates improved scalability and accuracy.
Edit intent: fluency
Original: Finding the similarities and differences between two or more groups of datasets is a fundamental analysis task.
Revised: Finding the similarities and differences between groups of datasets is a fundamental analysis task.
Edit intent: clarity
Original:  In this work, we introduce an interactive DR framework where we integrate our new DR method, called ULCA (unified linear comparative analysis), with an interactive visual interface.
Revised:  This paper presents an interactive DR framework where we integrate our new DR method, called ULCA (unified linear comparative analysis), with an interactive visual interface.
Edit intent: clarity
Original:  Additionally, we provide an interactive visualization interface to examine ULCA resultswith a rich set of analysis libraries .
Revised:  Additionally, the interactive visualization interface to examine ULCA resultswith a rich set of analysis libraries .
Edit intent: coherence
Original:  Additionally, we provide an interactive visualization interface to examine ULCA resultswith a rich set of analysis libraries .
Revised:  Additionally, we provide an interactive visualization interface facilitates interpretation and refinement of the ULCA results .
Edit intent: clarity
Original:  We evaluate ULCA and the optimization algorithm to show their efficiency as well as present multiple case studies using real-world datasets to demonstrate the usefulness of our framework.
Revised:  We evaluate ULCA and the optimization algorithm to show their efficiency as well as present multiple case studies using real-world datasets to demonstrate the usefulness of this framework.
Edit intent: clarity
Original: Motivation: Alignment-free (AF , for short ) distance/similarity functions are a key tool for sequence analysis.
Revised: Motivation: Alignment-free (AF ) distance/similarity functions are a key tool for sequence analysis.
Edit intent: coherence
Original:  However, assessment of their power, i.e., their ability to identify true similarity, has been limited to some members or variants of the%DIFDELCMD < \Dd %%% family and the asymptotic theoretic results have been complemented by experimental studies on short sequences, not adequate for current genome-scale applications .
Revised:  However, assessment of their power, i.e., their ability to identify true similarity, has been limited to some members %DIFDELCMD < \Dd %%% family and the asymptotic theoretic results have been complemented by experimental studies on short sequences, not adequate for current genome-scale applications .
Edit intent: clarity
Original:  However, assessment of their power, i.e., their ability to identify true similarity, has been limited to some members or variants of the%DIFDELCMD < \Dd %%% family and the asymptotic theoretic results have been complemented by experimental studies on short sequences, not adequate for current genome-scale applications .
Revised:  However, assessment of their power, i.e., their ability to identify true similarity, has been limited to some members or variants of the%DIFDELCMD < \Dd %%% family and the asymptotic theoretic results have been complemented by experimental studies on short sequences, not adequate for current applications, where sequence lengths may vary considerably .
Edit intent: clarity
Original:  Results: By concentrating on histogram-based AF functions, we perform the first coherent and uniform evaluation of the power of those functions , involving also Type I error for completeness.
Revised:  Results: By concentrating on histogram-based AF functions, we perform the first coherent and uniform evaluation of the power , involving also Type I error for completeness.
Edit intent: clarity
Original:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer),  sequence lengths from a few thousand to millions  and different values of k  . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Revised:  Two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer), sequence lengths from a few thousand to millions and different values of k . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Edit intent: coherence
Original:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer),  sequence lengths from a few thousand to millions  and different values of k  . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Revised:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer), a wide range of sequence lengths from a few thousand to millions and different values of k . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Edit intent: clarity
Original:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer),  sequence lengths from a few thousand to millions  and different values of k  . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Revised:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer), sequence lengths from a few thousand to millions , and different values of k . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Edit intent: fluency
Original:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer),  sequence lengths from a few thousand to millions  and different values of k  . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Revised:  The experiments carried out are extensive, as we use two Alternative models of important genomic features (CIS Regulatory Modules and Horizontal Gene Transfer), sequence lengths from a few thousand to millions and different values of k have been used . As a result, and using power, we provide a characterization of those AF functions that is novel and informative.
Edit intent: clarity