wanyu/IteraTeR_v2 huggingface dataset:
Original:  Recent work has proposed to approximate BP by linearizing the update equations around default values for the special case when all edges in the Markov network carry the same symmetric, doubly stochastic potential .
Revised:  Recent work has proposed to approximate BP by linearizing the update equations around default values for the special case when all edges in the MRF carry the same symmetric, doubly stochastic potential .
Edit intent: clarity
Original:  The present paper generalizes our prior work on Linearized Belief Propagation (LinBP) with an approach that approximates Loopy Belief Propagation on any pairwise Markov network with the problem of solving a linear equation system  .
Revised:  The present paper generalizes all prior work and derives an approach that approximates Loopy Belief Propagation on any pairwise Markov network with the problem of solving a linear equation system .
Edit intent: clarity
Original:  The present paper generalizes our prior work on Linearized Belief Propagation (LinBP) with an approach that approximates Loopy Belief Propagation on any pairwise Markov network with the problem of solving a linear equation system  .
Revised:  The present paper generalizes our prior work on Linearized Belief Propagation (LinBP) with an approach that approximates loopy BP on any pairwise Markov network with the problem of solving a linear equation system .
Edit intent: clarity
Original:  Our results demonstrate how synaptic connectivity could  be inferred from large-scale parallel spike train recordings.
Revised:  Our results demonstrate how synaptic connectivity could potentially be inferred from large-scale parallel spike train recordings.
Edit intent: clarity
Original:  We answer this question in the affirmative for weighted (relational) clones with real weights and show that the complexity of the corresponding Valued CSPs is preserved.
Revised:  We answer this question in the affirmative for weighted (relational) clones with real weights and show that the complexity of the corresponding valued CSPs is preserved.
Edit intent: fluency
Original: Previous studies have demonstrated the importance of the primary sensory cortex for the detection, discrimination and awareness of visual stimuli, but it is unknown how neuronal populations in this area process perceived and unperceived stimuli differently.
Revised: Previous studies have demonstrated the importance of the primary sensory cortex for the detection, discrimination and awareness of visual stimuli, but it is unknown how neuronal populations in this area process detected and undetected stimuli differently.
Edit intent: clarity
Original:  Critical differences may reside in the mean strength of responses to visual stimuli, as reflected in bulk signals detectable in fMRI, EEG or MEG studies, or may be more subtly composed by differentiated activity of individual sensory neurons.
Revised:  Critical differences may reside in the mean strength of responses to visual stimuli, as reflected in bulk signals detectable in fMRI, EEG or MEG studies, or may be more subtly composed of differentiated activity of individual sensory neurons.
Edit intent: fluency
Original:  Quantifying the heterogeneity of Ca2+ responses to visual stimuli recorded with in vivo 2-photon imaging, we found that visual perception correlates with activation of particular neural ensembles rather than overall response strength.
Revised:  Quantifying the heterogeneity of Ca2+ responses to visual stimuli recorded with in vivo 2-photon imaging, we found that visual detection correlates more strongly with population response heterogeneity rather than overall response strength.
Edit intent: clarity
Original:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signalling , these results suggest that perception critically depends on transient activation of selective and dynamic neuronal ensembles .
Revised:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signaling , these results suggest that perception critically depends on transient activation of selective and dynamic neuronal ensembles .
Edit intent: fluency
Original:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signalling , these results suggest that perception critically depends on transient activation of selective and dynamic neuronal ensembles .
Revised:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signalling , these results suggest that detection depends on transient activation of selective and dynamic neuronal ensembles .
Edit intent: clarity
Original:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signalling , these results suggest that perception critically depends on transient activation of selective and dynamic neuronal ensembles .
Revised:  Ensemble patterns recurred upon repetition of the same stimulus, but also showed a fleeting character across longer episodes . Contrary to models relying on temporally stable networks or bulk-signalling , these results suggest that perception critically depends on transient differentiation in neuronal activity within cortical populations .
Edit intent: clarity
Original: Cortical networks, in-vitro as well as in-vivo , can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches.
Revised: Cortical networks, in-vitro as well as in-vivo , can spontaneously generate a variety of collective dynamical events such as network spikes, UP and DOWN states, global oscillations, and avalanches.
Edit intent: fluency
Original:  In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regimen .
Revised:  In this sense, the cultured network dynamics is compatible with an excitation-inhibition balance corresponding to a slightly sub-critical regime .
Edit intent: clarity
Original:  Let S = \{1,... c ,n\} and \mathcal A=\{A_1, ... c , A_m\} be a partition of S.
Revised:  Let S = \{1,... ,n\} and \mathcal A=\{A_1, ... c , A_m\} be a partition of S.
Edit intent: fluency
Original:  Let S = \{1,... c ,n\} and \mathcal A=\{A_1, ... c , A_m\} be a partition of S.
Revised:  Let S = \{1,... c ,n\} and \mathcal A=\{A_1, ... , A_m\} be a partition of S.
Edit intent: fluency
Original:  In the case of a single image this is called the Shape-from-Shading (SfS) problem and  is known to be ill-posed even in a simplified version like the vertical light source case.
Revised:  In the case of a single image this is called the Shape-from-Shading (SfS) problem and it is known to be ill-posed even in a simplified version like the vertical light source case.
Edit intent: fluency
Original:  In this paper we want to overcome this model dealing with non-Lambertian models , more realistic and suitable whenever one has to deal with different kind of surfaces, rough or specular.
Revised:  In this paper we want to study non-Lambertian models , more realistic and suitable whenever one has to deal with different kind of surfaces, rough or specular.
Edit intent: coherence
Original:  In this paper we want to overcome this model dealing with non-Lambertian models , more realistic and suitable whenever one has to deal with different kind of surfaces, rough or specular.
Revised:  In this paper we want to overcome this model dealing with non-Lambertian models since they are more realistic and suitable whenever one has to deal with different kind of surfaces, rough or specular.
Edit intent: coherence
Original: We describe  two local reduction rules that can be used to recognize Halin graphs in linear time, avoiding the general-purpose planarity testing step of previous linear time Halin graph recognition algorithms.
Revised: We describe two local reduction rules that can be used to recognize Halin graphs in linear time, avoiding the complicated planarity testing step of previous linear time Halin graph recognition algorithms.
Edit intent: clarity
Original:  The same two rules can  also be used to recognize a broader class of polyhedral graphs  , which we call  D3-reducible graphs .
Revised:  The same two rules can also be used to recognize a broader class of polyhedral graphs . These graphs , which we call D3-reducible graphs .
Edit intent: clarity
Original:  The same two rules can  also be used to recognize a broader class of polyhedral graphs  , which we call  D3-reducible graphs .
Revised:  The same two rules can also be used to recognize a broader class of polyhedral graphs , which we call the D3-reducible graphs .
Edit intent: fluency
Original: Although sharing data across organizational boundaries has often been advocated as a promising way to enhance security , collaborative initiatives are rarely put into practice owing to confidentiality, trust, and liability challenges.
Revised: Although sharing data across organizations is often advocated as a promising way to enhance security , collaborative initiatives are rarely put into practice owing to confidentiality, trust, and liability challenges.
Edit intent: clarity
Original: Although sharing data across organizational boundaries has often been advocated as a promising way to enhance security , collaborative initiatives are rarely put into practice owing to confidentiality, trust, and liability challenges.
Revised: Although sharing data across organizational boundaries has often been advocated as a promising way to enhance cybersecurity , collaborative initiatives are rarely put into practice owing to confidentiality, trust, and liability challenges.
Edit intent: fluency
Original:  Using appropriate cryptographic tools, entities can estimate the benefits of collaborating and agree on what to share in a privacy-preserving way, without having to disclose their entire datasets.
Revised:  Using appropriate cryptographic tools, entities can estimate the benefits of collaboration and agree on what to share in a privacy-preserving way, without having to disclose their entire datasets.
Edit intent: fluency
Original:  Using appropriate cryptographic tools, entities can estimate the benefits of collaborating and agree on what to share in a privacy-preserving way, without having to disclose their entire datasets.
Revised:  Using appropriate cryptographic tools, entities can estimate the benefits of collaborating and agree on what to share in a privacy-preserving way, without having to disclose their datasets.
Edit intent: clarity
Original:  We focus on collaborative predictive blacklisting, i.e., forecasting attack sources also based on logs contributed by other organizations and study the impact of different sharing strategies by experimenting on a real-world dataset of two billion suspicious IP addresses collected from Dshield over two months.
Revised:  We focus on collaborative predictive blacklisting, i.e., forecasting attack sources based on one's logs and those contributed by other organizations and study the impact of different sharing strategies by experimenting on a real-world dataset of two billion suspicious IP addresses collected from Dshield over two months.
Edit intent: clarity
Original:  We focus on collaborative predictive blacklisting, i.e., forecasting attack sources also based on logs contributed by other organizations and study the impact of different sharing strategies by experimenting on a real-world dataset of two billion suspicious IP addresses collected from Dshield over two months.
Revised:  We focus on collaborative predictive blacklisting, i.e., forecasting attack sources also based on logs contributed by other organizations . We study the impact of different sharing strategies by experimenting on a real-world dataset of two billion suspicious IP addresses collected from Dshield over two months.
Edit intent: coherence
Original:  We find that controlled data sharing yields up to an average 105\% accuracy improvement  , while also reducing the false positive rate.
Revised:  We find that controlled data sharing yields up to 105\% accuracy improvement , while also reducing the false positive rate.
Edit intent: clarity
Original:  We find that controlled data sharing yields up to an average 105\% accuracy improvement  , while also reducing the false positive rate.
Revised:  We find that controlled data sharing yields up to an average 105\% accuracy improvement on average , while also reducing the false positive rate.
Edit intent: clarity
Original:  The techniques largely follow the prescriptions in the article " Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, "  N. Halko, P.G. Martinsson, J. Tropp,  SIAM Review, 53(2), 2011 , pp. 217-288, but with some modifications to improve performance.
Revised:  The techniques largely follow the prescriptions in the article " structure preserving " N. Halko, P.G. Martinsson, J. Tropp, SIAM Review, 53(2), 2011 , pp. 217-288, but with some modifications to improve performance.
Edit intent: clarity
Original:  The techniques largely follow the prescriptions in the article " Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, "  N. Halko, P.G. Martinsson, J. Tropp,  SIAM Review, 53(2), 2011 , pp. 217-288, but with some modifications to improve performance.
Revised:  The techniques largely follow the prescriptions in the article " Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions, " N. Halko, P.G. Martinsson, J. Tropp, "Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions," SIAM Review, 53(2), 2011 , pp. 217-288, but with some modifications to improve performance.
Edit intent: fluency
Original: Counting the number of local extrema of the cumulative sum of data points yields the R-test, a new single-sample non-parametric test.
Revised: Counting the number of the cumulative sum of data points yields the R-test, a new single-sample non-parametric test.
Edit intent: clarity
Original: Counting the number of local extrema of the cumulative sum of data points yields the R-test, a new single-sample non-parametric test.
Revised: Counting the number of local extrema of the cumulative sum of the sample. The single-sample non-parametric test.
Edit intent: clarity
Original:  Numeric simulations indicate that the R-test is more powerful than Student's t-test for semi-heavy and heavy-tailed distributions, equivalent for Gaussian variables and slightly worse for uniformly distributed variables .
Revised:  Numeric simulations indicate that the R-test is more powerful than Student's t-test for semi-heavy and uniformly distributed variables .
Edit intent: clarity
Original: Iteroparous individuals reproduce several times instead of just once, as semelparous do . Many species are iteroparous at various degrees(i.e. they differ by the mean number of reproductive events) , despite a well-known advantage to semelparity: semelparous genotypes grow more rapidly in stable environments where resources are in excess.
Revised: Iteroparous individuals reproduce several times , whereas semelparous reproduce just once . Many species are iteroparous at various degrees(i.e. they differ by the mean number of reproductive events) , despite a well-known advantage to semelparity: semelparous genotypes grow more rapidly in stable environments where resources are in excess.
Edit intent: clarity
Original: Iteroparous individuals reproduce several times instead of just once, as semelparous do . Many species are iteroparous at various degrees(i.e. they differ by the mean number of reproductive events) , despite a well-known advantage to semelparity: semelparous genotypes grow more rapidly in stable environments where resources are in excess.
Revised: Iteroparous individuals reproduce several times instead of just once, as semelparous do . Many species are iteroparous to various degrees , despite a well-known advantage to semelparity: semelparous genotypes grow more rapidly in stable environments where resources are in excess.
Edit intent: clarity
Original: Iteroparous individuals reproduce several times instead of just once, as semelparous do . Many species are iteroparous at various degrees(i.e. they differ by the mean number of reproductive events) , despite a well-known advantage to semelparity: semelparous genotypes grow more rapidly in stable environments where resources are in excess.
Revised: Iteroparous individuals reproduce several times instead of just once, as semelparous do . Many species are iteroparous at various degrees(i.e. they differ by the mean number of reproductive events) , despite a well-known advantage to semelparous genotypes: they grow more rapidly in stable environments where resources are in excess.
Edit intent: clarity
Original:  Using an adaptive dynamics approach, we show that semelparity looses its selective advantage in this context, and that all reproduction strategies (i.e. semelparous and iteroparous at any degree) are strictly neutral when they bear equal lifetime fecundity.
Revised:  Using an adaptive dynamics approach, we show that semelparity looses its selective advantage in this context, and that all reproduction strategies that bear equal lifetime fecundity.
Edit intent: coherence
Original:  Then we develop a neutralmodel for the evolution of these strategies , showing that the most probable outcome is the highest degree of iteroparity.
Revised:  Then we develop a neutralmodel for the evolution of reproduction strategies in this context , showing that the most probable outcome is the highest degree of iteroparity.
Edit intent: clarity
Original:  Then we develop a neutralmodel for the evolution of these strategies , showing that the most probable outcome is the highest degree of iteroparity.
Revised:  Then we develop a neutralmodel for the evolution of these strategies , showing that neutral processes favor the evolution of the highest possible degree of iteroparity.
Edit intent: clarity
Original:  We compare this approach to the one in 1 , which is based  on the connections (and disconnections) between the nodes, i.e., on the links that the nodes have (or do not have).
Revised:  We compare this approach to the 1 , which is based on the connections (and disconnections) between the nodes, i.e., on the links that the nodes have (or do not have).
Edit intent: clarity
Original: Given a network represented by a weighted directed graph G, we consider the problem of ?nding a bounded cost set of nodes S such that the in uence spreading from S in G, within a given time bound, is as large as possible.
Revised: Given a network represented by a weighted directed graph G, we consider the problem of finding a bounded cost set of nodes S such that the in uence spreading from S in G, within a given time bound, is as large as possible.
Edit intent: fluency
Original: Given a network represented by a weighted directed graph G, we consider the problem of ?nding a bounded cost set of nodes S such that the in uence spreading from S in G, within a given time bound, is as large as possible.
Revised: Given a network represented by a weighted directed graph G, we consider the problem of ?nding a bounded cost set of nodes S such that the influence spreading from S in G, within a given time bound, is as large as possible.
Edit intent: fluency
Original:  subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a su?ciently large number of already influenced neighbors.
Revised:  subsequently at each round, the set of influenced elements is augmented by all nodes in the network that have a sufficiently large number of already influenced neighbors.
Edit intent: clarity
Original:  We also show that the extremal value of this number on n-vertex trees this number is between \Omega(log n/log log n) and O(log n).
Revised:  We also show that the extremal value of this number on n-vertex trees is between \Omega(log n/log log n) and O(log n).
Edit intent: fluency
Original: We consider a preferential attachment process in which the number of edges added at stage t  is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Revised: We consider a preferential attachment process in which the number of edges added at stage t is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Edit intent: fluency
Original: We consider a preferential attachment process in which the number of edges added at stage t  is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Revised: We consider a preferential attachment process in which the number of edges added at stage t is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( %DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Edit intent: clarity
Original: We consider a preferential attachment process in which the number of edges added at stage t  is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Revised: We consider a preferential attachment process in which the number of edges added at stage t is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process will be isomorphic to the Rado multigraph .
Edit intent: clarity
Original: We consider a preferential attachment process in which the number of edges added at stage t  is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Revised: We consider a preferential attachment process in which the number of edges added at stage t is given by some prescribed function f(t), generalising a model considered by Kleinberg and Kleinberg ( 8%DIFDELCMD < ]%%% ) . We show that if f(t) is asymptotically bounded above and below by linear functions in t, then with probability 1 the infinite limit of the process is isomorphic to the Rado multigraph .
Edit intent: fluency
Original:  This structure is the natural multigraph analogue of the famous Rado graph, which we introduce here.
Revised:  This structure is the natural multigraph analogue of the Rado graph, which we introduce here.
Edit intent: clarity