wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also find that travelers represent 72.7 percent of all mobile scholars, but that migrants seem to consistently have higher scientific impact.
Revised:  Travelers represent 72.7 percent of all mobile scholars, but that migrants seem to consistently have higher scientific impact.
Edit intent: coherence
Original:  We also find that travelers represent 72.7 percent of all mobile scholars, but that migrants seem to consistently have higher scientific impact.
Revised:  We also find that travelers represent 72.7 percent of all mobile scholars, but migrants have higher scientific impact.
Edit intent: clarity
Original:  We then apply this classification at the country level, and expand these the traveler/migrant classification based on the directionality of scientists' mobility (  incoming and outgoing).
Revised:  We apply this classification at the country level, and expand these the traveler/migrant classification based on the directionality of scientists' mobility ( incoming and outgoing).
Edit intent: coherence
Original:  We then apply this classification at the country level, and expand these the traveler/migrant classification based on the directionality of scientists' mobility (  incoming and outgoing).
Revised:  We then apply this classification at the country level, expanding the classification to incorporate the directionality of scientists' mobility ( incoming and outgoing).
Edit intent: clarity
Original:  We then apply this classification at the country level, and expand these the traveler/migrant classification based on the directionality of scientists' mobility (  incoming and outgoing).
Revised:  We then apply this classification at the country level, and expand these the traveler/migrant classification based on the directionality of scientists' mobility ( i.e., incoming and outgoing).
Edit intent: clarity
Original:  Our results illustrate the various forms taken by scientific mobility, and highlight the utility of our classification for understanding it .
Revised:  We provide a brief analysis to highlight the utility of our classification for understanding it .
Edit intent: clarity
Original:  We examine this class ] from a structural point of view which leads to constant upper bounds on the clique number , the chromatic number and the clique chromatic number.
Revised:  We examine this class ] from a structural point of view which leads to constant upper bounds on the clique number and the chromatic number.
Edit intent: fluency
Original:  We further investigate the relation between planar graphs and CPG graphs and show that CPG graphs are not necessarily planar and not all planar graphs are CPG . Our class generalizes the well studied class of VCPG graphs .
Revised:  We further investigate the relation between planar graphs and CPG graphs and show that CPG graphs are not necessarily planar and not all planar graphs are CPG .
Edit intent: coherence
Original:  To investigate the impact of invasive species at a network level , we use a generalized food web model, capable of propagating changes through networks with a series of ecologically realistic criteria.
Revised:  To investigate the impact of invasive species at the network scale , we use a generalized food web model, capable of propagating changes through networks with a series of ecologically realistic criteria.
Edit intent: clarity
Original:  Using data from a small British offshore island, we quantify the impacts of four virtual introduced species (a rat, an insectivore, a herbivore and a carnivore ) and explore which clusters of species react in similar ways  .
Revised:  Using data from a small British offshore island, we quantify the impacts of four virtual invasive species ( an insectivore, a herbivore and a carnivore ) and explore which clusters of species react in similar ways .
Edit intent: clarity
Original: We generalise the family of (\sigma, \rho)-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-r dominating set and distance-r independent set.
Revised: We generalize the family of (\sigma, \rho)-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-r dominating set and distance-r independent set.
Edit intent: fluency
Original:  We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as k-trapezoid graphs, Dilworth k-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, k-polygon graphs, circular arc graphs, H-graphs and complements to d-degenerate graphs  .
Revised:  We show that these distance problems are XP parameterized by the structural parameter mim-width, and hence polynomial on graph classes where mim-width is bounded and quickly computable, such as k-trapezoid graphs, Dilworth k-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, k-polygon graphs, circular arc graphs, complements of d-degenerate graphs .
Edit intent: clarity
Original: From a public-health perspective, the occurrence of drug-drug-interactions (DDI) from multiple drug prescriptions is a serious problem, especially in the elderly population.
Revised: The occurrence of drug-drug-interactions (DDI) from multiple drug prescriptions is a serious problem, especially in the elderly population.
Edit intent: clarity
Original:  This is true both for individuals and the system itself since patients with complications due to DDI will likely re-enter the system at a costlier level.
Revised:  This is true both for individuals and health-care systems, since patients with complications due to DDI will likely re-enter the system at a costlier level.
Edit intent: clarity
Original:  This is true both for individuals and the system itself since patients with complications due to DDI will likely re-enter the system at a costlier level.
Revised:  This is true both for individuals and the system itself since patients with complications due to DDI are likely to re-enter the system at a costlier level.
Edit intent: fluency
Original:   We found  181 distinct DDI being prescribed concomitantly to almost 5 \% of the city population.
Revised:  We found that 181 distinct DDI being prescribed concomitantly to almost 5 \% of the city population.
Edit intent: fluency
Original:  We also discovered that women are at a 60\% risk increase of DDI when compared to men , while only having a 6\% co-administration risk increase.
Revised:  We also discovered that women are at a 60\% increased risk of DDI as compared to men , while only having a 6\% co-administration risk increase.
Edit intent: clarity
Original:  These results demonstrate that accurate warning systems for known DDI can be devised for public and private systems alike, resulting in substantial prevention of DDI-related ADR and savings.
Revised:  These results demonstrate that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related ADR and savings.
Edit intent: clarity
Original:  These results demonstrate that accurate warning systems for known DDI can be devised for public and private systems alike, resulting in substantial prevention of DDI-related ADR and savings.
Revised:  These results demonstrate that accurate warning systems for known DDI can be devised for public and private systems alike, resulting in substantial prevention of DDI-related adverse reactions and health-care savings.
Edit intent: clarity
Original:  Patients aged 70-79 years have a 34\% risk of DDI when they are prescribed two or more drugs concomitantly.
Revised:  Patients aged 70-79 years have a 34\% risk of DDI when they are dispensed two or more drugs concomitantly.
Edit intent: clarity
Original:  Interestingly, a null model demonstrates that age and women-specific risks from increased polypharmacy far exceed expectations in those populations.
Revised:  Interestingly, a null model demonstrates that age- and women-specific risks from increased polypharmacy far exceed expectations in those populations.
Edit intent: fluency
Original:  These results demonstrate that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related adverse reactions and health-care savings .
Revised:  These results demonstrate that accurate warning systems for known DDI can be devised for health-care systems leading to substantial reduction of DDI-related adverse reactions and health-care costs .
Edit intent: clarity
Original:  This is the first study of DDI we are aware of that follows an entire city longitudinally for more than 3 months.
Edit intent: clarity
Original:  We found that 181 distinct drug pairs known to interact were dispensed concomitantly to 12 \% of the patients in the city's \\%DIF > of the patients in the city's public health-care system.
Revised:  We found that 181 distinct drug pairs known to interact were dispensed concomitantly to 12 \\%DIF > of the patients in the city's public health-care system.
Edit intent: fluency
Original:  Further, 4 \% of the patients were dispensed DDI combinations, \\%DIF > of the patients were dispensed drug  likely to result in major adverse reactions with costs estimated to be  larger than previously reported in smaller studies.
Revised:  Further, 4 \\%DIF > of the patients were dispensed drug likely to result in major adverse reactions with costs estimated to be larger than previously reported in smaller studies.
Edit intent: clarity
Original:  Further, 4 \% of the patients were dispensed DDI combinations, \\%DIF > of the patients were dispensed drug  likely to result in major adverse reactions with costs estimated to be  larger than previously reported in smaller studies.
Revised:  Further, 4 \% of the patients were dispensed DDI combinations, \\%DIF > of the patients were dispensed drug likely to result in major adverse reactions with costs estimated to be much larger than previously reported in smaller studies.
Edit intent: clarity
Original:  Analysis reveals that women have a 60 \% increased risk of DDI \\%DIF > increased risk of DDI as compared to men;
Revised:  Analysis reveals that women have a 60 \\%DIF > increased risk of DDI as compared to men;
Edit intent: fluency
Original:  the increase becomes 90 \% when only major DDI are considered \\%DIF > when considering only DDI known  . Furthermore, DDI risk increases substantially with age . Patients aged 70-79 years have a 34 \% risk of DDI when they are dispensed two \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Revised:  the increase becomes 90 \\%DIF > when considering only DDI known . Furthermore, DDI risk increases substantially with age . Patients aged 70-79 years have a 34 \% risk of DDI when they are dispensed two \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Edit intent: clarity
Original:  the increase becomes 90 \% when only major DDI are considered \\%DIF > when considering only DDI known  . Furthermore, DDI risk increases substantially with age . Patients aged 70-79 years have a 34 \% risk of DDI when they are dispensed two \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Revised:  the increase becomes 90 \% when only major DDI are considered \\%DIF > when considering only DDI known . Furthermore, DDI risk increases substantially with age ; patients aged 70-79 years have a 34 \% risk of DDI when they are dispensed two \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Edit intent: fluency
Original:  the increase becomes 90 \% when only major DDI are considered \\%DIF > when considering only DDI known  . Furthermore, DDI risk increases substantially with age . Patients aged 70-79 years have a 34 \% risk of DDI when they are dispensed two \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Revised:  the increase becomes 90 \% when only major DDI are considered \\%DIF > when considering only DDI known . Furthermore, DDI risk increases substantially with age . Patients aged 70-79 years have a 34 \\%DIF > risk of DDI when they are dispensed two or more drugs concomitantly.
Edit intent: fluency
Original:  Interestingly, a  null model demonstrates that age- and women-specific risks from increased polypharmacy fail by far to explain the observed risks of DDI in those populations .
Revised:  Interestingly, a null model demonstrates that age- and female-specific risks from increased polypharmacy fail by far to explain the observed risks of DDI in those populations .
Edit intent: fluency
Original:  Interestingly, a  null model demonstrates that age- and women-specific risks from increased polypharmacy fail by far to explain the observed risks of DDI in those populations .
Revised:  Interestingly, a null model demonstrates that age- and women-specific risks from increased polypharmacy fail by far to explain the observed DDI risks in those populations .
Edit intent: clarity
Original:  These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems and public-health policy management, to reduce DDI-related adverse reactions and health-care costs.
Revised:  These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems and public-health management, to reduce DDI-related adverse reactions and health-care costs.
Edit intent: clarity
Original:  These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems and public-health policy management, to reduce DDI-related adverse reactions and health-care costs.
Revised:  These results demonstrate that considerable gender and age biases exist, but that accurate warning systems for known DDI can be devised for health-care systems and public-health policy management, to reduce DDI-related ADR and costs.
Edit intent: coherence
Original: The Virtual Network Embedding Problem (VNEP) captures the essence of many resource allocation problems of today's Cloud Providers , which offer their physical computation and networking resources to customers.
Revised: The Virtual Network Embedding Problem (VNEP) captures the essence of many resource allocation problems of today's infrastructure providers , which offer their physical computation and networking resources to customers.
Edit intent: clarity
Original:  Customers request resources in the form of Virtual Networks, i.e. as a directed graph , specifying computational requirements at the nodes and bandwidth requirements on the edges.
Revised:  Customers request resources in the form of Virtual Networks, i.e. as a directed graph which specifies computational requirements at the nodes and bandwidth requirements on the edges.
Edit intent: clarity
Original:  Customers request resources in the form of Virtual Networks, i.e. as a directed graph , specifying computational requirements at the nodes and bandwidth requirements on the edges.
Revised:  Customers request resources in the form of Virtual Networks, i.e. as a directed graph , specifying computational requirements at the nodes and communication requirements on the edges.
Edit intent: clarity
Original:  An embedding of a Virtual Network on the shared physical infrastructure is the joint mapping of (virtual) nodes to suitable physical servers together with the mapping of (virtual) edges onto paths in the physical network connecting the respective servers.
Revised:  An embedding of a Virtual Network on the shared physical infrastructure is the joint mapping of (virtual) nodes to physical servers together with the mapping of (virtual) edges onto paths in the physical network connecting the respective servers.
Edit intent: clarity
Original:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities.
Revised:  We study the offline setting of the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities.
Edit intent: coherence
Original:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities.
Revised:  We study the offline setting of the VNEP in which multiple requests are given and the task is to embed the most profitable set of requests to embed while not exceeding the physical resource capacities.
Edit intent: clarity
Original:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities.
Revised:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable subset while not exceeding the physical resource capacities.
Edit intent: clarity
Original:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding the physical resource capacities.
Revised:  We study the offline setting of the VNEP in which multiple requests are given and the task is to find the most profitable set of requests to embed while not exceeding resource capacities.
Edit intent: clarity
Original:  This paper initiates the study of approximation algorithms for the VNEP by employing randomized rounding of Linear Programming solutions.
Revised:  Our approximation is based on the randomized rounding of Linear Programming solutions.
Edit intent: clarity
Original:  In turn, focusing on the class of cactus graphs for virtual networks , we devise a novel Linear Programming formulationtogether with an algorithm to decompose fractional solutions into convex combinations of valid embeddings.
Revised:  In turn, focusing on the class of cactus graphs for virtual networks , we devise a novel LP formulation, whose solutions can be decomposed into convex combinations of valid embeddings.
Edit intent: clarity
Original:  This conjecture, which we term the " lottery ticket hypothesis, " proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network.
Revised:  This conjecture, which we term the lottery ticket hypothesis, " proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network.
Edit intent: fluency
Original:  This conjecture, which we term the " lottery ticket hypothesis, " proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network.
Revised:  This conjecture, which we term the " lottery ticket hypothesis, proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network.
Edit intent: fluency
Original:  This conjecture, which we term the lottery ticket hypothesis, proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network . Larger networks have more of these " lottery tickets, " meaning they are more likely to luck out with a subcomponent initialized in a configuration amenable to successful optimization.
Revised:  This conjecture, which we term " lottery tickets, " meaning they are more likely to luck out with a subcomponent initialized in a configuration amenable to successful optimization.
Edit intent: clarity
Original:  This conjecture, which we term the lottery ticket hypothesis, proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network . Larger networks have more of these " lottery tickets, " meaning they are more likely to luck out with a subcomponent initialized in a configuration amenable to successful optimization.
Revised:  This conjecture, which we term the lottery ticket hypothesis, proposes that successful training depends on lucky random initialization of a smaller subcomponent of the network . Larger networks have more of these " winning tickets, " meaning they are more likely to luck out with a subcomponent initialized in a configuration amenable to successful optimization.
Edit intent: clarity
Original:  This paper conducts a series of experiments with XOR, MNIST (for fully-connected networks), and CIFAR10 (for convolutional networks) that support the lottery ticket hypothesis.
Revised:  This paper conducts a series of experiments that support the lottery ticket hypothesis.
Edit intent: clarity
Original: Neural network compression techniques are able to reduce the parameter counts of trained networks by over 90\% --decreasing storage requirements and improving inference performance--without compromising accuracy.
Revised: Neural network compression techniques are able to reduce the parameter counts of trained networks by over 90\% , decreasing storage requirements and improving inference performance--without compromising accuracy.
Edit intent: fluency
Original: Neural network compression techniques are able to reduce the parameter counts of trained networks by over 90\% --decreasing storage requirements and improving inference performance--without compromising accuracy.
Revised: Neural network compression techniques are able to reduce the parameter counts of trained networks by over 90\% --decreasing storage requirements and improving computational performance of inference without compromising accuracy.
Edit intent: clarity
Original:  However, contemporary experience is that it is difficult to train small architectures from scratch , which would similarly improve training performance.
Revised:  However, contemporary experience is that it is difficult to train from the start , which would similarly improve training performance.
Edit intent: clarity
Original:  We articulate a new conjecture to explain why it is easier to train large networks: the "lottery ticket hypothesis . " It states that large networks that train successfully contain subnetworks that--when trained in isolation--converge in a comparable number of iterations to comparable accuracy.
Revised:  We articulate a new conjecture to explain why it is easier to train large networks: the "lottery ticket hypothesis " It states that large networks that train successfully contain subnetworks that--when trained in isolation--converge in a comparable number of iterations to comparable accuracy.
Edit intent: fluency
Original:  We find that a standard technique for pruning weights naturally uncovers subnetworks whose initializations made them capable of training effectively.
Revised:  We find that a standard pruning technique naturally uncovers subnetworks whose initializations made them capable of training effectively.
Edit intent: clarity
Original:  Based on these results, we articulate the "lottery ticket hypothesis ": dense, randomly-initialized  feed-forward networks contain subnetworks ("winning tickets") that - when trained in isolation - arrive at comparable test accuracy in a comparable number of iterations.
Revised:  Based on these results, we articulate the "lottery ticket hypothesis :" dense, randomly-initialized feed-forward networks contain subnetworks ("winning tickets") that - when trained in isolation - arrive at comparable test accuracy in a comparable number of iterations.
Edit intent: fluency
Original:  Based on these results, we articulate the "lottery ticket hypothesis ": dense, randomly-initialized  feed-forward networks contain subnetworks ("winning tickets") that - when trained in isolation - arrive at comparable test accuracy in a comparable number of iterations.
Revised:  Based on these results, we articulate the "lottery ticket hypothesis ": dense, randomly-initialized , feed-forward networks contain subnetworks ("winning tickets") that - when trained in isolation - arrive at comparable test accuracy in a comparable number of iterations.
Edit intent: fluency