wanyu/IteraTeR_full_sent huggingface dataset:
Original:  In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function, which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a convex program (of exponential size in general, polynomial size for special cases). We also prove some interesting characterizations of the optimal mechanisms based on these properties. 2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation.
Revised:  In this case, we prove that finding the optimal advertising strategy is equivalent to finding the concave closure of a function, which is NP-hard in general . Based on this observation, we prove some properties of the optimal mechanism, which allow us to solve for the optimal mechanism by a finite-size convex program. The convex program will have a polynomial size if the state of the world has a constant number of possible realizations or the buyers face a decision problem with a constant number of options. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation.
Edit intent: meaning-changed
Original:  2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation.
Revised:  2. For the general problem , we prove that it is NP-hard to find the optimal mechanism. (2) When the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation.
Edit intent: meaning-changed
Original:  2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, it is NP-hard to find a constant factor approximation. We thus look at special cases and provide an approximation algorithm that finds an \varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase  .
Revised:  2. For the general problem when the seller faces buyers of different types and only knows the distribution of their types, we provide an approximation algorithm that finds an \varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase .
Edit intent: coherence
Original:  We thus look at special cases and provide an approximation algorithm that finds an \varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase  .
Revised:  We thus look at special cases and provide an approximation algorithm that finds an \varepsilon-suboptimal mechanism when it is not too hard to predict the possible type of buyers who will make the purchase . For the general problem, we prove that it is NP-hard to find a constant-factor approximation .
Edit intent: meaning-changed
Original:  I give a set of relaxed assumptions \tilde{A} that can never be rejected and always preserve the identified set of local average treatment effect (LATE ).
Revised:  I apply my methodology to the instrument monotonicity assumption in Local Average Treatment Effect (LATE) estimation and to the sector selection assumption in a binary outcome Roy model of employment sector choice. In the LATE application, I use my general method to construct a set of relaxed assumptions \tilde{A} that can never be rejected and always preserve the identified set of local average treatment effect (LATE ).
Edit intent: meaning-changed
Original:  I give a set of relaxed assumptions \tilde{A} that can never be rejected and always preserve the identified set of local average treatment effect (LATE ). The LATE  is point identified and easy to estimate under \tilde{A} 
Revised:  I give a set of relaxed assumptions \tilde{A} that can never be rejected and always preserve the identified set of LATE is point identified and easy to estimate under \tilde{A} 
Edit intent: clarity
Original:  In this paper, we investigate a novel architecture named Relation-Aware GCN (RA-GCN ), which efficiently exploits syntactic relation labels and models the relation between words specifically. We first propose a relation-aware aggregation module to produce expressive word representation by aggregating syntactically connected words through specific relation .
Revised:  In this paper, we investigate a novel architecture named Relation-Aware GCN (RA-GCN ), which simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected words through specific relation .
Edit intent: meaning-changed
Original: YouTube recently announced a decision to exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content .
Revised: In January 2019, YouTube announced it would exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content .
Edit intent: meaning-changed
Original: YouTube recently announced a decision to exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content .
Revised: YouTube recently announced a decision to exclude potentially harmful content from video recommendations but allow such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content .
Edit intent: coherence
Original: YouTube recently announced a decision to exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating this content .
Revised: YouTube recently announced a decision to exclude potentially harmful content from video recommendations while allowing such videos to remain on the platform , but it is unclear whether this compromise is sufficient in mitigating YouTube's role in propagating such content, continued availability of these videos in other online spaces makes it unclear whether this compromise actually reduces their spread .
Edit intent: meaning-changed
Original:  To assess this impact, we measure YouTube sharing in Twitter and Reddit  in the eight months around YouTube's announcement using interrupted time series models. These models evaluate YouTube's impact on sharing of videos from a curated set of alternative political channelsand popular videos shared in three conspiracy-oriented Reddit subreddits;
Revised:  To assess this impact, we measure YouTube sharing in Twitter and Reddit in the eight months around YouTube's announcement . We evaluate video sharing across three curated sets of potentially harmful, anti-social content: a set of conspiracy videos that have been shown to experience reduced recommendations in YouTube, a larger set of videos posted by conspiracy-oriented channels, and a set of videos posted by alternative influence network (AIN) channels. As a control, we also evaluate effects on video sharing in a dataset of videos from a curated set of alternative political channelsand popular videos shared in three conspiracy-oriented Reddit subreddits;
Edit intent: meaning-changed
Original:  These models evaluate YouTube's impact on sharing of videos from a curated set of alternative political channelsand popular videos shared in three conspiracy-oriented Reddit subreddits; we compare these models to a placebo dataset of makeup-oriented videos that should be unaffected by YouTube's announcement. Results suggest YouTube's de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in both Twitter and Reddit , with our models showing a significant and downward trend in sharing.
Revised:  These models evaluate YouTube's impact on sharing of videos from mainstream news channels. Results show conspiracy-labeled and AIN videos that have evidence of YouTube's de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in both Twitter and Reddit , with our models showing a significant and downward trend in sharing.
Edit intent: clarity
Original:  Results suggest YouTube's de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in both Twitter and Reddit , with our models showing a significant and downward trend in sharing. For conspiracy video sharing , however, we see no significant change in Reddit and find an increase in the level of conspiracy sharing in Twitter.
Revised:  Results suggest YouTube's de-recommending AIN-produced content has a significant suppressive effect on sharing of AIN videos in both Twitter and Reddit . For videos from conspiracy-oriented channels , however, we see no significant change in Reddit and find an increase in the level of conspiracy sharing in Twitter.
Edit intent: clarity
Original:  For conspiracy video sharing , however, we see no significant change in Reddit and find an increase in the level of conspiracy sharing in Twitter. We see no significant effect on makeup sharingin either platform , suggesting YouTube's targeting particular content types has a targeted effect.
Revised:  For conspiracy video sharing , however, we see no significant change in Reddit and find an increase in the level of conspiracy-channel sharing in Reddit. For mainstream news sharing, we actually see an increase in trend on both platforms , suggesting YouTube's targeting particular content types has a targeted effect.
Edit intent: meaning-changed
Original:  Reducing exposure to anti-social videos without deleting them therefore has the potential to improve quality across the information ecosystem, but additional transparency is needed to evaluate these effects further.
Revised:  Reducing exposure to anti-social videos within YouTube, without deletion, has potential pro-social, cross-platform effects. At the same time, increases in the level of conspiracy-channel sharing raise concerns about content producers' responses to these changes, and platform transparency is needed to evaluate these effects further.
Edit intent: meaning-changed
Original:  We examined the operators' gazeand head movements, and hand interactions to essential regions (hotspotson machine surface) to determine behavioral differences among continuous skill improving experiences. We modeled the variety of user behaviors to an extensive task model with a two-step automatic approach, baseline model selection and experience integration.
Revised:  We examined the operators' gazeand head movements, and hand interactions with hotspots, and observed significant behavioral changes as a result of continuous skill improvement. We automatically modeled the variety of user behaviors to an extensive task model with a two-step automatic approach, baseline model selection and experience integration.
Edit intent: clarity
Original:  The experimental results indicate that some features, such as task execution time and user head movements, are good indexes for skill level and provide valuable information that can be applied to obtain an effective task model. Operators with varying knowledge and operating habits demonstrate different operational features, which can contribute to the design of user-specific guidance .
Revised:  The experimental results indicate that some features, such as task execution time and user head movements, are good indexes for skill level evaluation, and provide useful information for integrating various records corresponding to different skill levels and behavioral characteristics. Integrating operation records with operating habits allowed developing a rich inclusive task model that could be used to flexibly adapt to various user-specific guidance .
Edit intent: clarity
Original: Many proofs of concept blockchain applications built using Hyperledger Fabric, a permissioned blockchain platform, have recently been transformed into production. However, the performance provided by Hyperledger Fabric is of significant concern for enterprises due to steady growth in network usage. Hence, in this paper, we study the performance achieved in a Fabricnetwork using vertical scaling (i.e., by adding more vCPUs) and horizontal scaling (i. e., by adding more nodes) techniques.
Revised: Permissioned blockchains are becoming popular as data management systems in the enterprise setting. Compared to traditional distributed databases, blockchain platforms provide increased security guarantees but significantly lower performance. Further, these platforms are quite expensive to run for the low throughput they provide. The following are two ways to improve performance and reduce cost: (1) make the system utilize allocated resources efficiently; (2) allow rapid and dynamic scaling of allocated resources based on load. We explore both of these in this work. We first investigate the reasons for the poor performance and scalability of the dominant permissioned blockchain flavor called Execute-Order-Validate (EOV). We do this by studying the scaling characteristics of Hyperledger Fabric, a popular EOV platform, using vertical scaling (i.e., by adding more vCPUs) and horizontal scaling (i. e., by adding more nodes) techniques.
Edit intent: meaning-changed
Original:  Hence, in this paper, we study the performance achieved in a Fabricnetwork using vertical scaling (i.e., by adding more vCPUs) and horizontal scaling (i. e., by adding more nodes) techniques. We observe that network scales very poorly with both of these techniques.
Revised:  Hence, in this paper, we study the performance achieved in a Fabricnetwork using vertical scaling (i.e., by adding more vCPUs) and horizontal scaling . We find that the transaction throughput scales very poorly with both of these techniques.
Edit intent: clarity
Original:   With vertical scaling, due to serial execution of validation commit phases of transactions, the allocated vCPUs are underutilized. With horizontal scaling,  due to redundant work between nodes , allocated resources are wasted though it is utilized.
Revised:  With vertical scaling, due to serial execution of validation commit phases of transactions, the allocated vCPUs go under-utilized. In contrast, with horizontal scaling, due to redundant work between nodes , allocated resources are wasted though it is utilized.
Edit intent: clarity
Original:  With horizontal scaling,  due to redundant work between nodes , allocated resources are wasted though it is utilized. Further, we identify these techniques to be unsuited for dynamically scaling anetwork quickly to mitigate an overload situation, and hence, it results in a 30\% drop in the performance. To increase the CPU utilization and hence the performance, we re-architect Fabric to enable pipelined execution of validation & commit phases by introducing dirty state management using a trie data structure.
Revised:  With horizontal scaling, due to redundant work across nodes within URLanization. To mitigate the above concerns, we first improve resource efficiency by (a) improving CPU utilization with a pipelined execution of validation & commit phases by introducing dirty state management using a trie data structure.
Edit intent: clarity
Original:  To increase the CPU utilization and hence the performance, we re-architect Fabric to enable pipelined execution of validation & commit phases by introducing dirty state management using a trie data structure. Additionally, we facilitated the validation phase to validate transactions in parallel by introducing a waiting-transactions dependency graph. To avoid redundant work performed between nodes and to quickly scale up a network, we propose a new type of peer node called sparse peer , which selective commits transactions.
Revised:  To increase the CPU utilization and hence the performance, we re-architect Fabric to enable pipelined execution of validation & commit phases ; (b) avoiding redundant work across nodes by introducing a new type of peer node called sparse peer , which selective commits transactions.
Edit intent: coherence
Original:  Understanding the physicochemical properties of ligand-binding sites is very important in the field of drug discovery as well as understanding biological systems. Protein-ligand binding site plays an essential role in the interaction between protein and ligand that is necessary for any living system to survive. Comparing similarities between binding siteshas been one of the main focus areas since the last decade in bioinformatics and drug discovery .
Revised:  Tasks such as assessment of protein functional similarity and detection of side effects of drugs need identification of similar binding sites of disparate proteins across diverse pathways. Machine learning methods for similarity assessment require feature descriptors of binding sites. Traditional methods based on hand engineered motifs and atomic configurations are not scalable across several thousands of sites .
Edit intent: meaning-changed
Original:  We report in this study, development of Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Revised:  We report here a novel algorithm Site2Vec , a novel machine learning-based method for reference frame invariant ligand-independent vector embedding of the 3D structure of a protein-ligand binding site.
Edit intent: clarity
Original:  Each binding site is represented in a d-dimensional vector form. The 3D structures of binding sites are mapped to vector form such that similar binding sites hash into proximal localities, and dissimilar sitesfall across diverse regions. A sensitivity analysis of rotation and perturbation and validation study is performed to understand the behavior of the method . Benchmarking exercises have been carried out against state of the art binding site comparison methods on state of the art datasets.
Revised:  The method is based on pairwise distances between representative points and chemical compositions in terms of constituent amino acids of a site. The vector embedding serves as a locality sensitive hash function for proximity queries and determining similar sites. The method has been the top performer with more than 95\% quality scores in extensive benchmarking studies carried over 10 datasets and against 23 other site comparison methods on state of the art datasets.
Edit intent: clarity
Original:  Benchmarking exercises have been carried out against state of the art binding site comparison methods on state of the art datasets. The exercises validate our proposed method and demonstrate that the proposed method is rotationally invariant and can handle natural perturbations expected in the biological system.
Revised:  Benchmarking exercises have been carried out against state of the art binding site comparison methods . The algorithm serves for high throughput processing and has been evaluated for stability with respect to reference frame shifts, coordinate perturbations and residue mutations. We provide Site2Vec as a stand alone executable and a web service hosted at URL
Edit intent: meaning-changed
Original:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Revised:  During this period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Edit intent: fluency
Original:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Revised:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease 2019 (COVID-19 ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Edit intent: meaning-changed
Original:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Revised:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, investigation of control strategies and forecasting are necessary for health care planning and control the virus with limited resource .
Edit intent: meaning-changed
Original:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning and control the virus with limited resource .
Revised:  During the period of an epidemic when human-to-human transmission is established and reported cases of coronavirus disease (COVID ) are rising worldwide, forecasting is of utmost importance for health care planning .
Edit intent: coherence
Original:  Numerical results show that the modification factor for quarantine, modification factor for isolation and transmission rate are quite effective in reduction of the COVID casesin Hubei. Thus, COVID is controllable by reducing contacts with infected people and increasing the efficiency of quarantine and isolation. Health care officials should supply medications, protective masks and necessary human resources in the affected areas .
Revised:  Thus, if limited resources are available, then investing on the quarantined individuals will be more fruitful in terms of reduction of cases .
Edit intent: coherence
Original:  In complement, a graph is fan-crossing if each edge can be crossed by edges of a fan. Then  the crossing edges are incident to a common vertex . Graphs are k-planar if each edge is crossed by at most k edges, and k-gap-planar if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge .
Revised:  On the other hand, it is the crossing edges are incident to a common vertex . Graphs are k-planar if each edge is crossed by at most k edges, and k-gap-planar if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge .
Edit intent: coherence
Original:  Then  the crossing edges are incident to a common vertex . Graphs are k-planar if each edge is crossed by at most k edges, and k-gap-planar if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge .
Revised:  Thenfan-crossing the crossing edges are incident to a common vertex . Graphs are k-planar if each edge is crossed by at most k edges, and k-gap-planar if each crossing is assigned to an edge involved in the crossing, so that at most k crossings are assigned to each edge .
Edit intent: clarity