wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our computational model is a bump attractor network whose architecture is reshaped dynamically during each trial, linking changes to network connectivity with a predictive distribution based on observations of prior trials . Applying timescale separation methods, we can obtain a low-dimensional description of the trial-to-trial bias based on the history of target locations.
Revised:  Network connectivity is reshaped dynamically during each trial, linking changes to network connectivity with a predictive distribution based on observations of prior trials . Applying timescale separation methods, we can obtain a low-dimensional description of the trial-to-trial bias based on the history of target locations.
Edit intent: clarity
Original:  Our computational model is a bump attractor network whose architecture is reshaped dynamically during each trial, linking changes to network connectivity with a predictive distribution based on observations of prior trials . Applying timescale separation methods, we can obtain a low-dimensional description of the trial-to-trial bias based on the history of target locations.
Revised:  Our computational model is a bump attractor network whose architecture is reshaped dynamically during each trial, providing a mechanism for generating predictions from prior trial observations . Applying timescale separation methods, we can obtain a low-dimensional description of the trial-to-trial bias based on the history of target locations.
Edit intent: clarity
Original:  The model still has response statistics whose mean is centered at the true target location in the limit of a large number of trials .
Revised:  The model has response statistics whose mean is centered at the true target location in the limit of a large number of trials .
Edit intent: clarity
Original:  The model still has response statistics whose mean is centered at the true target location in the limit of a large number of trials .
Revised:  The model still has response statistics whose mean is centered at the true target location across many trials, typical of such visual working memory tasks .
Edit intent: clarity
Original:  We provide an extensive empirical analysis of the obtained structure as well as some theoretical heuristics .
Revised:  We provide an extensive empirical analysis of the obtained structure as well as some theoretical results .
Edit intent: clarity
Original:  In this paper, we suggest a principle called "preferential placement", which allows to model a realistic community structure.
Revised:  In this paper, we suggest a principle called "preferential placement", which allows to model a realistic clustering structure.
Edit intent: clarity
Original: Results from a recent MEG study on spoken sentence comprehension (Ding et al., 2016) have been interpreted as evidence for cortical entrainment to hierarchical syntactic structure.
Revised: Results from a recent MEG study on spoken sentence comprehension have been interpreted as evidence for cortical entrainment to hierarchical syntactic structure.
Edit intent: clarity
Original:  We present a simple computational model that predicts the power spectra from this study, even though the model's linguistic knowledge is restricted to the lexical level  and word-level representations are not combined into higher-level units  .
Revised:  We present a simple computational model that predicts the power spectra from this study, even though the model's linguistic knowledge is restricted to the lexical level , and word-level representations are not combined into higher-level units .
Edit intent: fluency
Original: We study the general problem of testing whether an unknown discrete distribution belongs to a given family of distributions.
Revised: We study the general problem of testing whether an unknown distribution belongs to a given family of distributions.
Edit intent: clarity
Original: We study the general problem of testing whether an unknown discrete distribution belongs to a given family of distributions.
Revised: We study the general problem of testing whether an unknown discrete distribution belongs to a specified family of distributions.
Edit intent: clarity
Original:  The sample complexity of this general problem depends on the underlying family P.
Revised:  The sample complexity of this general inference task depends on the underlying family P.
Edit intent: clarity
Original:  The main contribution of this work is a new and simple testing technique that is applicable to  distribution families whose Fourier spectrum approximately satisfies a certain  sparsity property.
Revised:  The main contribution of this work is a new and simple testing technique that is applicable to all distribution families whose Fourier spectrum approximately satisfies a certain sparsity property.
Edit intent: clarity
Original:  The main contribution of this work is a new and simple testing technique that is applicable to  distribution families whose Fourier spectrum approximately satisfies a certain  sparsity property.
Revised:  The main contribution of this work is a new and simple testing technique that is applicable to distribution families whose Fourier spectrum satisfies a certain sparsity property.
Edit intent: clarity
Original:  As the main applications of our Fourier-based testing technique, we obtain the first non-trivial testers for two fundamental families of discrete distributions : Sums of Independent Integer Random Variables (SIIRVs) and Poisson Multinomial Distributions (PMDs) .
Revised:  As the main applications of our Fourier-based framework to obtain near sample-optimal and computationally efficient testers for the following fundamental distribution families : Sums of Independent Integer Random Variables (SIIRVs) and Poisson Multinomial Distributions (PMDs) .
Edit intent: clarity
Original:  As the main applications of our Fourier-based testing technique, we obtain the first non-trivial testers for two fundamental families of discrete distributions : Sums of Independent Integer Random Variables (SIIRVs) and Poisson Multinomial Distributions (PMDs) .
Revised:  As the main applications of our Fourier-based testing technique, we obtain the first non-trivial testers for two fundamental families of discrete distributions : Sums of Independent Integer Random Variables (SIIRVs) , Poisson Multinomial Distributions (PMDs) .
Edit intent: fluency
Original: The features of collaboration behaviors are often considered to be different from discipline to discipline.
Revised: The features of collaboration patterns are often considered to be different from discipline to discipline.
Edit intent: clarity
Original:  Meanwhile, collaborating among disciplines is an obvious feature emerged in modern scientific research, which incubates several interdisciplines , such as sustainability science .
Revised:  Meanwhile, collaborating among disciplines is an obvious feature emerged in modern scientific research, which incubates several interdisciplines .
Edit intent: clarity
Original:  In the aspect of similarities, the dataemerge the similar transitivity and assortativity of collaboration behaviors, the identical distribution type of collaborators per author and that of papers per author  .
Revised:  From those data, we found similar transitivity and assortativity of collaboration behaviors, the identical distribution type of collaborators per author and that of papers per author .
Edit intent: clarity
Original:  In the aspect of similarities, the dataemerge the similar transitivity and assortativity of collaboration behaviors, the identical distribution type of collaborators per author and that of papers per author  .
Revised:  In the aspect of similarities, the dataemerge the similar transitivity and assortativity of collaboration patterns as well as the identical distribution type of collaborators per author and that of papers per author .
Edit intent: clarity
Original:  It is shown how this type of constraint increases the market price of risk and decreases the interest rate  , producing a higher equity risk premium and asset price bubbles .
Revised:  It is shown how this type of constraint increases the market price of risk and decrease the interest rate , producing a higher equity risk premium and asset price bubbles .
Edit intent: fluency
Original:  It is shown how this type of constraint increases the market price of risk and decreases the interest rate  , producing a higher equity risk premium and asset price bubbles .
Revised:  It is shown how this type of constraint increases the market price of risk and decreases the interest rate , producing a higher equity risk premium .
Edit intent: clarity
Original:  Finally , more preference types causes a reduction in the severity of crisis and a lower relative deviation from complete markets in  all variables.
Revised:  Finally , more preference types causes a reduction in the severity of crisis and a lower relative deviation from complete markets in almost all variables.
Edit intent: clarity
Original: This paper solves an open problem in financial mathematics by characterizing the equilibrium in a continuous time financial market populated by heterogeneous agents who differ in their rate of relative risk aversion and face convex portfolio constraints.
Revised: This paper characterizes the equilibrium in a continuous time financial market populated by heterogeneous agents who differ in their rate of relative risk aversion and face convex portfolio constraints.
Edit intent: clarity
Original:  We introduce a theoretical framework to compute the epidemic threshold in continuous time through the infection propagator approach.
Revised:  We propose a theoretical framework to compute the epidemic threshold in continuous time through the infection propagator approach.
Edit intent: clarity
Original:  We validate our findings against analytical and numerical results, and provide novel mathematical interpretations{\em   of annealed networks  and time scale separation  .
Revised:  We introduce the{\em of annealed networks and time scale separation .
Edit intent: clarity
Original: We present a mesh-structure data administration technique for the bookkeeping of adaptive mesh refinement , in particular h-refinement, of rectangular parallelepiped meshes.
Revised: We present an administration technique for the bookkeeping of adaptive mesh refinement , in particular h-refinement, of rectangular parallelepiped meshes.
Edit intent: clarity
Original: We present a mesh-structure data administration technique for the bookkeeping of adaptive mesh refinement , in particular h-refinement, of rectangular parallelepiped meshes.
Revised: We present a mesh-structure data administration technique for the bookkeeping of adaptive mesh refinement on (hyper-)rectangular meshes.
Edit intent: clarity
Original:  It is easy to use and avoids the traversing of the connectivity graph for the ancestry .
Revised:  It is easy to use and avoids traversing the connectivity graph for the ancestry .
Edit intent: fluency
Original:  Due to the rectangular structure of the mesh , the identification of the siblings and the neighboring cells is also greatly simplified.
Revised:  Due to the employed rectangular mesh structure , the identification of the siblings and the neighboring cells is also greatly simplified.
Edit intent: clarity
Original:  Due to the rectangular structure of the mesh , the identification of the siblings and the neighboring cells is also greatly simplified.
Revised:  Due to the rectangular structure of the mesh , the identification of the siblings and the neighbouring cells is greatly simplified.
Edit intent: clarity
Original:  It is particularly designed for smooth meshes, and uses their smoothness dynamically in the matrix operations.
Revised:  The administration technique is particularly designed for smooth meshes, and uses their smoothness dynamically in the matrix operations.
Edit intent: clarity
Original:  It is particularly designed for smooth meshes, and uses their smoothness dynamically in the matrix operations.
Revised:  It is particularly designed for smooth meshes, where the smoothness is dynamically used in the matrix operations.
Edit intent: clarity
Original:  most notably, the first application of an h-refinement  a 2D cancer growth and invasion problem.
Revised:  most notably, the first application of an h-refinement a 2D tumour growth and invasion problem.
Edit intent: fluency
Original: Several recent studies have tackled the issue of optimal network immunization , by providing efficient criteria to identify key nodes to be removed in order to break apart a network, thus preventing the occurrence of extensive epidemic outbreaks.
Revised: Several recent studies have tackled the issue of optimal network immunization by providing efficient criteria to identify key nodes to be removed in order to break apart a network, thus preventing the occurrence of extensive epidemic outbreaks.
Edit intent: fluency
Original:  Yet, although the efficiency of those criteria has been demonstrated also in empirical networks, preventive immunization is rarely applied to real world scenarios, where the usual approach is the a posteriori attempt to contain epidemic outbreaks using quarantine measures.
Revised:  Yet, although the efficiency of those criteria has been demonstrated also in empirical networks, preventive immunization is rarely applied to real-world scenarios, where the usual approach is the a posteriori attempt to contain epidemic outbreaks using quarantine measures.
Edit intent: fluency
Original:  We show how, consistent with common sense, but contrary to common practice, preventing is almost always better than curing:  rescuing an infected network by quarantine becomes inefficient soon after the first infection.
Revised:  We show how, consistent with common sense, but contrary to common practice, in many cases preventing is better than curing: rescuing an infected network by quarantine becomes inefficient soon after the first infection.
Edit intent: clarity
Original:  We show how, consistent with common sense, but contrary to common practice, preventing is almost always better than curing:  rescuing an infected network by quarantine becomes inefficient soon after the first infection.
Revised:  We show how, consistent with common sense, but contrary to common practice, preventing is almost always better than curing: rescuing an infected network by quarantine could become inefficient soon after the first infection.
Edit intent: clarity
Original: We present a formal problem definition and an algorithm to solve the Fair Top-k Ranking problem .
Revised: In this work, we define and solve the Fair Top-k Ranking problem .
Edit intent: clarity
Original:  Our definition of ranked group fairness uses the standard notion of protected group to extend the concept of group fairness.
Revised:  Our definition of ranked group fairness definition extends group fairness using the standard notion of protected group to extend the concept of group fairness.
Edit intent: clarity
Original:  The utility objective favors rankings in which every candidate included in the ranking is more qualified than any candidate not included , and rankings in which candidates are sorted by decreasing qualifications.
Revised:  The utility objective favors rankings in which every candidate included in the ranking is more qualified than every candidate not included , and rankings in which candidates are sorted by decreasing qualifications.
Edit intent: clarity
Original:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group  .
Revised:  To the best of our knowledge, this is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group .
Edit intent: coherence
Original:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group  .
Revised:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can mitigate biases in ranking against an under-represented group .
Edit intent: coherence
Original:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group  .
Revised:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in the representation of an under-represented group .
Edit intent: clarity
Original:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group  .
Revised:  To the best of our knowledge, FA*IR is the first algorithm grounded in statistical tests that can be used to mitigate biases in ranking against an under-represented group along a ranked list .
Edit intent: clarity
Original:  A new kinetic trapping mechanism - "pathway trapping" - yields metastable spatial patterns by preventing minimization of the particle's pseudo-energy  .
Revised:  A new kinetic trapping mechanism - "pathway trapping" - determines the pseudo-energy .
Edit intent: clarity
Original:  Noise in cellular automata reduces the trapping, thus further increases the spatial order.
Revised:  Noise in secretion and sensing can liberate the trapped particles and further increase cells' spatial order.
Edit intent: clarity
Original:  We generalize our framework to lattices with multiple types of cells and signals.
Revised:  We generalize our framework to multiple types of cells and signals.
Edit intent: clarity
Original:  Our work shows that establishing statistical mechanics of computational algorithms can reveal collective dynamics of signal-processing in biological and physical networks .
Revised:  Our approach may be extended to understand more complex forms of cell-cell communications .
Edit intent: clarity
Original: In multicellular systems, including microbial communities and developing organs, cells often communicate to coordinate their gene expressions and generate ordered spatial patternsor structures . 'Secrete-and-sense cells' simultaneously secrete and sense the same molecule .
Revised: Communicating cells can coordinate their gene expressions and generate ordered spatial patternsor structures . 'Secrete-and-sense cells' simultaneously secrete and sense the same molecule .
Edit intent: clarity
Original: In multicellular systems, including microbial communities and developing organs, cells often communicate to coordinate their gene expressions and generate ordered spatial patternsor structures . 'Secrete-and-sense cells' simultaneously secrete and sense the same molecule .
Revised: In multicellular systems, including microbial communities and developing organs, cells often communicate to coordinate their gene expressions to form spatial patterns . 'Secrete-and-sense cells' simultaneously secrete and sense the same molecule .
Edit intent: clarity
Original: In multicellular systems, including microbial communities and developing organs, cells often communicate to coordinate their gene expressions and generate ordered spatial patternsor structures . 'Secrete-and-sense cells' simultaneously secrete and sense the same molecule .
Revised: In multicellular systems, including microbial communities and developing organs, cells often communicate to coordinate their gene expressions and generate ordered spatial patternsor structures . 'Secrete-and-sense cells' secrete and sense the same molecule .
Edit intent: clarity
Original:  We map an ensemble of cellular lattices with the same 'macrostate' variables -  spatial order parameter and average output-gene expression - onto a particle that drifts and diffuses down a pseudo-energy landscape in a phase space defined by the macrostate variables.
Revised:  We map an ensemble of cellular lattices with the same 'macrostate' variables - ' spatial order parameter and average output-gene expression - onto a particle that drifts and diffuses down a pseudo-energy landscape in a phase space defined by the macrostate variables.
Edit intent: fluency
Original:  We map an ensemble of cellular lattices with the same 'macrostate' variables -  spatial order parameter and average output-gene expression - onto a particle that drifts and diffuses down a pseudo-energy landscape in a phase space defined by the macrostate variables.
Revised:  We map an ensemble of cellular lattices with the same 'macrostate' variables - spatial order parameter ' and average gene-expression level - onto a particle that drifts and diffuses down a pseudo-energy landscape in a phase space defined by the macrostate variables.
Edit intent: clarity
Original:  Our approach may be extended to understand more complex forms of cell-cell communications .
Revised:  Our approach may be extended to understand more complex forms of cellular communication .
Edit intent: fluency
Original:  Classifying cellular lattices by 'macrostate' variables - 'spatial order parameter ' and average gene-expression level - reveals a conceptual picture: cellular lattices act as particles rolling down on 'pseudo-energy landscapes' shaped by a 'Hamiltonian' for cellular communication.
Revised:  Classifying cellular lattices by 'macrostate' variables - 'spatial order paramete ' and average gene-expression level - reveals a conceptual picture: cellular lattices act as particles rolling down on 'pseudo-energy landscapes' shaped by a 'Hamiltonian' for cellular communication.
Edit intent: fluency
Original: Neural networks are powerful computing tools that have been exploited by  evolution and by humans for solving diverse problems.
Revised: The neural network is a powerful computing framework that has been exploited by evolution and by humans for solving diverse problems.
Edit intent: clarity
Original:  Although the computational capabilities of neural networks are determined by their structure, the current understanding of the relationships between a neural network's structure and function is still primitive.
Revised:  Although the computational capabilities of neural networks are determined by their structure, the current understanding of the relationships between a neural network's architecture and function is still primitive.
Edit intent: clarity
Original:  Here we reveal that neural network's modular structure plays a vital role in determining the neural dynamics and memory performance of the network.
Revised:  Here we reveal that neural network's modular architecture plays a vital role in determining the neural dynamics and memory performance of the network.
Edit intent: clarity
Original:  Our results suggest that insights from dynamical analysis of neural networks and information spreading processes can be leveraged to better design neural networks and potentially shed light on the brain's modular organization.
Revised:  Our results suggest that insights from dynamical analysis of neural networks and information spreading processes can be leveraged to better design neural networks and may shed light on the brain's modular organization.
Edit intent: clarity
Original:  Therefore, it is likely that the previously-reported performance of most ligand-based methods can be explained by overfitting to benchmarks rather than good prospective accuracy.
Revised:  Therefore, it may be that the previously-reported performance of most ligand-based methods can be explained by overfitting to benchmarks rather than good prospective accuracy.
Edit intent: clarity
Original:  To answer this question, we can model real-world dynamic systems as networks, where a network is represented by a set of vertices and their corresponding links.
Revised:  By representing real-world dynamic systems as networks, where a network is represented by a set of vertices and their corresponding links.
Edit intent: clarity
Original:  Three primary observations emerged: first, links are most prevalent among vertices that join a network at a similar time;
Revised:  Three primary observations resulted: (a) links are most prevalent among vertices that join a network at a similar time;
Edit intent: clarity