wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also show that the low rank binary matrix approximation problem is NP-hard even for k= 1, solving a conjecture in \mbox{ \cite{Koyuturk03}\hspace{0pt} }  .
Revised:  We also show that the low rank binary matrix approximation problem is NP-hard even for k= 1, }\hspace{0pt} } .
Edit intent: coherence
Original:  To better utilize the identified common interests , we propose local content sharing (enabled by D2D communications) by motivating  physically neighboring users to form a social group.
Revised:  To better utilize the identified common interests , we propose local common-interests sharing (enabled by D2D communications) by motivating physically neighboring users to form a social group.
Edit intent: clarity
Original:  To better utilize the identified common interests , we propose local content sharing (enabled by D2D communications) by motivating  physically neighboring users to form a social group.
Revised:  To better utilize the identified common interests , we propose local content sharing (enabled by D2D communications) by motivating the physically neighboring users to form a social group.
Edit intent: fluency
Original:  As users are selfish in practice, an incentive mechanism is needed to motivate the social grouping.
Revised:  As users are selfish in practice, an incentive mechanism is needed to motivate social grouping.
Edit intent: clarity
Original:  Finally, we look at dynamic content arrivals and extend our scheme successfully by proposing novel dynamic scheduling algorithms.
Revised:  Finally, we look at dynamic content arrivals and extend our scheme successfully by proposing novel on-line scheduling algorithms.
Edit intent: clarity
Original: On-line social networks publish information about an enormous volume of real-world events almost instantly, becoming a primary source for breaking news.
Revised: On-line social networks publish information on a high volume of real-world events almost instantly, becoming a primary source for breaking news.
Edit intent: clarity
Original:  We show that using just the first 5\% of the events ' lifetime evolution, we are able to predict with high precision  the top 8\% that have the most impact .
Revised:  We show that using just the first 5\% of the events ' lifetime evolution, we are able to predict with high precision , the top 8\% that have the most impact .
Edit intent: fluency
Original:  We show that using just the first 5\% of the events ' lifetime evolution, we are able to predict with high precision  the top 8\% that have the most impact .
Revised:  We show that using just the first 5\% of the events ' lifetime evolution, we are able to predict with high precision the top 8\% of events that will have the most impact .
Edit intent: clarity
Original:  As a consequence, high impact news events are naturally filtered by the social network, engaging users early on, much before they are brought to the mainstream audience.
Revised:  As a consequence, high impact news events are naturally prioritized collectively by the social network, engaging users early on, much before they are brought to the mainstream audience.
Edit intent: clarity
Original:  As a consequence, high impact news events are naturally filtered by the social network, engaging users early on, much before they are brought to the mainstream audience.
Revised:  As a consequence, high impact news events are naturally filtered by the social network, engaging users early on, way before they are brought to the mainstream audience.
Edit intent: clarity
Original: Autism Spectrum Disorders ( ASD ) are often associated with specific atypical postural or motor behaviors, of which Stereotypical Motor Movements (SMMs) have a specific visibility.
Revised: Autism Spectrum Disorders ( ASDs ) are often associated with specific atypical postural or motor behaviors, of which Stereotypical Motor Movements (SMMs) have a specific visibility.
Edit intent: fluency
Original: The correlated motion of large bird flocks is an instance of self-organization where global order emerges from local interactions.
Revised: The correlated motion of flocks is an instance of self-organization where global order emerges from local interactions.
Edit intent: clarity
Original: The correlated motion of large bird flocks is an instance of self-organization where global order emerges from local interactions.
Revised: The correlated motion of large bird flocks is an instance of global order emerging from local interactions.
Edit intent: clarity
Original:  Despite the analogy with ferromagnetic systems, a major difference is that flocks are active -- animals move relative to each other, thereby dynamically rearranging their interaction network.
Revised:  An essential difference with analogous ferromagnetic systems is that flocks are active -- animals move relative to each other, thereby dynamically rearranging their interaction network.
Edit intent: clarity
Original:  Despite the analogy with ferromagnetic systems, a major difference is that flocks are active -- animals move relative to each other, thereby dynamically rearranging their interaction network.
Revised:  Despite the analogy with ferromagnetic systems, a major difference is that flocks are active : animals move relative to each other, thereby dynamically rearranging their interaction network.
Edit intent: fluency
Original:  Despite the analogy with ferromagnetic systems, a major difference is that flocks are active -- animals move relative to each other, thereby dynamically rearranging their interaction network.
Revised:  Despite the analogy with ferromagnetic systems, a major difference is that flocks are active -- animals move relative to each other, dynamically rearranging their interaction network.
Edit intent: clarity
Original:  Although the theoretical importance of this off-equilibrium ingredient has long been appreciated, its relevance to actual biological flocks remains unexplored.
Revised:  The effect of this off-equilibrium ingredient has long been appreciated, its relevance to actual biological flocks remains unexplored.
Edit intent: clarity
Original:  Here we introduce a novel dynamical inference technique  based on the principle of maximum entropy, which takes into account network reshuffling and overcomes the limitations of slow experimental sampling rates.
Revised:  Here we introduce a novel dynamical inference technique , based on the principle of maximum entropy, which takes into account network reshuffling and overcomes the limitations of slow experimental sampling rates.
Edit intent: fluency
Original:  Here we introduce a novel dynamical inference technique  based on the principle of maximum entropy, which takes into account network reshuffling and overcomes the limitations of slow experimental sampling rates.
Revised:  Here we introduce a novel dynamical inference technique based on the principle of maximum entropy, which accodomates network rearrangements and overcomes the limitations of slow experimental sampling rates.
Edit intent: clarity
Original:  Here we introduce a novel dynamical inference technique  based on the principle of maximum entropy, which takes into account network reshuffling and overcomes the limitations of slow experimental sampling rates.
Revised:  Here we introduce a novel dynamical inference technique based on the principle of maximum entropy, which takes into account network reshuffling and overcomes the problem of slow experimental sampling rates.
Edit intent: clarity
Original:  We apply this method to three-dimensional data of large natural flocks of starlings, inferring independently the strength of the social alignment forces , the range of these forces, and the noise.
Revised:  We use this method to three-dimensional data of large natural flocks of starlings, inferring independently the strength of the social alignment forces , the range of these forces, and the noise.
Edit intent: fluency
Original:  We verify that, following from this observation, an equilibrium inferencemethod assuming a fixed interaction network gives results that are fully consistent with the dynamical inference.
Revised:  We verify that, following from this observation, an equilibrium inferencemethod assuming a fixed interaction network , gives results consistent with dynamical inference.
Edit intent: clarity
Original:  We conclude that the birds' flight orientations are in a state of local equilibrium .
Revised:  We conclude that bird orientations are in a state of local equilibrium .
Edit intent: clarity
Original: For a  graph, a spanning path is a path containing all vertices and it is also known as Hamiltonian path.
Revised: For a graph, a path containing all vertices and it is also known as Hamiltonian path.
Edit intent: clarity
Original: For a  graph, a spanning path is a path containing all vertices and it is also known as Hamiltonian path.
Revised: For a graph, a spanning path is a path containing all vertices is known as Hamiltonian path.
Edit intent: coherence
Original:  For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian path and the complexity of finding a Hamiltonian path in general graphs is NP-Complete.
Revised:  For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a Hamiltonian path in general graphs is NP-Complete.
Edit intent: fluency
Original:  We present a necessary and sufficient condition for the existence of Hamiltonian path in 2-trees.
Revised:  We present a necessary and sufficient condition for the existence of Hamiltonian paths in 2-trees.
Edit intent: fluency
Original:  Using our characterization, we also present a polynomial-time algorithm for the existence of Hamiltonian path in 2-trees.
Revised:  Using our characterization, we also present a polynomial-time algorithm for the existence of Hamiltonian paths in 2-trees.
Edit intent: fluency
Original:  Our characterization is based on a deep understanding of the structure of 2-trees and we believe that the combinatorics presented here can be used in other combinatorial problems restricted to 2-trees.
Revised:  Our characterization is based on a deep understanding of the structure of 2-trees and the combinatorics presented here can be used in other combinatorial problems restricted to 2-trees.
Edit intent: coherence
Original:  Our characterization is based on a deep understanding of the structure of 2-trees and we believe that the combinatorics presented here can be used in other combinatorial problems restricted to 2-trees.
Revised:  Our characterization is based on a deep understanding of the structure of 2-trees and we believe that the combinatorics presented here may be used in other combinatorial problems restricted to 2-trees.
Edit intent: clarity
Original: To predict the properties of fluid flow over a solid geometry is an important engineering problem.
Revised: To optimize the geometry of airfoils for a specific application is an important engineering problem.
Edit intent: clarity
Original:  Since panel methods in two dimensions are computationally cheap, they are well suited as the inner solver in an optimization algorithm .
Revised:  Since panel methods in two dimensions are computationally cheap, they are well suited as the inner solver .
Edit intent: clarity
Original:  In this paper we evaluate the performance of  the Intel Xeon Phi 7120 and the NVIDIA K80 to accelerate such an optimization algorithm .
Revised:  In this paper we evaluate the performance of the Intel Xeon Phi 7120 and the NVIDIA K80 ) .
Edit intent: clarity
Original:  Overall, we observe a speedup of approximately 2.5 for adding a Intel Xeon Phi 7120 to a dual socket workstation and a speedup between 3 and 3.5 for adding a NVIDIA K80 to a dual socket workstation.
Revised:  Overall, we observe a speedup of approximately 2.5 for adding an Intel Xeon Phi 7120 to a dual socket workstation and a speedup between 3 and 3.5 for adding a NVIDIA K80 to a dual socket workstation.
Edit intent: fluency
Original:  If G admits an H-coloring, then we will write H\prec G. The Petersen coloring conjecture of Jaeger states that for any bridgeless cubic graph G, one has: P\prec G. The second author has recently introduced the Sylvester coloring conjecture, which states that for any cubic graph G one has: S\prec G. Here S is the Sylvester graph on ten vertices.
Revised:  If G admits an H-coloring, then we will write H\prec G. The Petersen coloring conjecture of Jaeger states that for any bridgeless cubic graph G, one has: P\prec G. The second author has recently introduced the Sylvester coloring conjecture, which states that for any cubic graph G one has: S\prec G. Here S is the Sylvester graph on 10 vertices.
Edit intent: fluency
Original:  With a runtime overhead equivalent to a couple dozen SpMV iterations , our approach is practical for use in iterative numerical solvers of real-life applications.
Revised:  With a runtime overhead equivalent to a couple dozen SpMV operations , our approach is practical for use in iterative numerical solvers of real-life applications.
Edit intent: clarity
Original: We present a novel deep learning framework for probabilistic pixel-wise semantic segmentation, which we term Bayesian SegNet.
Revised: We present a deep learning framework for probabilistic pixel-wise semantic segmentation, which we term Bayesian SegNet.
Edit intent: clarity
Original:  Pixel-wise semantic segmentation is an important step for visual scene understanding .
Revised:  Semantic segmentation is an important step for visual scene understanding .
Edit intent: clarity
Original:  Pixel-wise semantic segmentation is an important step for visual scene understanding .
Revised:  Pixel-wise semantic segmentation is an important tool for visual scene understanding .
Edit intent: clarity
Original: The Moran process on graphs is an interesting model to study the spread of a new mutant in a spatially structured population.
Revised: The Moran process on graphs is a popular model to study the spread of a new mutant in a spatially structured population.
Edit intent: clarity
Original: The Moran process on graphs is an interesting model to study the spread of a new mutant in a spatially structured population.
Revised: The Moran process on graphs is an interesting model to study the dynamics of evolution in a spatially structured population.
Edit intent: clarity
Original: We investigate a new class of congestion games, called Totally Unimodular  Congestion Games, in which the strategies of each player are expressed as binary vectors lying in a polyhedron defined using a totally unimodular constraint matrix and an integer right-hand side.
Revised: We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, in which the strategies of each player are expressed as binary vectors lying in a polyhedron defined using a totally unimodular constraint matrix and an integer right-hand side.
Edit intent: clarity
Original: We investigate a new class of congestion games, called Totally Unimodular  Congestion Games, in which the strategies of each player are expressed as binary vectors lying in a polyhedron defined using a totally unimodular constraint matrix and an integer right-hand side.
Revised: We investigate a new class of congestion games, called Totally Unimodular Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrix and an integer right-hand side.
Edit intent: clarity
Original:  In the symmetric variant, all players have the same strategy set, i.e. the same constraint matrix and right-hand side.
Revised:  In the symmetric case, when all players have the same strategy set, i.e. the same constraint matrix and right-hand side.
Edit intent: clarity
Original:  We also identify four totally unimodular congestion games , where the players' strategy sets are matchings, vertex covers, edge covers  and stable sets of a given bipartite graph.
Revised:  We also identify four totally unimodular congestion games , where the players' strategies are matchings, vertex covers, edge covers and stable sets of a given bipartite graph.
Edit intent: fluency
Original:  We also identify four totally unimodular congestion games , where the players' strategy sets are matchings, vertex covers, edge covers  and stable sets of a given bipartite graph.
Revised:  We also identify four totally unimodular congestion games , where the players' strategy sets are matchings, vertex covers, edge covers , and stable sets of a given bipartite graph.
Edit intent: fluency
Original:  Our framework allows to convert many known #P-hardness results for counting problems into tight lower bounds of the following type: Assuming #ETH, the given problem admits no algorithm with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Revised:  Our framework allows us to convert classical #P-hardness results for counting problems into tight lower bounds of the following type: Assuming #ETH, the given problem admits no algorithm with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Edit intent: clarity
Original:  Our framework allows to convert many known #P-hardness results for counting problems into tight lower bounds of the following type: Assuming #ETH, the given problem admits no algorithm with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Revised:  Our framework allows to convert many known #P-hardness results for counting problems into tight lower bounds under #ETH, the given problem admits no algorithm with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Edit intent: clarity
Original:  Our framework allows to convert many known #P-hardness results for counting problems into tight lower bounds of the following type: Assuming #ETH, the given problem admits no algorithm with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Revised:  Our framework allows to convert many known #P-hardness results for counting problems into tight lower bounds of the following type: Assuming #ETH, thus ruling out algorithms with running time 2^{o(n)} on graphs with n vertices and O(n) edges.
Edit intent: clarity
Original:  As exemplary applications of this framework, we obtain such tight lower bounds  for the evaluation of the zero-one permanent, the matching polynomial, and the Tutte polynomial on all non-easy points except for two lines .
Revised:  As exemplary applications of this framework, we obtain tight lower bounds for the evaluation of the zero-one permanent, the matching polynomial, and the Tutte polynomial on all non-easy points except for two lines .
Edit intent: clarity
Original:  We combine ideas and methods from both the statistics and the computer sciences, by utilizing likelihood based inference for missing data and Markov chain Monte Carlo (MCMC) techniques to fit exponential-family random graph models (ERGMs) to the generated synthetic networks.
Revised:  We combine ideas and methods from both the statistics and the computer sciences, by utilizing likelihood based inference for missing data and Markov chain Monte Carlo techniques to fit exponential-family random graph models (ERGMs) to the generated synthetic networks.
Edit intent: clarity
Original:  We combine ideas and methods from both the statistics and the computer sciences, by utilizing likelihood based inference for missing data and Markov chain Monte Carlo (MCMC) techniques to fit exponential-family random graph models (ERGMs) to the generated synthetic networks.
Revised:  We combine ideas and methods from both the statistics and the computer sciences, by utilizing likelihood based inference for missing data and Markov chain Monte Carlo (MCMC) techniques to fit exponential-family random graph models to the generated synthetic networks.
Edit intent: clarity
Original:  Our results demonstrate that dynamic fluctuations in network structure during the resting state transition between states of integrated and segregated network topology.
Revised:  Our results demonstrate that dynamic fluctuations in network structure during the resting state reflect transitions between states of integrated and segregated network topology.
Edit intent: clarity
Original:  Together these results provide evidence for metastability in the brain's coordination between integration and segregation  .
Revised:  Together these results provide insight into the brain's coordination between integration and segregation .
Edit intent: clarity
Original: Higher brain function relies upon the ability to flexibly integrate information across specialized communities of macroscopic brain regions, but it is unclear how this mechanism manifests over time.
Revised: Higher brain function relies upon the ability to flexibly integrate information across specialized communities of brain regions, but it is unclear how this mechanism manifests over time.
Edit intent: clarity
Original: Higher brain function relies upon the ability to flexibly integrate information across specialized communities of macroscopic brain regions, but it is unclear how this mechanism manifests over time.
Revised: Higher brain function relies upon the ability to flexibly integrate information across specialized communities of macroscopic brain regions, however it is unclear how this mechanism manifests over time.
Edit intent: fluency
Original:  Here we characterized patterns of time-resolved functional connectivity using resting state and task fMRI data from a large cohort of unrelated subjects.
Revised:  In this study, we use time-resolved functional connectivity using resting state and task fMRI data from a large cohort of unrelated subjects.
Edit intent: clarity
Original:  Together these results provide insight into the brain's coordination between integration and segregation and highlight key principles underlying the reorganization of the network architecture of the brain during both rest and behavior .
Revised:  Together these results provide insight into the brain's coordination between integration and segregation and highlight key principles underlying the reorganization of the network structure of the brain during both rest and behavior .
Edit intent: clarity
Original:  Together these results provide insight into the brain's coordination between integration and segregation and highlight key principles underlying the reorganization of the network architecture of the brain during both rest and behavior .
Revised:  Together these results provide insight into the brain's coordination between integration and segregation and highlight key principles underlying the reorganization of the network architecture of the brain .
Edit intent: clarity
Original:  Whereas components in the co-word maps can easily be designated, the coloring of the nodes according to the results of the topic model provides maps that are difficult to interpret .
Revised:  Whereas components in the co-word maps can easily be designated, the topic models provide sets of words that are very differently organized .
Edit intent: clarity
Original:  Agents are equipped with sensors capable of fast information processing, and we propose an asynchronous decentralized algorithm for controlling their search given noisy observations.
Revised:  Agents are equipped with sensors capable of fast information processing, and we propose a decentralized collaborative algorithm for controlling their search given noisy observations.
Edit intent: clarity
Original:  Specifically, we propose asynchronous decentralized extensions of the adaptive query-based search strategy that combines elements from the 20 questions approach and social learning.
Revised:  Specifically, we propose decentralized extensions of the adaptive query-based search strategy that combines elements from the 20 questions approach and social learning.
Edit intent: clarity