wanyu/IteraTeR_v2 huggingface dataset:
Original:  Given any integer circulation in D, we study the problem of finding a minimum-cost  integer circulation in D that is homologous ( over the integers ) to the given circulation and respects the capacities.
Revised:  Given any integer circulation in D, we study the problem of finding a minimum-cost integer circulation in D that is homologous ( over the integers to the given circulation and respects the capacities.
Edit intent: fluency
Original:  It has been recently shown that the stable set problem for graphs with bounded genus and bounded odd cycle packing number can be efficiently reduced to this problem , in which the surface is non-orientable.
Revised:  It has been recently shown that the stable set problem for graphs with bounded odd cycle packing number can be efficiently reduced to this problem , in which the surface is non-orientable.
Edit intent: clarity
Original:  It has been recently shown that the stable set problem for graphs with bounded genus and bounded odd cycle packing number can be efficiently reduced to this problem , in which the surface is non-orientable.
Revised:  It has been recently shown that the stable set problem for graphs with bounded genus and bounded odd cycle packing number , in which the surface is non-orientable.
Edit intent: clarity
Original:  We complement these findings by showing that the convex hull of feasible solutions has a very simple polyhedral description.
Revised:  We complement these results by showing that the convex hull of feasible solutions has a very simple polyhedral description.
Edit intent: clarity
Original: Let D be a directed graph cellularly embedded in a surface together with non-negative costs on its arcs.
Revised: Let D be a directed graph cellularly embedded in a surface together with non-negative cost on its arcs.
Edit intent: fluency
Original:  These results completely address a question concerning the global convergence raised in [L. Wang and M. T. Chu , SIAM J. Matrix Anal.
Revised:  These results completely address a question concerning the global convergence raised in [L. Wang , M. T. Chu , SIAM J. Matrix Anal.
Edit intent: clarity
Original:  The Klausmeier partial differential equations (PDE) model is obtained from the integrodifference model through a convergence result , which yields a control parameter for the temporal separation of seed dispersal events.
Revised:  The Klausmeier partial differential equations (PDE) model is linked to the integrodifference model through a convergence result , which yields a control parameter for the temporal separation of seed dispersal events.
Edit intent: clarity
Original:  However, traditional synthetic biology approaches involve ad-hoc non systematic engineering practices, which lead to long development times.
Revised:  However, traditional synthetic biology approaches involve ad-hoc engineering practices, which lead to long development times.
Edit intent: clarity
Original:  We describe a method for digitally programmable bitstream generation based on pre-charge sense amplifiers which is more energy efficient than previously explored alternatives.
Revised:  We describe a method for digitally programmable bitstream generation based on pre-charge sense amplifiers . This generator is significantly more energy efficient than previously explored alternatives.
Edit intent: clarity
Original:  The flexibility of the neural network mathematics compensates for explicitly energy efficient choices we make at the device level.
Revised:  The flexibility of the neural network mathematics allows us to adapt the network to the explicitly energy efficient choices we make at the device level.
Edit intent: clarity
Original:  The result is a convolutional neural network design operating at \approx 150 ~ nJ per inference with 97 ~%DIFDELCMD < \\%%% %DIF < performance on MNIST---nearly an order of magnitude more energy efficiency than comparable proposals in the recent literature.
Revised:  The result is a convolutional neural network design operating at \approx 150 nJ per inference with 97 ~%DIFDELCMD < \\%%% %DIF < performance on MNIST---nearly an order of magnitude more energy efficiency than comparable proposals in the recent literature.
Edit intent: fluency
Original:  The result is a convolutional neural network design operating at \approx 150 ~ nJ per inference with 97 ~%DIFDELCMD < \\%%% %DIF < performance on MNIST---nearly an order of magnitude more energy efficiency than comparable proposals in the recent literature.
Revised:  The result is a convolutional neural network design operating at \approx 150 ~ nJ per inference with 97 %DIFDELCMD < \\%%% %DIF < performance on MNIST---nearly an order of magnitude more energy efficiency than comparable proposals in the recent literature.
Edit intent: fluency
Original: In this extended abstract we provide a first step towards a tool to estimate the resource consumption of programs.
Revised: In this abstract we study the resource consumption of programs.
Edit intent: clarity
Original:  We specifically focus on the runtime analysis of programs and, inspired by recent methods for probabilistic programs, we develop a calculus \`a la weakest precondition to formally and systematically derive the (exact)  runtime of quantum programs.
Revised:  We specifically focus on the expected runtime of programs and, inspired by recent methods for probabilistic programs, we develop a calculus \`a la weakest precondition to formally and systematically derive the (exact) runtime of quantum programs.
Edit intent: clarity
Original:  We specifically focus on the runtime analysis of programs and, inspired by recent methods for probabilistic programs, we develop a calculus \`a la weakest precondition to formally and systematically derive the (exact)  runtime of quantum programs.
Revised:  We specifically focus on the runtime analysis of programs and, inspired by recent methods for probabilistic programs, we develop a calculus \`a la weakest precondition to formally and systematically derive the (exact) expected runtime of quantum programs.
Edit intent: clarity
Original:  To conclude , we show the applicability of our calculus analyzing the runtime of an algorithm based on the BB84 quantum key distribution protocol.
Revised:  Finally , we show the applicability of our calculus analyzing the runtime of an algorithm based on the BB84 quantum key distribution protocol.
Edit intent: coherence
Original:  To conclude , we show the applicability of our calculus analyzing the runtime of an algorithm based on the BB84 quantum key distribution protocol.
Revised:  To conclude , we show the applicability of our calculus analyzing the runtime of (a simplified version of) the BB84 quantum key distribution protocol.
Edit intent: clarity
Original:  The algorithm for the multiple-coset isomorphism problem allows to exploit graph decompositions of the given input graphs within Babai's group theoretic framework.
Revised:  The algorithm for the multiple-coset isomorphism problem allows to exploit graph decompositions of the given input graphs within Babai's group-theoretic framework.
Edit intent: clarity
Original:  It is also quantitatively similar and better in accuracy.
Revised:  It is also quantitatively similar or better in accuracy.
Edit intent: clarity
Original:  Finally, we visualize individual scale/layer contributions by using a Layer Ordered Visualization of Information.
Revised:  We visualize individual scale/layer contributions by using a Layer Ordered Visualization of Information.
Edit intent: coherence
Original:  Since our method only requires a single forward pass through a few of the layers in a network, it is at least 97x faster than Guided Backprop and much more accurate.
Edit intent: coherence
Original: During the past decade, rapid advancements in sequencing technologies have enabled the study of human-associated microbiomes at an unprecedented scale.
Revised: The human-associated microbiomes at an unprecedented scale.
Edit intent: clarity
Original:  Metagenomics, specifically, is emerging as a clinical tool to identify the agents of infection, track the spread of diseases, and surveil potential pathogens.
Revised:  Metagenomics, specifically, is emerging as a clinical tool to identify the agents of infection, track the spread of diseases, and surveillance of potential pathogens.
Edit intent: fluency
Original:  Yet, despite advances in high-throughput sequencing technologies and bioinformatics algorithms, metagenomics still has limitations barring mass clinical acceptance and broad implementation.
Revised:  In some cases, these tools are overcoming limitations of traditional clinical approaches. Metagenomics has limitations barring mass clinical acceptance and broad implementation.
Edit intent: clarity
Original:  Once these hurdles are overcome, clinical metagenomics will be able to inform doctors of the best, targeted treatment for their patients and provide early detection of disease.
Revised:  Once these hurdles are overcome, clinical metagenomics will inform doctors of the best, targeted treatment for their patients and provide early detection of disease.
Edit intent: clarity
Original:  Previous public heath studies based on Twitter data have largely relied on keyword-matching or topic models for clustering relevant tweets.
Revised:  Previous public health studies based on Twitter data have largely relied on keyword-matching or topic models for clustering relevant tweets.
Edit intent: fluency
Original:  In this paper, we explore how the dynamic (self-organizing) nature of real social networks impacts the fostering of creative ideas.
Revised:  In this paper, we explore how the dynamic (self-organizing) nature of social networks impacts the fostering of creative ideas.
Edit intent: clarity
Original:  While exposure to high-performing peers is associated with better creative performances of the followers, we see a counter-effect that choosing to follow the same peers introduces semantic redundancies in the followers' ideas.
Revised:  While exposure to high-performing peers is associated with better creative performances of the followers, we see a counter-effect that choosing to follow the same peers introduces semantic similarities in the followers' ideas.
Edit intent: clarity
Original:  We formulate an agent-based simulation model that highlights the implications of these processes .
Revised:  We formulate an agent-based simulation model to capture these intuitions in a tractable manner, and experiment with corner cases of various simulation parameters to assess the generality of the findings .
Edit intent: coherence
Original:  Recently, a new method to measure triadic closure was introduced: the closure coefficient .
Revised:  Recently, a new method to measure triadic closure .
Edit intent: clarity
Original:  We show that the closure coefficient behaves significantly different in these simple random graph models than in the multigraph models where its behavior was studied before .
Revised:  We show that the closure coefficient behaves significantly different in these simple random graph models than in the previously studied multigraph models .
Edit intent: clarity
Original:  We also show that the closure coefficient can be related to the clustering coefficient and the average nearest neighbor degree.
Revised:  We also relate the closure coefficient can be related to the clustering coefficient and the average nearest neighbor degree.
Edit intent: clarity
Original:  We also achieve state-of-the-art on WikiText-103 - or do we?
Edit intent: coherence
Original:  The attention mechanism is also readily extended to large contexts and requires minimal computation.
Revised:  The attention mechanism is also readily extended to large contexts with minimal computation.
Edit intent: coherence
Original:  In this paper  we propose a statistical model for dynamically evolving networks, together with a variational inference approach.
Revised:  In this paper , we propose a statistical model for dynamically evolving networks, together with a variational inference approach.
Edit intent: fluency
Original:  Experiments done on real world networks for the task of link forecasting demonstrate the superior performance of our model as compared to existing approaches .
Revised:  We experimented with a single step and multi-step link forecasting on real-world networks of homogeneous, bipartite, and heterogeneous nature, and demonstrated that our model significantly outperforms existing models .
Edit intent: clarity
Original: A       signed graph is a graph with a sign assignment to its edges.
Revised: A chord signed graph is a graph with a sign assignment to its edges.
Edit intent: fluency
Original:  We \emph{  show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  We \emph{valid distance drawing show that a complete signed graph has a valid distance drawing in a real tree if and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: clarity
Original:  We \emph{  show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  We \emph{ show that a complete signed graph has a valid distance drawing in a real tree if , and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: fluency
Original:  We \emph{  show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  We \emph{ show that a complete signed graph has a valid distance drawing in a real tree if and only if , its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: fluency
Original:  We study the mean field limits of the three different situations;
Revised:  We study the mean field limit for the three different situations;
Edit intent: fluency
Original:  and (iii) only for some populations, the agents are cooperative within each population .
Revised:  and (iii) the agents in some populations are cooperative but those in the other populations are not .
Edit intent: clarity
Original:  We provide several sets of sufficient conditions for the existence of  mean field equilibrium for each of these cases  .
Revised:  We provide several sets of sufficient conditions for the existence of a mean field equilibrium for each of these cases .
Edit intent: fluency
Original:  Our noise optimization can restore high frequency features in images and thus significantly improves the quality of reconstructed images, e.g. a big increase of PSNR from 20 dB to 45 dB.
Revised:  Our noise optimization can restore high-frequency features in images and thus significantly improves the quality of reconstructed images, e.g. a big increase of PSNR from 20 dB to 45 dB.
Edit intent: fluency
Original:  Third, we combine embedding with activation tensor manipulation to perform high quality local edits along with global semantic edits on images.
Revised:  Third, we combine embedding with activation tensor manipulation to perform high-quality local edits along with global semantic edits on images.
Edit intent: fluency
Original:  Such edits motivate various high quality image editing applications, e.g. image reconstruction, image inpainting, image crossover, local style transfer, image editing using scribbles, and attribute level feature transfer.
Revised:  Such edits motivate various high-quality image editing applications, e.g. image reconstruction, image inpainting, image crossover, local style transfer, image editing using scribbles, and attribute level feature transfer.
Edit intent: fluency
Original: This paper explores sequential modeling of polyphonic music with deep neural networks.
Revised: This paper explores sequential modelling of polyphonic music with deep neural networks.
Edit intent: fluency
Original:  By extracting salient features inherent to the  dataset, the model can either be conditioned on these features or trained to predict said features as extra components of the sequences being modeled .
Revised:  By extracting salient features inherent to the training dataset, the model can either be conditioned on these features or trained to predict said features as extra components of the sequences being modeled .
Edit intent: clarity
Original:  By extracting salient features inherent to the  dataset, the model can either be conditioned on these features or trained to predict said features as extra components of the sequences being modeled .
Revised:  By extracting salient features inherent to the dataset, the model can either be conditioned on these features or trained to predict said features as extra components of the sequences being modelled .
Edit intent: fluency
Original:  We show that training a neural network to predict a seemingly more complex sequence, with extra features included in the series being modeled , can improve overall model performance significantly.
Revised:  We show that training a neural network to predict a seemingly more complex sequence, with extra features included in the series being modelled , can improve overall model performance significantly.
Edit intent: fluency
Original:  To complete the proof, we then observe that the lower bound in [K19] is robust enough and continues to hold for all polynomials i = 1^n x_i^n + \epsilon(x_1, \ldots, x_n), where \epsilon(x_1, \ldots, x_n) has the appropriate structure.  ] ]
Revised:  To complete the proof, we then observe that the lower bound in [K19] is robust enough and continues to hold for all polynomials i = 1^n x_i^n + \epsilon(x_1, \ldots, x_n), where \epsilon(x_1, \ldots, x_n) has the appropriate structure. ] ].
Edit intent: fluency
Original: There is a growing interest on formal methods-based robotic motion planning for temporal logic objectives.
Revised: There is a growing interest on formal methods-based robotic planning for temporal logic objectives.
Edit intent: clarity
Original:  To handle the complexity of motion planning with HyperLTL specifications, we introduce a symbolic approach for synthesizing planning strategies on discrete transition systems.
Revised:  To handle the complexity of planning with HyperLTL specifications, we introduce a symbolic approach for synthesizing planning strategies on discrete transition systems.
Edit intent: clarity
Original:  A large number of skin lesion datasets are available publicly, and researchers have developed AI solutions, particularly deep learning algorithms, to distinguish malignant skin lesions from benign lesions in different image modalities such as dermoscopic, clinical, and histopathology images.
Revised:  A large number of skin lesion datasets are available publicly, and researchers have developed AI-based image classification solutions, particularly deep learning algorithms, to distinguish malignant skin lesions from benign lesions in different image modalities such as dermoscopic, clinical, and histopathology images.
Edit intent: clarity
Original:  The quadtree model is developed based on the well-balanced positivity preserving central-upwind scheme proposed in [ %DIFDELCMD < {\sc %%% A. Kurganov and G. Petrova ,%DIFDELCMD < {\em %%%  Commun.
Revised:  The quadtree model is developed based on the well-balanced positivity preserving central-upwind scheme proposed in [ %DIFDELCMD < {\sc %%% A. Kurganov and G. Petrova %DIFDELCMD < {\em %%% Commun.
Edit intent: fluency
Original:  The quadtree model is developed based on the well-balanced positivity preserving central-upwind scheme proposed in [ %DIFDELCMD < {\sc %%% A. Kurganov and G. Petrova ,%DIFDELCMD < {\em %%%  Commun.
Revised:  The quadtree model is developed based on the well-balanced positivity preserving central-upwind scheme proposed in [ %DIFDELCMD < {\sc %%% A. Kurganov and G. Petrova ,%DIFDELCMD < {\em %%% , Commun.
Edit intent: fluency
Original:  In order to achieve this as well as to preserve positivity of water depth, a continuous piecewise bi-linear interpolation of the bottom topography function is utilized  . Local gradients are examined to determine new seeding points in grid refinement for the next timestep.
Revised:  In order to achieve this as well as to preserve positivity of water depth, a continuous piecewise bilinear interpolation of the bottom topography function is utilized . Local gradients are examined to determine new seeding points in grid refinement for the next timestep.
Edit intent: clarity
Original:  We study the expected dispersion with respect to a random set of n points determined by an i.i.d. \ sequence of uniformly distributed random variables.
Revised:  We study the expected dispersion with respect to a random set of n points determined by an i.i.d. sequence of uniformly distributed random variables.
Edit intent: fluency
Original:  Our method uses the SPDE approach  combined with a new fast (ML)QMC algorithm for white noise sampling  .
Revised:  Our method uses the SPDE approach combined with a new fast algorithm for white noise sampling .
Edit intent: coherence
Original: Memory-one strategies are a set of Iterated Prisoner's Dilemma strategies that have been acclaimed for their mathematical tractability and performance against single opponents.
Revised: Memory-one strategies are a set of Iterated Prisoner's Dilemma strategies that have been praised for their mathematical tractability and performance against single opponents.
Edit intent: clarity
Original:  This manuscript investigates best responses to a collection of memory-one strategies  as a multidimensional optimisation problem.
Revised:  This manuscript investigates best responses to a collection of memory-one strategies , as a multidimensional optimisation problem.
Edit intent: fluency
Original:  Though extortionate memory-one strategies have gained much attention, we demonstrate that best response memory-one strategies do not behave in an extortionateway, and moreover, for memory one strategies to be evolutionary robust they need to be able to behave in a forgiving way .
Revised:  We add to the literature that has shown that extortionate play is not always optimal by showing that optimal play is often not extortionate .
Edit intent: coherence
Original:  We also provide evidence that memory-one strategies suffer from their limited memory in multi agent interactions and can be out performed by longer memory strategies .
Revised:  We also provide evidence that memory-one strategies suffer from their limited memory in multi agent interactions and can be out performed by optimised strategies with longer memory .
Edit intent: clarity
Original:  This manuscript investigates a theory of mind: best response memory-one strategies , as a multidimensional optimisation problem.
Revised:  This manuscript investigates best response memory-one strategies , as a multidimensional optimisation problem.
Edit intent: clarity
Original:  We also provide evidence that memory-one strategies suffer from their limited memory in multi agent interactions and can be out performed by optimised strategies with longer memory  .
Revised:  They also provide evidence that memory-one strategies suffer from their limited memory in multi agent interactions and can be out performed by optimised strategies with longer memory .
Edit intent: fluency
Original:  For weighted networks, incrementing the smoothing kernel makes networks more different until a peak is reached and the networks become more similar .
Revised:  For weighted networks, incrementing the smoothing kernel makes networks more different .
Edit intent: clarity
Original:  This is independent of the ROI size, but the effects of link lengthvary .
Revised:  This is independent of the ROI size, but vary with link length .
Edit intent: clarity
Original:  This has important consequences: the choice of smoothing kernel affects the findings in network differences.
Revised:  This has important consequences: the choice of smoothing kernel affects the observed network differences.
Edit intent: clarity