wanyu/IteraTeR_v2 huggingface dataset:
Original:  Under standard assumptions on topologies and on monitors placement, we prove tight upper and lower bounds on the maximal identifiability of failure nodes for specific classes of network topologies, such as trees , bounded-degree graphs, d-dimensional grids, in both directed and undirected cases.
Revised:  We prove tight upper and lower bounds on the maximal identifiability of failure nodes for specific classes of network topologies, such as trees , bounded-degree graphs, d-dimensional grids, in both directed and undirected cases.
Edit intent: clarity
Original:  Under standard assumptions on topologies and on monitors placement, we prove tight upper and lower bounds on the maximal identifiability of failure nodes for specific classes of network topologies, such as trees , bounded-degree graphs, d-dimensional grids, in both directed and undirected cases.
Revised:  Under standard assumptions on topologies and on monitors placement, we prove tight upper and lower bounds on the maximal identifiability of failure nodes for specific classes of network topologies, such as trees and d-dimensional grids, in both directed and undirected cases.
Edit intent: clarity
Original:  Among other results we prove that directed d-dimensional grids with support n have maximal identifiability d using nd monitors;
Revised:  We prove that directed d-dimensional grids with support n have maximal identifiability d using nd monitors;
Edit intent: clarity
Original:  We then study identifiability under embeddings: we establish relations between maximal identifiability, embeddability and  dimension when network topologies are modelled as DAGs.
Revised:  We then study identifiability under embeddings: we establish relations between maximal identifiability, embeddability and dimension when network topologies are model as DAGs.
Edit intent: fluency
Original:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network }  to boost maximal identifiability  .
Revised:  11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network } to boost maximal identifiability .
Edit intent: clarity
Original:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network }  to boost maximal identifiability  .
Revised:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in %DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network } to boost maximal identifiability .
Edit intent: clarity
Original:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network }  to boost maximal identifiability  .
Revised:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network } to boost maximal identifiability .
Edit intent: coherence
Original:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network }  to boost maximal identifiability  .
Revised:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and %DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network } to boost maximal identifiability .
Edit intent: clarity
Original:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% . Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network }  to boost maximal identifiability  .
Revised:  Through our analysis we also refine and generalize results on limits of maximal identifiability recently obtained in 11%DIFDELCMD < ] %%% and 1%DIFDELCMD < ]%%% Our results suggest the design of networks over N nodes with maximal identifiability \Omega( \sqrt{\log N) using 2\log N monitors and heuristics to place monitors and edges in a network } to boost maximal identifiability .
Edit intent: fluency
Original:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, as well as non-defensive CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance applications , such as efficient and specific genetic engineering , cell labeling and information storage, and combating antibiotic resistance .
Revised:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, non-immunological CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance applications , such as efficient and specific genetic engineering , cell labeling and information storage, and combating antibiotic resistance .
Edit intent: clarity
Original:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, as well as non-defensive CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance applications , such as efficient and specific genetic engineering , cell labeling and information storage, and combating antibiotic resistance .
Revised:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, as well as non-defensive CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance uses in biotechnology , such as efficient and specific genetic engineering , cell labeling and information storage, and combating antibiotic resistance .
Edit intent: clarity
Original:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, as well as non-defensive CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance applications , such as efficient and specific genetic engineering , cell labeling and information storage, and combating antibiotic resistance .
Revised:  Here we review a large body of CRISPR-Cas research to explore themes of evolution and selection, population dynamics, horizontal gene transfer, specific and cross-reactive interactions, cost and regulation, as well as non-defensive CRISPR functions that boost host cell robustness . Physical understanding of the CRISPR-Cas system will advance applications , such as efficient and specific genetic engineering , cell labeling and information storage, combatting antibiotic resistance, and human therapeutics .
Edit intent: clarity
Original:  In this work we describe a mechanism by which artificial neural networks can learn rapid-temporal adaptation - the ability to adapt quickly to new environments or tasks - that we call adaptive neurons.
Revised:  In this work we describe a mechanism by which artificial neural networks can learn rapid adaptation - the ability to adapt quickly to new environments or tasks - that we call adaptive neurons.
Edit intent: clarity
Original:  In this work we describe a mechanism by which artificial neural networks can learn rapid-temporal adaptation - the ability to adapt quickly to new environments or tasks - that we call adaptive neurons.
Revised:  In this work we describe a mechanism by which artificial neural networks can learn rapid-temporal adaptation - the ability to adapt on the fly, with little data, to new tasks - that we call adaptive neurons.
Edit intent: clarity
Original:  Adaptive neurons modify their activations with task-specific values retrieved from a working memory .
Revised:  Adaptive neurons modify their activation values with task-specific values retrieved from a working memory .
Edit intent: fluency
Original:  Adaptive neurons modify their activations with task-specific values retrieved from a working memory .
Revised:  Adaptive neurons modify their activations with task-specific shifts retrieved from a working memory .
Edit intent: clarity
Original: An edge-colored graph G isconflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges.
Revised: conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges.
Edit intent: clarity
Original: An edge-colored graph G isconflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges.
Revised: An edge-colored graph G is if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges.
Edit intent: clarity
Original:  Theconflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected.
Revised:  The of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected.
Edit intent: clarity
Original:  A coloring of vertices of a hypergraph H=(V,E) is calledconflict-free if each hyperedge e of H has a vertex of unique color that does not get repeated in e.
Revised:  A coloring of vertices of a hypergraph H=(V,E) is called if each hyperedge e of H has a vertex of unique color that does not get repeated in e.
Edit intent: clarity
Original:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of  edge-path hypergraphs of trees.
Revised:  The smallest number of colors required for such a coloring is called the of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of edge-path hypergraphs of trees.
Edit intent: clarity
Original:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of  edge-path hypergraphs of trees.
Revised:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number \chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of edge-path hypergraphs of trees.
Edit intent: coherence
Original:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of  edge-path hypergraphs of trees.
Revised:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of edge-path hypergraphs of trees.
Edit intent: coherence
Original:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of  edge-path hypergraphs of trees.
Revised:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of edge-path hypergraphs of trees.
Edit intent: coherence
Original:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of  edge-path hypergraphs of trees.
Revised:  The smallest number of colors required for such a coloring is called theconflict-free chromatic number of H, and is denoted by\chi_{cf(H) . In this paper, we study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees.
Edit intent: clarity
Original:  We first prove that for a tree T of order n, cfc(T)\geq cfc(P_n)=\lceil 2 n\rceil, and this completely confirms the conjecture of Li and Wu.
Revised:  We first prove that for a tree T of order n, cfc(T)\geq cfc(P_n)=\lceil 2 n\rceil, which completely confirms the conjecture of Li and Wu.
Edit intent: coherence
Original:  Our codes are algebraic geometry codes built from the Garcia-Stichtenoth function field tower and beat the Gilbert-Varshamov bound for alphabet sizes at least 19^2.
Revised:  Our codes are algebraic geometry codes built from the Garcia-Stichtenoth function field tower beating the Gilbert-Varshamov bound for alphabet sizes at least 19^2.
Edit intent: coherence
Original: The problem of minimizing the age-of-information has been extensively studied in single-hop networks .
Revised: Information updates in multihop networks such as Internet of Things (IoT) and intelligent transportation systems have received significant recent attention .
Edit intent: clarity
Original:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Revised:  When preemption is allowed and the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Edit intent: clarity
Original:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Revised:  If the packet transmission times are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Edit intent: clarity
Original:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Revised:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Served (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Edit intent: fluency
Original:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Revised:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes across all nodes in the network than any other causal policy (in a stochastic ordering sense) than any other causal policy .
Edit intent: fluency
Original:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) than any other causal policy .
Revised:  If the packet transmission times over the network links are exponentially distributed, we prove that a preemptive Last-Generated, First-Serve (LGFS) policy results in smaller age processes at all nodes of the network (in a stochastic ordering sense) .
Edit intent: clarity
Original:  In addition, for arbitrary distributions of packet transmission times  , the non-preemptive LGFS policy is shown to minimize the age processes at all nodes among all non-preemptive work-conserving policies (again in a stochastic ordering sense).
Revised:  In addition, for arbitrary distributions of packet transmission times , the non-preemptive LGFS policy is shown to minimize the age processes across all nodes in the network among all work-conserving policies (again in a stochastic ordering sense).
Edit intent: clarity
Original:  Interestingly, these simple policies can achieve optimality of the joint distribution of the age processes at all nodes even under arbitrary network topologies, as well as arbitrary packet generation and arrival times .
Revised:  Interestingly, these results hold under quite general conditions, including (i) arbitrary packet generation and arrival times .
Edit intent: clarity
Original:  These optimality results not only hold for the age processes , but also for any non-decreasing functional of the age processes . Finally, we investigate the class of New-Better-than-Used (NBU) packet transmission time distributions and show that the non-preemptive LGFS policy is within a constant age gap from the optimum average age, and that the gap is independent of system parameters .
Revised:  These optimality results not only hold for the age processes , but also for any non-decreasing functional of the age processes .
Edit intent: coherence
Original: Cross-lingual plagiarism (CLP) occurs when texts written in one language are translated into a different language and used without acknowledgement .
Revised: Cross-lingual plagiarism (CLP) occurs when texts written in one language are translated into a different language and used without acknowledging the original sources .
Edit intent: clarity
Original:  One of the most common methods used for detecting CLP requires online machine translators (such as Google or Microsoft translate) which are not always available, and given that plagiarism detection typically involves large document comparison, the amount of translations  would overwhelm an online machine translator, especially when detecting plagiarism over the web.
Revised:  One of the most common methods for detecting CLP requires online machine translators (such as Google or Microsoft translate) which are not always available, and given that plagiarism detection typically involves large document comparison, the amount of translations would overwhelm an online machine translator, especially when detecting plagiarism over the web.
Edit intent: clarity
Original:  One of the most common methods used for detecting CLP requires online machine translators (such as Google or Microsoft translate) which are not always available, and given that plagiarism detection typically involves large document comparison, the amount of translations  would overwhelm an online machine translator, especially when detecting plagiarism over the web.
Revised:  One of the most common methods used for detecting CLP requires online machine translators (such as Google or Microsoft translate) which are not always available, and given that plagiarism detection typically involves large document comparison, the amount of translations required would overwhelm an online machine translator, especially when detecting plagiarism over the web.
Edit intent: clarity
Original:  This paper addresses the problem of cross-lingual plagiarism detection (CLPD) by proposing a model that uses simulated word embeddings to reproduce the predictions of an online machine translator (Google translate) when detecting CLP without relying on online translators .
Revised:  This paper addresses the problem of cross-lingual plagiarism detection (CLPD) by proposing a model that uses simulated word embeddings to reproduce the predictions of an online machine translator (Google translate) when detecting CLP .
Edit intent: clarity
Original:  The results indicate that CLP could be detected with state-of-the-art performances by leveraging the prediction accuracy of an internet translator with word embeddings  without relying on internet translators.
Revised:  The results indicate that CLP could be detected with state-of-the-art performances by leveraging the prediction accuracy of an internet translator with word embeddings , without relying on internet translators.
Edit intent: fluency
Original: In this paper, we prove a polynomial lower bound of \Omega(n^{1/3 quantum query complexity of the following rather natural generalisation of both the hidden shift and the 3-sum problem.
Revised: In this paper, we study quantum query complexity of the following rather natural generalisation of both the hidden shift and the 3-sum problem.
Edit intent: clarity
Original:  It is promised that  if this is not the case, then no 3 elements in the table sum up to zero.
Revised:  It is promised that , if this is not the case, then no 3 elements in the table sum up to zero.
Edit intent: fluency
Original: We propose a resource-constrained network growth model that explains the emergence of key structural properties of real-world directed networks: heavy-tailed indegree distribution, high local clusteringand degree-clustering relationship .
Revised: This paper proposes an attributed network growth model that explains the emergence of key structural properties of real-world directed networks: heavy-tailed indegree distribution, high local clusteringand degree-clustering relationship .
Edit intent: clarity